About the Execution of ITS-Tools for FunctionPointer-PT-c004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16207.107 | 3600000.00 | 4402634.00 | 9537.90 | 0 ? 0 ? 0 ? ? 0 0 0 ? ? ? 0 0 4 | 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-171640603100285.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-c004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603100285
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 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:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 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-c004-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716478762174
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-c004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-23 15:39:23] [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 15:39:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 15:39:23] [INFO ] Load time of PNML (sax parser for PT used): 391 ms
[2024-05-23 15:39:23] [INFO ] Transformed 2826 places.
[2024-05-23 15:39:23] [INFO ] Transformed 8960 transitions.
[2024-05-23 15:39:23] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 555 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 1198 places in 43 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 15:39:24] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-23 15:39:24] [INFO ] Computed 4 invariants in 104 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
RANDOM walk for 10000 steps (2 resets) in 308 ms. (32 steps per ms)
BEST_FIRST walk for 80008 steps (16 resets) in 244 ms. (326 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 2, 16, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2024-05-23 15:39:24] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2024-05-23 15:39:24] [INFO ] Invariant cache hit.
[2024-05-23 15:39:25] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2024-05-23 15:39:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 15:39:26] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2024-05-23 15:39:26] [INFO ] State equation strengthened by 479 read => feed constraints.
[2024-05-23 15:39:26] [INFO ] [Real]Added 479 Read/Feed constraints in 125 ms returned sat
[2024-05-23 15:39:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:39:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 15:39:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 15:39:27] [INFO ] [Nat]Absence check using state equation in 736 ms returned sat
[2024-05-23 15:39:27] [INFO ] [Nat]Added 479 Read/Feed constraints in 202 ms returned sat
[2024-05-23 15:39:28] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 754 ms.
[2024-05-23 15:39:28] [INFO ] Added : 2 causal constraints over 1 iterations in 1163 ms. Result :sat
Minimization took 588 ms.
[2024-05-23 15:39:29] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 15:39:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 15:39:30] [INFO ] [Real]Absence check using state equation in 752 ms returned sat
[2024-05-23 15:39:30] [INFO ] [Real]Added 479 Read/Feed constraints in 108 ms returned sat
[2024-05-23 15:39:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:39:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 15:39:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-23 15:39:31] [INFO ] [Nat]Absence check using state equation in 691 ms returned sat
[2024-05-23 15:39:31] [INFO ] [Nat]Added 479 Read/Feed constraints in 114 ms returned sat
[2024-05-23 15:39:33] [INFO ] Deduced a trap composed of 142 places in 1270 ms of which 83 ms to minimize.
[2024-05-23 15:39:34] [INFO ] Deduced a trap composed of 229 places in 1305 ms of which 25 ms to minimize.
[2024-05-23 15:39:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2878 ms
[2024-05-23 15:39:35] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 442 ms.
[2024-05-23 15:39:35] [INFO ] Added : 2 causal constraints over 1 iterations in 780 ms. Result :sat
Minimization took 332 ms.
[2024-05-23 15:39:35] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 15:39:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 15:39:36] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2024-05-23 15:39:36] [INFO ] [Real]Added 479 Read/Feed constraints in 100 ms returned sat
[2024-05-23 15:39:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:39:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 15:39:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 15:39:37] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2024-05-23 15:39:37] [INFO ] [Nat]Added 479 Read/Feed constraints in 117 ms returned sat
[2024-05-23 15:39:38] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 420 ms.
[2024-05-23 15:39:38] [INFO ] Added : 2 causal constraints over 1 iterations in 740 ms. Result :sat
Minimization took 579 ms.
[2024-05-23 15:39:39] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 15:39:39] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 15:39:40] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2024-05-23 15:39:40] [INFO ] [Real]Added 479 Read/Feed constraints in 113 ms returned sat
[2024-05-23 15:39:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:39:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 15:39:40] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 15:39:41] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2024-05-23 15:39:41] [INFO ] [Nat]Added 479 Read/Feed constraints in 129 ms returned sat
[2024-05-23 15:39:42] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 438 ms.
[2024-05-23 15:39:42] [INFO ] Added : 2 causal constraints over 1 iterations in 758 ms. Result :sat
Minimization took 579 ms.
[2024-05-23 15:39:43] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 15:39:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 15:39:43] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2024-05-23 15:39:44] [INFO ] [Real]Added 479 Read/Feed constraints in 125 ms returned sat
[2024-05-23 15:39:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:39:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2024-05-23 15:39:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 15:39:45] [INFO ] [Nat]Absence check using state equation in 695 ms returned sat
[2024-05-23 15:39:45] [INFO ] [Nat]Added 479 Read/Feed constraints in 114 ms returned sat
[2024-05-23 15:39:46] [INFO ] Deduced a trap composed of 134 places in 1170 ms of which 11 ms to minimize.
[2024-05-23 15:39:47] [INFO ] Deduced a trap composed of 133 places in 1176 ms of which 12 ms to minimize.
[2024-05-23 15:39:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2747 ms
[2024-05-23 15:39:48] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 478 ms.
[2024-05-23 15:39:48] [INFO ] Added : 2 causal constraints over 1 iterations in 796 ms. Result :sat
Minimization took 481 ms.
[2024-05-23 15:39:49] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 15:39:49] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 15:39:50] [INFO ] [Real]Absence check using state equation in 737 ms returned sat
[2024-05-23 15:39:50] [INFO ] [Real]Added 479 Read/Feed constraints in 141 ms returned sat
[2024-05-23 15:39:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:39:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 15:39:50] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 15:39:51] [INFO ] [Nat]Absence check using state equation in 789 ms returned sat
[2024-05-23 15:39:51] [INFO ] [Nat]Added 479 Read/Feed constraints in 117 ms returned sat
[2024-05-23 15:39:52] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 423 ms.
[2024-05-23 15:39:52] [INFO ] Added : 2 causal constraints over 1 iterations in 751 ms. Result :sat
Minimization took 577 ms.
[2024-05-23 15:39:53] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 15:39:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 15:39:53] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2024-05-23 15:39:54] [INFO ] [Real]Added 479 Read/Feed constraints in 124 ms returned sat
[2024-05-23 15:39:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:39:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 15:39:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 15:39:55] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2024-05-23 15:39:55] [INFO ] [Nat]Added 479 Read/Feed constraints in 116 ms returned sat
[2024-05-23 15:39:55] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 412 ms.
[2024-05-23 15:39:55] [INFO ] Added : 2 causal constraints over 1 iterations in 730 ms. Result :sat
Minimization took 578 ms.
[2024-05-23 15:39:56] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 15:39:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 15:39:57] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2024-05-23 15:39:57] [INFO ] [Real]Added 479 Read/Feed constraints in 110 ms returned sat
[2024-05-23 15:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:39:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 15:39:57] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 15:39:58] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2024-05-23 15:39:58] [INFO ] [Nat]Added 479 Read/Feed constraints in 119 ms returned sat
[2024-05-23 15:39:59] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 427 ms.
[2024-05-23 15:39:59] [INFO ] Added : 2 causal constraints over 1 iterations in 729 ms. Result :sat
Minimization took 578 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 2, 16, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 2, 2, 16, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
Support contains 8 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 1423 are kept as prefixes of interest. Removing 205 places using SCC suffix rule.12 ms
Discarding 205 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 1423 transition count 5583
Discarding 300 places :
Symmetric choice reduction at 1 with 300 rule applications. Total rules 680 place count 1123 transition count 3301
Iterating global reduction 1 with 300 rules applied. Total rules applied 980 place count 1123 transition count 3301
Ensure Unique test removed 362 transitions
Reduce isomorphic transitions removed 362 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 1342 place count 1123 transition count 2939
Discarding 155 places :
Symmetric choice reduction at 2 with 155 rule applications. Total rules 1497 place count 968 transition count 2629
Iterating global reduction 2 with 155 rules applied. Total rules applied 1652 place count 968 transition count 2629
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1720 place count 968 transition count 2561
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1733 place count 955 transition count 2535
Iterating global reduction 3 with 13 rules applied. Total rules applied 1746 place count 955 transition count 2535
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1759 place count 942 transition count 2509
Iterating global reduction 3 with 13 rules applied. Total rules applied 1772 place count 942 transition count 2509
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1785 place count 929 transition count 2483
Iterating global reduction 3 with 13 rules applied. Total rules applied 1798 place count 929 transition count 2483
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1811 place count 916 transition count 2457
Iterating global reduction 3 with 13 rules applied. Total rules applied 1824 place count 916 transition count 2457
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1837 place count 903 transition count 2431
Iterating global reduction 3 with 13 rules applied. Total rules applied 1850 place count 903 transition count 2431
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1863 place count 890 transition count 2405
Iterating global reduction 3 with 13 rules applied. Total rules applied 1876 place count 890 transition count 2405
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1889 place count 877 transition count 2379
Iterating global reduction 3 with 13 rules applied. Total rules applied 1902 place count 877 transition count 2379
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1954 place count 825 transition count 2185
Iterating global reduction 3 with 52 rules applied. Total rules applied 2006 place count 825 transition count 2185
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2063 place count 768 transition count 1957
Iterating global reduction 3 with 57 rules applied. Total rules applied 2120 place count 768 transition count 1957
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2177 place count 711 transition count 1815
Iterating global reduction 3 with 57 rules applied. Total rules applied 2234 place count 711 transition count 1815
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2291 place count 654 transition count 1701
Iterating global reduction 3 with 57 rules applied. Total rules applied 2348 place count 654 transition count 1701
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2405 place count 597 transition count 1587
Iterating global reduction 3 with 57 rules applied. Total rules applied 2462 place count 597 transition count 1587
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2519 place count 540 transition count 1473
Iterating global reduction 3 with 57 rules applied. Total rules applied 2576 place count 540 transition count 1473
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2633 place count 483 transition count 1359
Iterating global reduction 3 with 57 rules applied. Total rules applied 2690 place count 483 transition count 1359
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 2704 place count 469 transition count 1331
Iterating global reduction 3 with 14 rules applied. Total rules applied 2718 place count 469 transition count 1331
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 2732 place count 469 transition count 1317
Applied a total of 2732 rules in 1153 ms. Remains 469 /1628 variables (removed 1159) and now considering 1317/5962 (removed 4645) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1164 ms. Remains : 469/1628 places, 1317/5962 transitions.
[2024-05-23 15:40:01] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
Found an invariant !
This invariant on transitions {224=1, 350=1, 684=1, 755=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {248=1, 374=1, 708=1, 759=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :[2, 0, 0, 15, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 2, 2, 16, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2024-05-23 15:40:01] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-23 15:40:01] [INFO ] Computed 3 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2, 16, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
RANDOM walk for 1000000 steps (2 resets) in 2290 ms. (436 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 4693 ms. (1704 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 7100, 1, 527, 490, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2024-05-23 15:40:08] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:40:08] [INFO ] Invariant cache hit.
[2024-05-23 15:40:08] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:40:08] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 15:40:08] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:40:09] [INFO ] [Real]Added 95 Read/Feed constraints in 44 ms returned sat
[2024-05-23 15:40:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:40:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:40:09] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 15:40:09] [INFO ] [Nat]Added 95 Read/Feed constraints in 30 ms returned sat
[2024-05-23 15:40:09] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 87 ms.
[2024-05-23 15:40:09] [INFO ] Added : 2 causal constraints over 1 iterations in 181 ms. Result :sat
Minimization took 282 ms.
[2024-05-23 15:40:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:40:10] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 15:40:10] [INFO ] [Real]Added 95 Read/Feed constraints in 39 ms returned sat
[2024-05-23 15:40:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:40:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:40:10] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 15:40:10] [INFO ] [Nat]Added 95 Read/Feed constraints in 34 ms returned sat
[2024-05-23 15:40:10] [INFO ] Deduced a trap composed of 75 places in 196 ms of which 3 ms to minimize.
[2024-05-23 15:40:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2024-05-23 15:40:10] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 65 ms.
[2024-05-23 15:40:10] [INFO ] Added : 2 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 271 ms.
[2024-05-23 15:40:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:40:11] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 15:40:11] [INFO ] [Real]Added 95 Read/Feed constraints in 40 ms returned sat
[2024-05-23 15:40:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:40:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:40:11] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 15:40:11] [INFO ] [Nat]Added 95 Read/Feed constraints in 36 ms returned sat
[2024-05-23 15:40:11] [INFO ] Deduced a trap composed of 100 places in 203 ms of which 3 ms to minimize.
[2024-05-23 15:40:12] [INFO ] Deduced a trap composed of 95 places in 196 ms of which 3 ms to minimize.
[2024-05-23 15:40:12] [INFO ] Deduced a trap composed of 83 places in 204 ms of which 3 ms to minimize.
[2024-05-23 15:40:12] [INFO ] Deduced a trap composed of 78 places in 199 ms of which 3 ms to minimize.
[2024-05-23 15:40:12] [INFO ] Deduced a trap composed of 76 places in 196 ms of which 3 ms to minimize.
[2024-05-23 15:40:12] [INFO ] Deduced a trap composed of 75 places in 189 ms of which 3 ms to minimize.
[2024-05-23 15:40:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1343 ms
[2024-05-23 15:40:13] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 75 ms.
[2024-05-23 15:40:13] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 273 ms.
[2024-05-23 15:40:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:40:13] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 15:40:13] [INFO ] [Real]Added 95 Read/Feed constraints in 43 ms returned sat
[2024-05-23 15:40:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:40:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:40:13] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 15:40:13] [INFO ] [Nat]Added 95 Read/Feed constraints in 38 ms returned sat
[2024-05-23 15:40:14] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 74 ms.
[2024-05-23 15:40:14] [INFO ] Added : 4 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 270 ms.
[2024-05-23 15:40:14] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:40:14] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 15:40:14] [INFO ] [Real]Added 95 Read/Feed constraints in 23 ms returned sat
[2024-05-23 15:40:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:40:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:40:14] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 15:40:14] [INFO ] [Nat]Added 95 Read/Feed constraints in 33 ms returned sat
[2024-05-23 15:40:15] [INFO ] Deduced a trap composed of 100 places in 210 ms of which 3 ms to minimize.
[2024-05-23 15:40:15] [INFO ] Deduced a trap composed of 93 places in 197 ms of which 3 ms to minimize.
[2024-05-23 15:40:15] [INFO ] Deduced a trap composed of 83 places in 193 ms of which 3 ms to minimize.
[2024-05-23 15:40:15] [INFO ] Deduced a trap composed of 78 places in 195 ms of which 3 ms to minimize.
[2024-05-23 15:40:16] [INFO ] Deduced a trap composed of 76 places in 195 ms of which 3 ms to minimize.
[2024-05-23 15:40:16] [INFO ] Deduced a trap composed of 75 places in 200 ms of which 3 ms to minimize.
[2024-05-23 15:40:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1372 ms
[2024-05-23 15:40:16] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 69 ms.
[2024-05-23 15:40:16] [INFO ] Added : 2 causal constraints over 1 iterations in 174 ms. Result :sat
Minimization took 335 ms.
[2024-05-23 15:40:16] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:40:17] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-23 15:40:17] [INFO ] [Real]Added 95 Read/Feed constraints in 59 ms returned sat
[2024-05-23 15:40:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:40:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:40:17] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 15:40:17] [INFO ] [Nat]Added 95 Read/Feed constraints in 40 ms returned sat
[2024-05-23 15:40:17] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 79 ms.
[2024-05-23 15:40:17] [INFO ] Added : 2 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 270 ms.
[2024-05-23 15:40:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:40:18] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 15:40:18] [INFO ] [Real]Added 95 Read/Feed constraints in 50 ms returned sat
[2024-05-23 15:40:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:40:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:40:18] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 15:40:18] [INFO ] [Nat]Added 95 Read/Feed constraints in 42 ms returned sat
[2024-05-23 15:40:18] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 69 ms.
[2024-05-23 15:40:18] [INFO ] Added : 2 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 272 ms.
[2024-05-23 15:40:19] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:40:19] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 15:40:19] [INFO ] [Real]Added 95 Read/Feed constraints in 34 ms returned sat
[2024-05-23 15:40:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:40:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:40:19] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 15:40:19] [INFO ] [Nat]Added 95 Read/Feed constraints in 43 ms returned sat
[2024-05-23 15:40:19] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 69 ms.
[2024-05-23 15:40:19] [INFO ] Added : 2 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 366 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 7100, 1, 527, 490, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2, 7100, 1, 527, 490, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
Support contains 8 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 51 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 54 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-23 15:40:23] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:40:23] [INFO ] Invariant cache hit.
[2024-05-23 15:40:24] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-23 15:40:24] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:40:24] [INFO ] Invariant cache hit.
[2024-05-23 15:40:24] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:40:25] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
[2024-05-23 15:40:25] [INFO ] Redundant transitions in 79 ms returned []
Running 1315 sub problems to find dead transitions.
[2024-05-23 15:40:25] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:40:25] [INFO ] Invariant cache hit.
[2024-05-23 15:40:25] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
[2024-05-23 15:40:41] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1232 variables, and 4 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/469 constraints, ReadFeed: 0/95 constraints, PredecessorRefiner: 1315/1315 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 3 (OVERLAPS) 763/1231 variables, 468/472 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1231 variables, 95/567 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1231 variables, 256/823 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1231/1232 variables, and 823 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 468/469 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 256/1315 constraints, Known Traps: 1/1 constraints]
After SMT, in 64542ms problems are : Problem set: 0 solved, 1315 unsolved
Search for dead transitions found 0 dead transitions in 64588ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66603 ms. Remains : 469/469 places, 1317/1317 transitions.
[2024-05-23 15:41:30] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
Found an invariant !
This invariant on transitions {224=1, 350=1, 684=1, 755=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {248=1, 374=1, 708=1, 759=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :[0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 2, 2, 7100, 1, 527, 490, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2024-05-23 15:41:30] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:41:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2, 7100, 1, 527, 490, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
RANDOM walk for 1000000 steps (2 resets) in 2343 ms. (426 steps per ms)
BEST_FIRST walk for 8000007 steps (16 resets) in 4958 ms. (1613 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 6, 7100, 2, 527, 490, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2024-05-23 15:41:38] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:41:38] [INFO ] Invariant cache hit.
[2024-05-23 15:41:38] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:41:38] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-23 15:41:38] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:41:38] [INFO ] [Real]Added 95 Read/Feed constraints in 39 ms returned sat
[2024-05-23 15:41:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:41:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:41:38] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-23 15:41:38] [INFO ] [Nat]Added 95 Read/Feed constraints in 31 ms returned sat
[2024-05-23 15:41:38] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 80 ms.
[2024-05-23 15:41:38] [INFO ] Added : 2 causal constraints over 1 iterations in 177 ms. Result :sat
Minimization took 276 ms.
[2024-05-23 15:41:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:41:39] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 15:41:39] [INFO ] [Real]Added 95 Read/Feed constraints in 41 ms returned sat
[2024-05-23 15:41:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:41:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:41:39] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 15:41:39] [INFO ] [Nat]Added 95 Read/Feed constraints in 35 ms returned sat
[2024-05-23 15:41:39] [INFO ] Deduced a trap composed of 75 places in 216 ms of which 4 ms to minimize.
[2024-05-23 15:41:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2024-05-23 15:41:40] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 78 ms.
[2024-05-23 15:41:40] [INFO ] Added : 2 causal constraints over 1 iterations in 184 ms. Result :sat
Minimization took 274 ms.
[2024-05-23 15:41:40] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:41:40] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 15:41:40] [INFO ] [Real]Added 95 Read/Feed constraints in 35 ms returned sat
[2024-05-23 15:41:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:41:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:41:41] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-23 15:41:41] [INFO ] [Nat]Added 95 Read/Feed constraints in 35 ms returned sat
[2024-05-23 15:41:41] [INFO ] Deduced a trap composed of 100 places in 216 ms of which 3 ms to minimize.
[2024-05-23 15:41:41] [INFO ] Deduced a trap composed of 95 places in 208 ms of which 3 ms to minimize.
[2024-05-23 15:41:41] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 4 ms to minimize.
[2024-05-23 15:41:42] [INFO ] Deduced a trap composed of 81 places in 214 ms of which 3 ms to minimize.
[2024-05-23 15:41:42] [INFO ] Deduced a trap composed of 78 places in 212 ms of which 4 ms to minimize.
[2024-05-23 15:41:42] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 4 ms to minimize.
[2024-05-23 15:41:42] [INFO ] Deduced a trap composed of 75 places in 211 ms of which 3 ms to minimize.
[2024-05-23 15:41:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1683 ms
[2024-05-23 15:41:42] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 81 ms.
[2024-05-23 15:41:42] [INFO ] Added : 2 causal constraints over 1 iterations in 179 ms. Result :sat
Minimization took 285 ms.
[2024-05-23 15:41:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:41:43] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-23 15:41:43] [INFO ] [Real]Added 95 Read/Feed constraints in 44 ms returned sat
[2024-05-23 15:41:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:41:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:41:43] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-23 15:41:43] [INFO ] [Nat]Added 95 Read/Feed constraints in 45 ms returned sat
[2024-05-23 15:41:43] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 81 ms.
[2024-05-23 15:41:44] [INFO ] Added : 4 causal constraints over 1 iterations in 185 ms. Result :sat
Minimization took 278 ms.
[2024-05-23 15:41:44] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:41:44] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-23 15:41:44] [INFO ] [Real]Added 95 Read/Feed constraints in 25 ms returned sat
[2024-05-23 15:41:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:41:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:41:44] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-23 15:41:44] [INFO ] [Nat]Added 95 Read/Feed constraints in 45 ms returned sat
[2024-05-23 15:41:45] [INFO ] Deduced a trap composed of 100 places in 221 ms of which 3 ms to minimize.
[2024-05-23 15:41:45] [INFO ] Deduced a trap composed of 93 places in 211 ms of which 3 ms to minimize.
[2024-05-23 15:41:45] [INFO ] Deduced a trap composed of 83 places in 209 ms of which 3 ms to minimize.
[2024-05-23 15:41:45] [INFO ] Deduced a trap composed of 78 places in 208 ms of which 3 ms to minimize.
[2024-05-23 15:41:46] [INFO ] Deduced a trap composed of 76 places in 213 ms of which 3 ms to minimize.
[2024-05-23 15:41:46] [INFO ] Deduced a trap composed of 75 places in 211 ms of which 3 ms to minimize.
[2024-05-23 15:41:46] [INFO ] Deduced a trap composed of 82 places in 220 ms of which 3 ms to minimize.
[2024-05-23 15:41:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1698 ms
[2024-05-23 15:41:46] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 70 ms.
[2024-05-23 15:41:46] [INFO ] Added : 2 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 326 ms.
[2024-05-23 15:41:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:41:47] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-23 15:41:47] [INFO ] [Real]Added 95 Read/Feed constraints in 51 ms returned sat
[2024-05-23 15:41:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:41:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:41:47] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 15:41:47] [INFO ] [Nat]Added 95 Read/Feed constraints in 40 ms returned sat
[2024-05-23 15:41:47] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 71 ms.
[2024-05-23 15:41:47] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 280 ms.
[2024-05-23 15:41:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:41:48] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 15:41:48] [INFO ] [Real]Added 95 Read/Feed constraints in 48 ms returned sat
[2024-05-23 15:41:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:41:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:41:48] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-23 15:41:48] [INFO ] [Nat]Added 95 Read/Feed constraints in 45 ms returned sat
[2024-05-23 15:41:48] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 71 ms.
[2024-05-23 15:41:49] [INFO ] Added : 2 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 341 ms.
[2024-05-23 15:41:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:41:49] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 15:41:49] [INFO ] [Real]Added 95 Read/Feed constraints in 29 ms returned sat
[2024-05-23 15:41:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:41:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:41:49] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 15:41:49] [INFO ] [Nat]Added 95 Read/Feed constraints in 45 ms returned sat
[2024-05-23 15:41:50] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 70 ms.
[2024-05-23 15:41:50] [INFO ] Added : 2 causal constraints over 1 iterations in 158 ms. Result :sat
Minimization took 352 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 6, 7100, 2, 527, 490, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
FORMULA FunctionPointer-PT-c004-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 6, 7100, 2, 527, 490] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 60 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 469/469 places, 1317/1317 transitions.
[2024-05-23 15:41:54] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
Found an invariant !
This invariant on transitions {224=1, 350=1, 684=1, 755=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {248=1, 374=1, 708=1, 759=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :[2, 0, 2, 0, 1, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 6, 7100, 2, 527, 490] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 15:41:54] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:41:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 6, 7100, 2, 527, 490] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2343 ms. (426 steps per ms)
BEST_FIRST walk for 7000005 steps (14 resets) in 4458 ms. (1569 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 3, 539, 7100, 2, 527, 490] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 15:42:01] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:42:01] [INFO ] Invariant cache hit.
[2024-05-23 15:42:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:42:01] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 15:42:01] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:42:01] [INFO ] [Real]Added 95 Read/Feed constraints in 42 ms returned sat
[2024-05-23 15:42:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:42:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:42:01] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 15:42:01] [INFO ] [Nat]Added 95 Read/Feed constraints in 35 ms returned sat
[2024-05-23 15:42:02] [INFO ] Deduced a trap composed of 75 places in 222 ms of which 3 ms to minimize.
[2024-05-23 15:42:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2024-05-23 15:42:02] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 78 ms.
[2024-05-23 15:42:02] [INFO ] Added : 2 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 275 ms.
[2024-05-23 15:42:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:42:02] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-23 15:42:03] [INFO ] [Real]Added 95 Read/Feed constraints in 42 ms returned sat
[2024-05-23 15:42:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:42:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:42:03] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-23 15:42:03] [INFO ] [Nat]Added 95 Read/Feed constraints in 34 ms returned sat
[2024-05-23 15:42:03] [INFO ] Deduced a trap composed of 75 places in 215 ms of which 4 ms to minimize.
[2024-05-23 15:42:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2024-05-23 15:42:03] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 81 ms.
[2024-05-23 15:42:03] [INFO ] Added : 2 causal constraints over 1 iterations in 183 ms. Result :sat
Minimization took 338 ms.
[2024-05-23 15:42:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:42:04] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-23 15:42:04] [INFO ] [Real]Added 95 Read/Feed constraints in 50 ms returned sat
[2024-05-23 15:42:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:42:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:42:04] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 15:42:04] [INFO ] [Nat]Added 95 Read/Feed constraints in 39 ms returned sat
[2024-05-23 15:42:04] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 83 ms.
[2024-05-23 15:42:04] [INFO ] Added : 2 causal constraints over 1 iterations in 179 ms. Result :sat
Minimization took 277 ms.
[2024-05-23 15:42:05] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:42:05] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 15:42:05] [INFO ] [Real]Added 95 Read/Feed constraints in 42 ms returned sat
[2024-05-23 15:42:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:42:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:42:05] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-23 15:42:05] [INFO ] [Nat]Added 95 Read/Feed constraints in 39 ms returned sat
[2024-05-23 15:42:05] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 81 ms.
[2024-05-23 15:42:06] [INFO ] Added : 4 causal constraints over 1 iterations in 180 ms. Result :sat
Minimization took 275 ms.
[2024-05-23 15:42:06] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:42:06] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 15:42:06] [INFO ] [Real]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-23 15:42:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:42:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:42:06] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 15:42:06] [INFO ] [Nat]Added 95 Read/Feed constraints in 45 ms returned sat
[2024-05-23 15:42:07] [INFO ] Deduced a trap composed of 100 places in 214 ms of which 3 ms to minimize.
[2024-05-23 15:42:07] [INFO ] Deduced a trap composed of 93 places in 214 ms of which 3 ms to minimize.
[2024-05-23 15:42:07] [INFO ] Deduced a trap composed of 83 places in 211 ms of which 3 ms to minimize.
[2024-05-23 15:42:07] [INFO ] Deduced a trap composed of 78 places in 213 ms of which 3 ms to minimize.
[2024-05-23 15:42:08] [INFO ] Deduced a trap composed of 76 places in 209 ms of which 4 ms to minimize.
[2024-05-23 15:42:08] [INFO ] Deduced a trap composed of 75 places in 213 ms of which 3 ms to minimize.
[2024-05-23 15:42:08] [INFO ] Deduced a trap composed of 82 places in 216 ms of which 3 ms to minimize.
[2024-05-23 15:42:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1705 ms
[2024-05-23 15:42:08] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 82 ms.
[2024-05-23 15:42:08] [INFO ] Added : 2 causal constraints over 1 iterations in 185 ms. Result :sat
Minimization took 306 ms.
[2024-05-23 15:42:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:42:09] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 15:42:09] [INFO ] [Real]Added 95 Read/Feed constraints in 50 ms returned sat
[2024-05-23 15:42:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:42:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:42:09] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 15:42:09] [INFO ] [Nat]Added 95 Read/Feed constraints in 40 ms returned sat
[2024-05-23 15:42:09] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 86 ms.
[2024-05-23 15:42:09] [INFO ] Added : 2 causal constraints over 1 iterations in 184 ms. Result :sat
Minimization took 274 ms.
[2024-05-23 15:42:10] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:42:10] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 15:42:10] [INFO ] [Real]Added 95 Read/Feed constraints in 47 ms returned sat
[2024-05-23 15:42:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:42:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:42:10] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 15:42:10] [INFO ] [Nat]Added 95 Read/Feed constraints in 43 ms returned sat
[2024-05-23 15:42:10] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 83 ms.
[2024-05-23 15:42:11] [INFO ] Added : 2 causal constraints over 1 iterations in 188 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 3, 539, 7100, 2, 527, 490] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 3, 539, 7100, 2, 527, 490] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 56 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 53 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-23 15:42:16] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:42:16] [INFO ] Invariant cache hit.
[2024-05-23 15:42:17] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-23 15:42:17] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:42:17] [INFO ] Invariant cache hit.
[2024-05-23 15:42:17] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:42:18] [INFO ] Implicit Places using invariants and state equation in 1430 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
[2024-05-23 15:42:18] [INFO ] Redundant transitions in 25 ms returned []
Running 1315 sub problems to find dead transitions.
[2024-05-23 15:42:18] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:42:18] [INFO ] Invariant cache hit.
[2024-05-23 15:42:18] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
[2024-05-23 15:42:34] [INFO ] Deduced a trap composed of 131 places in 163 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1232 variables, and 4 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/469 constraints, ReadFeed: 0/95 constraints, PredecessorRefiner: 1315/1315 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 3 (OVERLAPS) 763/1231 variables, 468/472 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1231 variables, 95/567 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1231 variables, 256/823 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1231/1232 variables, and 823 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 468/469 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 256/1315 constraints, Known Traps: 1/1 constraints]
After SMT, in 64478ms problems are : Problem set: 0 solved, 1315 unsolved
Search for dead transitions found 0 dead transitions in 64489ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66404 ms. Remains : 469/469 places, 1317/1317 transitions.
[2024-05-23 15:43:23] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
Found an invariant !
This invariant on transitions {224=1, 350=1, 684=1, 755=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {248=1, 374=1, 708=1, 759=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :[0, 0, 0, 25, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 3, 539, 7100, 2, 527, 490] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 15:43:23] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:43:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 3, 539, 7100, 2, 527, 490] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2200 ms. (454 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 4054 ms. (1726 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 3, 539, 7100, 2, 527, 508] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 15:43:29] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:43:29] [INFO ] Invariant cache hit.
[2024-05-23 15:43:29] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:43:29] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 15:43:29] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:43:29] [INFO ] [Real]Added 95 Read/Feed constraints in 45 ms returned sat
[2024-05-23 15:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:43:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:43:30] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 15:43:30] [INFO ] [Nat]Added 95 Read/Feed constraints in 35 ms returned sat
[2024-05-23 15:43:30] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 69 ms.
[2024-05-23 15:43:30] [INFO ] Added : 2 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 280 ms.
[2024-05-23 15:43:30] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:43:30] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 15:43:30] [INFO ] [Real]Added 95 Read/Feed constraints in 39 ms returned sat
[2024-05-23 15:43:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:43:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:43:31] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 15:43:31] [INFO ] [Nat]Added 95 Read/Feed constraints in 33 ms returned sat
[2024-05-23 15:43:31] [INFO ] Deduced a trap composed of 75 places in 197 ms of which 3 ms to minimize.
[2024-05-23 15:43:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2024-05-23 15:43:31] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-23 15:43:31] [INFO ] Added : 2 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 264 ms.
[2024-05-23 15:43:32] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:43:32] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 15:43:32] [INFO ] [Real]Added 95 Read/Feed constraints in 48 ms returned sat
[2024-05-23 15:43:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:43:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:43:32] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-23 15:43:32] [INFO ] [Nat]Added 95 Read/Feed constraints in 36 ms returned sat
[2024-05-23 15:43:32] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 72 ms.
[2024-05-23 15:43:32] [INFO ] Added : 2 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 277 ms.
[2024-05-23 15:43:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:43:33] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 15:43:33] [INFO ] [Real]Added 95 Read/Feed constraints in 43 ms returned sat
[2024-05-23 15:43:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:43:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:43:33] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 15:43:33] [INFO ] [Nat]Added 95 Read/Feed constraints in 40 ms returned sat
[2024-05-23 15:43:33] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 73 ms.
[2024-05-23 15:43:33] [INFO ] Added : 4 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 275 ms.
[2024-05-23 15:43:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:43:34] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 15:43:34] [INFO ] [Real]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-23 15:43:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:43:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:43:34] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 15:43:34] [INFO ] [Nat]Added 95 Read/Feed constraints in 48 ms returned sat
[2024-05-23 15:43:34] [INFO ] Deduced a trap composed of 100 places in 215 ms of which 3 ms to minimize.
[2024-05-23 15:43:35] [INFO ] Deduced a trap composed of 93 places in 202 ms of which 3 ms to minimize.
[2024-05-23 15:43:35] [INFO ] Deduced a trap composed of 83 places in 193 ms of which 2 ms to minimize.
[2024-05-23 15:43:35] [INFO ] Deduced a trap composed of 78 places in 195 ms of which 3 ms to minimize.
[2024-05-23 15:43:35] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 3 ms to minimize.
[2024-05-23 15:43:35] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 3 ms to minimize.
[2024-05-23 15:43:36] [INFO ] Deduced a trap composed of 82 places in 194 ms of which 4 ms to minimize.
[2024-05-23 15:43:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1570 ms
[2024-05-23 15:43:36] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 70 ms.
[2024-05-23 15:43:36] [INFO ] Added : 2 causal constraints over 1 iterations in 158 ms. Result :sat
Minimization took 301 ms.
[2024-05-23 15:43:36] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:43:36] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 15:43:36] [INFO ] [Real]Added 95 Read/Feed constraints in 48 ms returned sat
[2024-05-23 15:43:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:43:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:43:37] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 15:43:37] [INFO ] [Nat]Added 95 Read/Feed constraints in 39 ms returned sat
[2024-05-23 15:43:37] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-23 15:43:37] [INFO ] Added : 2 causal constraints over 1 iterations in 155 ms. Result :sat
Minimization took 270 ms.
[2024-05-23 15:43:37] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:43:37] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 15:43:37] [INFO ] [Real]Added 95 Read/Feed constraints in 46 ms returned sat
[2024-05-23 15:43:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:43:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:43:38] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-23 15:43:38] [INFO ] [Nat]Added 95 Read/Feed constraints in 41 ms returned sat
[2024-05-23 15:43:38] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 70 ms.
[2024-05-23 15:43:38] [INFO ] Added : 2 causal constraints over 1 iterations in 158 ms. Result :sat
Minimization took 278 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 3, 539, 7100, 2, 527, 508] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 3, 539, 7100, 2, 527, 508] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 50 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 49 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-23 15:43:43] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:43:43] [INFO ] Invariant cache hit.
[2024-05-23 15:43:44] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-23 15:43:44] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:43:44] [INFO ] Invariant cache hit.
[2024-05-23 15:43:44] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:43:45] [INFO ] Implicit Places using invariants and state equation in 1385 ms returned []
Implicit Place search using SMT with State Equation took 1708 ms to find 0 implicit places.
[2024-05-23 15:43:45] [INFO ] Redundant transitions in 21 ms returned []
Running 1315 sub problems to find dead transitions.
[2024-05-23 15:43:45] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:43:45] [INFO ] Invariant cache hit.
[2024-05-23 15:43:45] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
[2024-05-23 15:44:01] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1232 variables, and 4 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/469 constraints, ReadFeed: 0/95 constraints, PredecessorRefiner: 1315/1315 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 3 (OVERLAPS) 763/1231 variables, 468/472 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1231 variables, 95/567 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1231 variables, 256/823 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1231/1232 variables, and 823 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 468/469 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 256/1315 constraints, Known Traps: 1/1 constraints]
After SMT, in 64535ms problems are : Problem set: 0 solved, 1315 unsolved
Search for dead transitions found 0 dead transitions in 64546ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66330 ms. Remains : 469/469 places, 1317/1317 transitions.
[2024-05-23 15:44:50] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
Found an invariant !
This invariant on transitions {224=1, 350=1, 684=1, 755=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {248=1, 374=1, 708=1, 759=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :[0, 2, 0, 32, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[6, 3, 539, 7100, 2, 527, 508] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 15:44:50] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:44:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 3, 539, 7100, 2, 527, 508] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2192 ms. (455 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 4059 ms. (1724 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 3, 539, 7100, 2, 527, 508] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 15:44:56] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:44:56] [INFO ] Invariant cache hit.
[2024-05-23 15:44:56] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:44:57] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 15:44:57] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:44:57] [INFO ] [Real]Added 95 Read/Feed constraints in 43 ms returned sat
[2024-05-23 15:44:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:44:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:44:57] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-23 15:44:57] [INFO ] [Nat]Added 95 Read/Feed constraints in 34 ms returned sat
[2024-05-23 15:44:57] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 74 ms.
[2024-05-23 15:44:57] [INFO ] Added : 2 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 267 ms.
[2024-05-23 15:44:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:44:58] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-23 15:44:58] [INFO ] [Real]Added 95 Read/Feed constraints in 40 ms returned sat
[2024-05-23 15:44:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:44:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:44:58] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-23 15:44:58] [INFO ] [Nat]Added 95 Read/Feed constraints in 32 ms returned sat
[2024-05-23 15:44:58] [INFO ] Deduced a trap composed of 75 places in 197 ms of which 3 ms to minimize.
[2024-05-23 15:44:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2024-05-23 15:44:58] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-23 15:44:58] [INFO ] Added : 2 causal constraints over 1 iterations in 153 ms. Result :sat
Minimization took 266 ms.
[2024-05-23 15:44:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:44:59] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-23 15:44:59] [INFO ] [Real]Added 95 Read/Feed constraints in 48 ms returned sat
[2024-05-23 15:44:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:44:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:44:59] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 15:44:59] [INFO ] [Nat]Added 95 Read/Feed constraints in 35 ms returned sat
[2024-05-23 15:44:59] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-23 15:44:59] [INFO ] Added : 2 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 267 ms.
[2024-05-23 15:45:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:45:00] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 15:45:00] [INFO ] [Real]Added 95 Read/Feed constraints in 43 ms returned sat
[2024-05-23 15:45:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:45:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:45:00] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 15:45:00] [INFO ] [Nat]Added 95 Read/Feed constraints in 45 ms returned sat
[2024-05-23 15:45:00] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 71 ms.
[2024-05-23 15:45:00] [INFO ] Added : 4 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 264 ms.
[2024-05-23 15:45:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:45:01] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-23 15:45:01] [INFO ] [Real]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-23 15:45:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:45:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:45:01] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 15:45:01] [INFO ] [Nat]Added 95 Read/Feed constraints in 44 ms returned sat
[2024-05-23 15:45:01] [INFO ] Deduced a trap composed of 100 places in 194 ms of which 3 ms to minimize.
[2024-05-23 15:45:02] [INFO ] Deduced a trap composed of 93 places in 190 ms of which 3 ms to minimize.
[2024-05-23 15:45:02] [INFO ] Deduced a trap composed of 83 places in 196 ms of which 3 ms to minimize.
[2024-05-23 15:45:02] [INFO ] Deduced a trap composed of 78 places in 193 ms of which 6 ms to minimize.
[2024-05-23 15:45:02] [INFO ] Deduced a trap composed of 76 places in 189 ms of which 2 ms to minimize.
[2024-05-23 15:45:02] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 3 ms to minimize.
[2024-05-23 15:45:03] [INFO ] Deduced a trap composed of 82 places in 192 ms of which 3 ms to minimize.
[2024-05-23 15:45:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1529 ms
[2024-05-23 15:45:03] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-23 15:45:03] [INFO ] Added : 2 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 304 ms.
[2024-05-23 15:45:03] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:45:03] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 15:45:03] [INFO ] [Real]Added 95 Read/Feed constraints in 47 ms returned sat
[2024-05-23 15:45:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:45:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:45:04] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-23 15:45:04] [INFO ] [Nat]Added 95 Read/Feed constraints in 39 ms returned sat
[2024-05-23 15:45:04] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 67 ms.
[2024-05-23 15:45:04] [INFO ] Added : 2 causal constraints over 1 iterations in 158 ms. Result :sat
Minimization took 270 ms.
[2024-05-23 15:45:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:45:04] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-23 15:45:04] [INFO ] [Real]Added 95 Read/Feed constraints in 46 ms returned sat
[2024-05-23 15:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:45:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:45:05] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 15:45:05] [INFO ] [Nat]Added 95 Read/Feed constraints in 41 ms returned sat
[2024-05-23 15:45:05] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-23 15:45:05] [INFO ] Added : 2 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 269 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 3, 539, 7100, 2, 527, 508] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 3, 539, 7100, 3, 527, 508] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 48 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 51 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-23 15:45:11] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:45:11] [INFO ] Invariant cache hit.
[2024-05-23 15:45:11] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-23 15:45:11] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:45:11] [INFO ] Invariant cache hit.
[2024-05-23 15:45:11] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:45:12] [INFO ] Implicit Places using invariants and state equation in 1382 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
[2024-05-23 15:45:12] [INFO ] Redundant transitions in 22 ms returned []
Running 1315 sub problems to find dead transitions.
[2024-05-23 15:45:12] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:45:12] [INFO ] Invariant cache hit.
[2024-05-23 15:45:12] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
[2024-05-23 15:45:28] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1232 variables, and 4 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/469 constraints, ReadFeed: 0/95 constraints, PredecessorRefiner: 1315/1315 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 3 (OVERLAPS) 763/1231 variables, 468/472 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1231 variables, 95/567 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1231 variables, 256/823 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1231/1232 variables, and 823 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 468/469 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 256/1315 constraints, Known Traps: 1/1 constraints]
After SMT, in 64316ms problems are : Problem set: 0 solved, 1315 unsolved
Search for dead transitions found 0 dead transitions in 64330ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66135 ms. Remains : 469/469 places, 1317/1317 transitions.
[2024-05-23 15:46:17] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
Found an invariant !
This invariant on transitions {224=1, 350=1, 684=1, 755=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {248=1, 374=1, 708=1, 759=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :[0, 0, 4, 20, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[6, 3, 539, 7100, 3, 527, 508] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 15:46:17] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:46:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 3, 539, 7100, 3, 527, 508] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2353 ms. (424 steps per ms)
BEST_FIRST walk for 7000006 steps (14 resets) in 4397 ms. (1591 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 3, 539, 7100, 3, 527, 508] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 15:46:24] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:46:24] [INFO ] Invariant cache hit.
[2024-05-23 15:46:24] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:46:24] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 15:46:24] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:46:24] [INFO ] [Real]Added 95 Read/Feed constraints in 43 ms returned sat
[2024-05-23 15:46:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:46:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:46:24] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 15:46:24] [INFO ] [Nat]Added 95 Read/Feed constraints in 35 ms returned sat
[2024-05-23 15:46:25] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 100 ms.
[2024-05-23 15:46:25] [INFO ] Added : 2 causal constraints over 1 iterations in 195 ms. Result :sat
Minimization took 265 ms.
[2024-05-23 15:46:25] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-23 15:46:25] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 15:46:25] [INFO ] [Real]Added 95 Read/Feed constraints in 38 ms returned sat
[2024-05-23 15:46:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:46:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:46:25] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 15:46:25] [INFO ] [Nat]Added 95 Read/Feed constraints in 33 ms returned sat
[2024-05-23 15:46:26] [INFO ] Deduced a trap composed of 75 places in 216 ms of which 6 ms to minimize.
[2024-05-23 15:46:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2024-05-23 15:46:26] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 80 ms.
[2024-05-23 15:46:26] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 265 ms.
[2024-05-23 15:46:26] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:46:26] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 15:46:26] [INFO ] [Real]Added 95 Read/Feed constraints in 47 ms returned sat
[2024-05-23 15:46:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:46:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:46:27] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 15:46:27] [INFO ] [Nat]Added 95 Read/Feed constraints in 36 ms returned sat
[2024-05-23 15:46:27] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 83 ms.
[2024-05-23 15:46:27] [INFO ] Added : 2 causal constraints over 1 iterations in 187 ms. Result :sat
Minimization took 262 ms.
[2024-05-23 15:46:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:46:28] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 15:46:28] [INFO ] [Real]Added 95 Read/Feed constraints in 43 ms returned sat
[2024-05-23 15:46:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:46:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:46:28] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 15:46:28] [INFO ] [Nat]Added 95 Read/Feed constraints in 39 ms returned sat
[2024-05-23 15:46:28] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 82 ms.
[2024-05-23 15:46:28] [INFO ] Added : 4 causal constraints over 1 iterations in 186 ms. Result :sat
Minimization took 266 ms.
[2024-05-23 15:46:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:46:29] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 15:46:29] [INFO ] [Real]Added 95 Read/Feed constraints in 28 ms returned sat
[2024-05-23 15:46:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:46:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:46:29] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 15:46:29] [INFO ] [Nat]Added 95 Read/Feed constraints in 40 ms returned sat
[2024-05-23 15:46:29] [INFO ] Deduced a trap composed of 100 places in 223 ms of which 3 ms to minimize.
[2024-05-23 15:46:29] [INFO ] Deduced a trap composed of 93 places in 216 ms of which 3 ms to minimize.
[2024-05-23 15:46:30] [INFO ] Deduced a trap composed of 83 places in 223 ms of which 3 ms to minimize.
[2024-05-23 15:46:30] [INFO ] Deduced a trap composed of 78 places in 212 ms of which 3 ms to minimize.
[2024-05-23 15:46:30] [INFO ] Deduced a trap composed of 76 places in 197 ms of which 3 ms to minimize.
[2024-05-23 15:46:30] [INFO ] Deduced a trap composed of 82 places in 192 ms of which 3 ms to minimize.
[2024-05-23 15:46:31] [INFO ] Deduced a trap composed of 135 places in 189 ms of which 3 ms to minimize.
[2024-05-23 15:46:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1651 ms
[2024-05-23 15:46:31] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 74 ms.
[2024-05-23 15:46:31] [INFO ] Added : 2 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 386 ms.
[2024-05-23 15:46:31] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:46:31] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-23 15:46:31] [INFO ] [Real]Added 95 Read/Feed constraints in 49 ms returned sat
[2024-05-23 15:46:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:46:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:46:32] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 15:46:32] [INFO ] [Nat]Added 95 Read/Feed constraints in 51 ms returned sat
[2024-05-23 15:46:32] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 72 ms.
[2024-05-23 15:46:32] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 344 ms.
[2024-05-23 15:46:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:46:33] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-23 15:46:33] [INFO ] [Real]Added 95 Read/Feed constraints in 45 ms returned sat
[2024-05-23 15:46:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:46:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:46:33] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 15:46:33] [INFO ] [Nat]Added 95 Read/Feed constraints in 40 ms returned sat
[2024-05-23 15:46:33] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 69 ms.
[2024-05-23 15:46:33] [INFO ] Added : 2 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 266 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 3, 539, 7100, 3, 527, 508] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 3, 539, 7100, 3, 527, 508] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 48 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 65 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-23 15:46:38] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:46:38] [INFO ] Invariant cache hit.
[2024-05-23 15:46:39] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-23 15:46:39] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:46:39] [INFO ] Invariant cache hit.
[2024-05-23 15:46:39] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:46:40] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned []
Implicit Place search using SMT with State Equation took 1749 ms to find 0 implicit places.
[2024-05-23 15:46:40] [INFO ] Redundant transitions in 24 ms returned []
Running 1315 sub problems to find dead transitions.
[2024-05-23 15:46:40] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:46:40] [INFO ] Invariant cache hit.
[2024-05-23 15:46:40] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
[2024-05-23 15:46:57] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1232 variables, and 4 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/469 constraints, ReadFeed: 0/95 constraints, PredecessorRefiner: 1315/1315 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 3 (OVERLAPS) 763/1231 variables, 468/472 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1231 variables, 95/567 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1231 variables, 256/823 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1231/1232 variables, and 823 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 468/469 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 256/1315 constraints, Known Traps: 1/1 constraints]
After SMT, in 65331ms problems are : Problem set: 0 solved, 1315 unsolved
Search for dead transitions found 0 dead transitions in 65342ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67194 ms. Remains : 469/469 places, 1317/1317 transitions.
[2024-05-23 15:47:46] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
Found an invariant !
This invariant on transitions {224=1, 350=1, 684=1, 755=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {248=1, 374=1, 708=1, 759=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :[0, 0, 0, 0, 1, 0, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[6, 3, 539, 7100, 3, 527, 508] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40000 steps (8 resets) in 964 ms. (41 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 6/6 properties
[2024-05-23 15:47:47] [INFO ] Flatten gal took : 290 ms
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
[2024-05-23 15:47:47] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:47:47] [INFO ] Invariant cache hit.
[2024-05-23 15:47:47] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:47:47] [INFO ] Flatten gal took : 150 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 15:47:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2620653670167341123.gal : 58 ms
[2024-05-23 15:47:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality358528094908481891.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/ReachabilityCardinality2620653670167341123.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality358528094908481891.prop' '--nowitness' '--gen-order' 'FOLLOW'
At refinement iteration 3 (OVERLAPS) 403/424 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
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
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 17/441 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Loading property file /tmp/ReachabilityCardinality358528094908481891.prop.
At refinement iteration 9 (OVERLAPS) 646/1087 variables, 364/396 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1087 variables, 91/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1087 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 62/1149 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1149 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 77/1226 variables, 75/563 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 31
At refinement iteration 15 (INCLUDED_ONLY) 0/1226 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 5/1231 variables, 3/566 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1231 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 1/1232 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :31 after 1858
At refinement iteration 19 (INCLUDED_ONLY) 0/1232 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/1232 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 567 constraints, problems are : Problem set: 0 solved, 6 unsolved in 912 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 469/469 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 403/424 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 17/441 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 646/1087 variables, 364/402 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1087 variables, 91/493 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1087 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 62/1149 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1149 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 77/1226 variables, 75/569 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1226 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 5/1231 variables, 3/572 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1231 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/1232 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1232 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/1232 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1232/1232 variables, and 573 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1125 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 469/469 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2052ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1858 after 689226
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :689226 after 5.72114e+07
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :5.72114e+07 after 1.8901e+08
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1.8901e+08 after 2.39096e+08
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :2.39096e+08 after 3.02329e+08
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :3.02329e+08 after 3.27514e+08
Invariant property MIN4 does not hold.
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :3.27514e+08 after 3.43551e+08
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :3.43551e+08 after 3.56225e+08
Parikh walk visited 1 properties in 30002 ms.
Support contains 5 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 466 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 466 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 465 transition count 1310
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 465 transition count 1310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 464 transition count 1306
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 464 transition count 1306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1304
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 462 transition count 1302
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 462 transition count 1302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 461 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 461 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 460 transition count 1298
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 460 transition count 1298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 459 transition count 1296
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 459 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 458 transition count 1294
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 458 transition count 1294
Applied a total of 22 rules in 128 ms. Remains 458 /469 variables (removed 11) and now considering 1294/1317 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 458/469 places, 1294/1317 transitions.
RANDOM walk for 40001 steps (8 resets) in 255 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 198888 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 5
Probabilistic random walk after 198888 steps, saw 121972 distinct states, run finished after 3004 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-23 15:48:22] [INFO ] Flow matrix only has 745 transitions (discarded 549 similar events)
// Phase 1: matrix 745 rows 458 cols
[2024-05-23 15:48:22] [INFO ] Computed 3 invariants in 3 ms
[2024-05-23 15:48:22] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 391/409 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 15/424 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 636/1060 variables, 358/386 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1060 variables, 86/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1060 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 62/1122 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1122 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 75/1197 variables, 73/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1197 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 5/1202 variables, 3/549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1202 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 1/1203 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1203 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/1203 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1203/1203 variables, and 550 constraints, problems are : Problem set: 0 solved, 5 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 458/458 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 391/409 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 15/424 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 636/1060 variables, 358/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1060 variables, 86/477 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1060 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 2048
At refinement iteration 13 (OVERLAPS) 62/1122 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD size :3.56225e+08 after 3.9589e+08
At refinement iteration 14 (INCLUDED_ONLY) 0/1122 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 75/1197 variables, 73/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1197 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 5/1202 variables, 3/554 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1202 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/1203 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1203 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/1203 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1203/1203 variables, and 555 constraints, problems are : Problem set: 0 solved, 5 unsolved in 889 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 458/458 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1596ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1294/1294 transitions.
Applied a total of 0 rules in 48 ms. Remains 458 /458 variables (removed 0) and now considering 1294/1294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 458/458 places, 1294/1294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1294/1294 transitions.
Applied a total of 0 rules in 47 ms. Remains 458 /458 variables (removed 0) and now considering 1294/1294 (removed 0) transitions.
[2024-05-23 15:48:24] [INFO ] Flow matrix only has 745 transitions (discarded 549 similar events)
[2024-05-23 15:48:24] [INFO ] Invariant cache hit.
[2024-05-23 15:48:24] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-23 15:48:24] [INFO ] Flow matrix only has 745 transitions (discarded 549 similar events)
[2024-05-23 15:48:24] [INFO ] Invariant cache hit.
[2024-05-23 15:48:24] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-23 15:48:25] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1635 ms to find 0 implicit places.
[2024-05-23 15:48:25] [INFO ] Redundant transitions in 16 ms returned []
Running 1292 sub problems to find dead transitions.
[2024-05-23 15:48:25] [INFO ] Flow matrix only has 745 transitions (discarded 549 similar events)
[2024-05-23 15:48:25] [INFO ] Invariant cache hit.
[2024-05-23 15:48:25] [INFO ] State equation strengthened by 89 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-23 15:48:37] [INFO ] Flatten gal took : 68 ms
[2024-05-23 15:48:37] [INFO ] Applying decomposition
[2024-05-23 15:48:37] [INFO ] Flatten gal took : 62 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/graph4612144035714303780.txt' '-o' '/tmp/graph4612144035714303780.bin' '-w' '/tmp/graph4612144035714303780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4612144035714303780.bin' '-l' '-1' '-v' '-w' '/tmp/graph4612144035714303780.weights' '-q' '0' '-e' '0.001'
[2024-05-23 15:48:38] [INFO ] Decomposing Gal with order
[2024-05-23 15:48:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 15:48:38] [INFO ] Removed a total of 2260 redundant transitions.
[2024-05-23 15:48:38] [INFO ] Flatten gal took : 144 ms
[2024-05-23 15:48:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 950 labels/synchronizations in 74 ms.
[2024-05-23 15:48:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14978694113966334503.gal : 14 ms
[2024-05-23 15:48:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6159473853221136865.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/ReachabilityCardinality14978694113966334503.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6159473853221136865.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/ReachabilityCardinality6159473853221136865.prop.
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
[2024-05-23 15:48:41] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 457/1203 variables, and 4 constraints, problems are : Problem set: 0 solved, 1292 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/458 constraints, ReadFeed: 0/89 constraints, PredecessorRefiner: 1292/1292 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/457 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 3 (OVERLAPS) 745/1202 variables, 457/461 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 89/550 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
Detected timeout of ITS tools.
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 256/806 constraints. Problems are: Problem set: 0 solved, 1292 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 timeout
0)
(s286 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1203 variables, and 806 constraints, problems are : Problem set: 0 solved, 1292 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 457/458 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 256/1292 constraints, Known Traps: 1/1 constraints]
After SMT, in 64550ms problems are : Problem set: 0 solved, 1292 unsolved
Search for dead transitions found 0 dead transitions in 64563ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66271 ms. Remains : 458/458 places, 1294/1294 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[6, 3, 539, 7100, 3, 527, 508] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-c004-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 15:49:30] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-23 15:49:30] [INFO ] Computed 3 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 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 15:49:30] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:49:30] [INFO ] Invariant cache hit.
[2024-05-23 15:49:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:49:30] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 15:49:30] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:49:30] [INFO ] [Real]Added 95 Read/Feed constraints in 31 ms returned sat
[2024-05-23 15:49:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:49:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:49:31] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 15:49:31] [INFO ] [Nat]Added 95 Read/Feed constraints in 29 ms returned sat
[2024-05-23 15:49:31] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 84 ms.
[2024-05-23 15:49:31] [INFO ] Added : 2 causal constraints over 1 iterations in 188 ms. Result :sat
Minimization took 300 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 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 465 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 465 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 460 transition count 1300
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 460 transition count 1300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 455 transition count 1288
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 455 transition count 1288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 450 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 450 transition count 1278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 445 transition count 1268
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 445 transition count 1268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 440 transition count 1258
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 440 transition count 1258
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 435 transition count 1248
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 435 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 432 transition count 1242
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 432 transition count 1242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 430 transition count 1238
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 430 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 429 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 429 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 428 transition count 1232
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 428 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 427 transition count 1230
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 426 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 425 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 424 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 422 transition count 1220
Applied a total of 92 rules in 188 ms. Remains 422 /469 variables (removed 47) and now considering 1220/1317 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 422/469 places, 1220/1317 transitions.
[2024-05-23 15:49:31] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 15:49:32] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-23 15:49:32] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2211 ms. (452 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 577 ms. (1730 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[189] Max Struct:[+inf]
[2024-05-23 15:49:34] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 15:49:34] [INFO ] Invariant cache hit.
[2024-05-23 15:49:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:49:35] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 15:49:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 15:49:35] [INFO ] [Real]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-23 15:49:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:49:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:49:35] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 15:49:35] [INFO ] [Nat]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-23 15:49:35] [INFO ] Deduced a trap composed of 113 places in 192 ms of which 3 ms to minimize.
[2024-05-23 15:49:35] [INFO ] Deduced a trap composed of 105 places in 185 ms of which 3 ms to minimize.
[2024-05-23 15:49:36] [INFO ] Deduced a trap composed of 85 places in 185 ms of which 3 ms to minimize.
[2024-05-23 15:49:36] [INFO ] Deduced a trap composed of 76 places in 186 ms of which 2 ms to minimize.
[2024-05-23 15:49:36] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 3 ms to minimize.
[2024-05-23 15:49:36] [INFO ] Deduced a trap composed of 71 places in 184 ms of which 2 ms to minimize.
[2024-05-23 15:49:36] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 2 ms to minimize.
[2024-05-23 15:49:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1480 ms
[2024-05-23 15:49:37] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 71 ms.
[2024-05-23 15:49:37] [INFO ] Added : 9 causal constraints over 3 iterations in 250 ms. Result :sat
Minimization took 282 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[189] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[189] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 46 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 45 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 15:49:37] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 15:49:37] [INFO ] Invariant cache hit.
[2024-05-23 15:49:37] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-23 15:49:37] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 15:49:37] [INFO ] Invariant cache hit.
[2024-05-23 15:49:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 15:49:39] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
[2024-05-23 15:49:39] [INFO ] Redundant transitions in 14 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 15:49:39] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 15:49:39] [INFO ] Invariant cache hit.
[2024-05-23 15:49:39] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 15:49:52] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 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) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34597ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34622ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36283 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 15:50:13] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[189] Max Struct:[+inf]
[2024-05-23 15:50:14] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 15:50:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[189] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1950 ms. (512 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 533 ms. (1872 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[189] Max Struct:[+inf]
[2024-05-23 15:50:16] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 15:50:16] [INFO ] Invariant cache hit.
[2024-05-23 15:50:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:50:16] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-23 15:50:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 15:50:16] [INFO ] [Real]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-23 15:50:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:50:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:50:17] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-23 15:50:17] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-23 15:50:17] [INFO ] Deduced a trap composed of 113 places in 186 ms of which 3 ms to minimize.
[2024-05-23 15:50:17] [INFO ] Deduced a trap composed of 105 places in 172 ms of which 3 ms to minimize.
[2024-05-23 15:50:17] [INFO ] Deduced a trap composed of 85 places in 171 ms of which 3 ms to minimize.
[2024-05-23 15:50:17] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 3 ms to minimize.
[2024-05-23 15:50:18] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 2 ms to minimize.
[2024-05-23 15:50:18] [INFO ] Deduced a trap composed of 71 places in 169 ms of which 3 ms to minimize.
[2024-05-23 15:50:18] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 2 ms to minimize.
[2024-05-23 15:50:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1383 ms
[2024-05-23 15:50:18] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 63 ms.
[2024-05-23 15:50:18] [INFO ] Added : 9 causal constraints over 3 iterations in 238 ms. Result :sat
Minimization took 265 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[189] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[189] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 45 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 15:50:19] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 15:50:19] [INFO ] Invariant cache hit.
[2024-05-23 15:50:19] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-23 15:50:19] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 15:50:19] [INFO ] Invariant cache hit.
[2024-05-23 15:50:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 15:50:20] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
[2024-05-23 15:50:20] [INFO ] Redundant transitions in 17 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 15:50:20] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 15:50:20] [INFO ] Invariant cache hit.
[2024-05-23 15:50:20] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 15:50:34] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34245ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34256ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35846 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 15:50:54] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[189] Max Struct:[+inf]
RANDOM walk for 40007 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
[2024-05-23 15:50:55] [INFO ] Flatten gal took : 71 ms
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
[2024-05-23 15:50:55] [INFO ] Flatten gal took : 67 ms
[2024-05-23 15:50:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10532847849310275716.gal : 8 ms
[2024-05-23 15:50:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13700008056772371324.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/ReachabilityCardinality10532847849310275716.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13700008056772371324.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/ReachabilityCardinality13700008056772371324.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 1862
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1862 after 695653
Interrupted probabilistic random walk after 452562 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 1
Probabilistic random walk after 452562 steps, saw 277510 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
[2024-05-23 15:50:58] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 15:50:58] [INFO ] Invariant cache hit.
[2024-05-23 15:50:58] [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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 719ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1002 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 422/422 places, 1220/1220 transitions.
RANDOM walk for 40000 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :695653 after 6.64141e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6.64141e+07 after 2.25041e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.25041e+08 after 2.6536e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.6536e+08 after 3.64167e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.64167e+08 after 4.49971e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.49971e+08 after 5.82012e+08
Interrupted probabilistic random walk after 507678 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 1
Probabilistic random walk after 507678 steps, saw 311303 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
[2024-05-23 15:51:03] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 15:51:03] [INFO ] Invariant cache hit.
[2024-05-23 15:51:03] [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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.82012e+08 after 1.4262e+09
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 624ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.4262e+09 after 1.49621e+09
Parikh walk visited 0 properties in 1045 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 43 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 15:51:04] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 15:51:04] [INFO ] Invariant cache hit.
[2024-05-23 15:51:05] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-23 15:51:05] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 15:51:05] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.49621e+09 after 1.68797e+09
[2024-05-23 15:51:05] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 15:51:06] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
[2024-05-23 15:51:06] [INFO ] Redundant transitions in 17 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 15:51:06] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 15:51:06] [INFO ] Invariant cache hit.
[2024-05-23 15:51:06] [INFO ] State equation strengthened by 75 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.68797e+09 after 2.07814e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.07814e+09 after 2.89484e+09
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.89484e+09 after 4.5251e+09
[2024-05-23 15:51:20] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :4.5251e+09 after 7.79072e+09
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34227ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34238ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35779 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 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 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
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 697 place count 339 transition count 606
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 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
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 1397 place count 21 transition count 34
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 1399 place count 20 transition count 33
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 1401 place count 19 transition count 33
Applied a total of 1401 rules in 150 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-23 15:51:40] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 15:51:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 15:51:40] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 15:51:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 15:51:40] [INFO ] After 64ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 15:51:40] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 15:51:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 15:51:40] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 15:51:40] [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 15:51:40] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 15:51:40] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 15:51:40] [INFO ] Flatten gal took : 1 ms
[2024-05-23 15:51:40] [INFO ] Flatten gal took : 1 ms
[2024-05-23 15:51:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18139857588896534961.gal : 1 ms
[2024-05-23 15:51:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14649446360145846695.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/ReachabilityCardinality18139857588896534961.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14649446360145846695.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/ReachabilityCardinality14649446360145846695.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 45
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :45 after 285
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :285 after 625
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :625 after 1285
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1285 after 2585
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2585 after 5165
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5165 after 10305
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10305 after 20565
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :20565 after 41065
Detected timeout of ITS tools.
[2024-05-23 15:51:45] [INFO ] Flatten gal took : 32 ms
[2024-05-23 15:51:45] [INFO ] Applying decomposition
[2024-05-23 15:51:45] [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/graph7922299645048540788.txt' '-o' '/tmp/graph7922299645048540788.bin' '-w' '/tmp/graph7922299645048540788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7922299645048540788.bin' '-l' '-1' '-v' '-w' '/tmp/graph7922299645048540788.weights' '-q' '0' '-e' '0.001'
[2024-05-23 15:51:45] [INFO ] Decomposing Gal with order
[2024-05-23 15:51:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 15:51:45] [INFO ] Removed a total of 2088 redundant transitions.
[2024-05-23 15:51:45] [INFO ] Flatten gal took : 84 ms
[2024-05-23 15:51:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 875 labels/synchronizations in 49 ms.
[2024-05-23 15:51:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6588561790403932617.gal : 18 ms
[2024-05-23 15:51:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4640665981007607724.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/ReachabilityCardinality6588561790403932617.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4640665981007607724.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/ReachabilityCardinality4640665981007607724.prop.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :41065 after 82045
Detected timeout of ITS tools.
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 1 ms
[2024-05-23 15:51:55] [INFO ] Applying decomposition
[2024-05-23 15:51:55] [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/graph14264015805556136764.txt' '-o' '/tmp/graph14264015805556136764.bin' '-w' '/tmp/graph14264015805556136764.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14264015805556136764.bin' '-l' '-1' '-v' '-w' '/tmp/graph14264015805556136764.weights' '-q' '0' '-e' '0.001'
[2024-05-23 15:51:55] [INFO ] Decomposing Gal with order
[2024-05-23 15:51:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 15:51:55] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 2 ms
[2024-05-23 15:51:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-23 15:51:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12388613259070902467.gal : 1 ms
[2024-05-23 15:51:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11075749312142954193.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/ReachabilityCardinality12388613259070902467.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11075749312142954193.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/ReachabilityCardinality11075749312142954193.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 30
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30508 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:[189] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-01 in 160497 ms.
Starting property specific reduction for FunctionPointer-PT-c004-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 15:52:11] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-23 15:52:11] [INFO ] Computed 3 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 31 ms. (312 steps per ms)
BEST_FIRST walk for 10000 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 15:52:11] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:52:11] [INFO ] Invariant cache hit.
[2024-05-23 15:52:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:52:11] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 15:52:11] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:52:11] [INFO ] [Real]Added 95 Read/Feed constraints in 43 ms returned sat
[2024-05-23 15:52:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:52:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:52:11] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 15:52:11] [INFO ] [Nat]Added 95 Read/Feed constraints in 25 ms returned sat
[2024-05-23 15:52:11] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 70 ms.
[2024-05-23 15:52:11] [INFO ] Added : 2 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 271 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 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 465 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 465 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 460 transition count 1300
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 460 transition count 1300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 455 transition count 1290
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 455 transition count 1290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 450 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 450 transition count 1278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 445 transition count 1268
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 445 transition count 1268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 440 transition count 1258
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 440 transition count 1258
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 435 transition count 1248
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 435 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 432 transition count 1242
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 432 transition count 1242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 430 transition count 1238
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 430 transition count 1238
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 428 transition count 1234
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 428 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 427 transition count 1230
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 426 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 425 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 424 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 421 transition count 1218
Applied a total of 94 rules in 262 ms. Remains 421 /469 variables (removed 48) and now considering 1218/1317 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 421/469 places, 1218/1317 transitions.
[2024-05-23 15:52:12] [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 1 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 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 15:52:12] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-23 15:52:12] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2041 ms. (489 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 588 ms. (1697 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[439] Max Struct:[+inf]
[2024-05-23 15:52:15] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 15:52:15] [INFO ] Invariant cache hit.
[2024-05-23 15:52:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:52:15] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 15:52:15] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 15:52:15] [INFO ] [Real]Added 75 Read/Feed constraints in 36 ms returned sat
[2024-05-23 15:52:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:52:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:52:15] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-23 15:52:15] [INFO ] [Nat]Added 75 Read/Feed constraints in 28 ms returned sat
[2024-05-23 15:52:16] [INFO ] Deduced a trap composed of 113 places in 198 ms of which 3 ms to minimize.
[2024-05-23 15:52:16] [INFO ] Deduced a trap composed of 109 places in 189 ms of which 3 ms to minimize.
[2024-05-23 15:52:16] [INFO ] Deduced a trap composed of 87 places in 189 ms of which 2 ms to minimize.
[2024-05-23 15:52:16] [INFO ] Deduced a trap composed of 74 places in 169 ms of which 3 ms to minimize.
[2024-05-23 15:52:16] [INFO ] Deduced a trap composed of 71 places in 170 ms of which 2 ms to minimize.
[2024-05-23 15:52:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1050 ms
[2024-05-23 15:52:16] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 84 ms.
[2024-05-23 15:52:17] [INFO ] Added : 10 causal constraints over 3 iterations in 252 ms. Result :sat
Minimization took 308 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[439] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[439] 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 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 43 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 49 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 15:52:17] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 15:52:17] [INFO ] Invariant cache hit.
[2024-05-23 15:52:17] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-23 15:52:17] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 15:52:17] [INFO ] Invariant cache hit.
[2024-05-23 15:52:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 15:52:19] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
[2024-05-23 15:52:19] [INFO ] Redundant transitions in 21 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 15:52:19] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 15:52:19] [INFO ] Invariant cache hit.
[2024-05-23 15:52:19] [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 15:52:33] [INFO ] Deduced a trap composed of 131 places in 155 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: (timeout
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 34333ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34344ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35904 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-23 15:52:53] [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 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[439] Max Struct:[+inf]
[2024-05-23 15:52:53] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 15:52:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[439] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2087 ms. (478 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 545 ms. (1831 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[439] Max Struct:[+inf]
[2024-05-23 15:52:56] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 15:52:56] [INFO ] Invariant cache hit.
[2024-05-23 15:52:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:52:56] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-23 15:52:56] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 15:52:56] [INFO ] [Real]Added 75 Read/Feed constraints in 37 ms returned sat
[2024-05-23 15:52:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:52:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:52:56] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-23 15:52:56] [INFO ] [Nat]Added 75 Read/Feed constraints in 28 ms returned sat
[2024-05-23 15:52:56] [INFO ] Deduced a trap composed of 113 places in 179 ms of which 3 ms to minimize.
[2024-05-23 15:52:57] [INFO ] Deduced a trap composed of 109 places in 172 ms of which 2 ms to minimize.
[2024-05-23 15:52:57] [INFO ] Deduced a trap composed of 87 places in 175 ms of which 3 ms to minimize.
[2024-05-23 15:52:57] [INFO ] Deduced a trap composed of 74 places in 179 ms of which 3 ms to minimize.
[2024-05-23 15:52:57] [INFO ] Deduced a trap composed of 71 places in 173 ms of which 2 ms to minimize.
[2024-05-23 15:52:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1001 ms
[2024-05-23 15:52:57] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 63 ms.
[2024-05-23 15:52:58] [INFO ] Added : 10 causal constraints over 3 iterations in 218 ms. Result :sat
Minimization took 258 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[439] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[439] 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 46 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 47 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 42 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 15:52:58] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 15:52:58] [INFO ] Invariant cache hit.
[2024-05-23 15:52:58] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-23 15:52:58] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 15:52:58] [INFO ] Invariant cache hit.
[2024-05-23 15:52:58] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 15:52:59] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2024-05-23 15:52:59] [INFO ] Redundant transitions in 21 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 15:52:59] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 15:52:59] [INFO ] Invariant cache hit.
[2024-05-23 15:52:59] [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 15:53:13] [INFO ] Deduced a trap composed of 131 places in 140 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 34002ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34013ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35599 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-23 15:53:33] [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 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[439] Max Struct:[+inf]
[2024-05-23 15:53:34] [INFO ] Flatten gal took : 31 ms
[2024-05-23 15:53:34] [INFO ] Flatten gal took : 29 ms
RANDOM walk for 40002 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
[2024-05-23 15:53:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3119518194319181551.gal : 20 ms
[2024-05-23 15:53:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13147344387005912066.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/ReachabilityCardinality3119518194319181551.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13147344387005912066.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13147344387005912066.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 1862
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1862 after 695653
Interrupted probabilistic random walk after 486779 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 1
Probabilistic random walk after 486779 steps, saw 298490 distinct states, run finished after 3003 ms. (steps per millisecond=162 ) properties seen :0
[2024-05-23 15:53:37] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 15:53:37] [INFO ] Invariant cache hit.
[2024-05-23 15:53:37] [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 307 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 303 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 633ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :695653 after 6.64141e+07
Parikh walk visited 0 properties in 2219 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 40001 steps (8 resets) in 133 ms. (298 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 64
SDD size :6.64141e+07 after 2.25041e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.25041e+08 after 2.6536e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.6536e+08 after 3.64167e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.64167e+08 after 4.55772e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.55772e+08 after 5.88609e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.88609e+08 after 1.37835e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.37835e+09 after 1.44865e+09
Interrupted probabilistic random walk after 503894 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 503894 steps, saw 308984 distinct states, run finished after 3002 ms. (steps per millisecond=167 ) properties seen :0
[2024-05-23 15:53:43] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 15:53:43] [INFO ] Invariant cache hit.
[2024-05-23 15:53:43] [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
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.44865e+09 after 1.63454e+09
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 266 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 277 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 553ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.63454e+09 after 2.05101e+09
Parikh walk visited 0 properties in 2290 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 41 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 41 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 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 15:53:46] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 15:53:46] [INFO ] Invariant cache hit.
[2024-05-23 15:53:46] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-23 15:53:46] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 15:53:46] [INFO ] Invariant cache hit.
[2024-05-23 15:53:46] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 15:53:47] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 1476 ms to find 0 implicit places.
[2024-05-23 15:53:47] [INFO ] Redundant transitions in 18 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 15:53:47] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 15:53:47] [INFO ] Invariant cache hit.
[2024-05-23 15:53:47] [INFO ] State equation strengthened by 75 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.05101e+09 after 2.88938e+09
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.88938e+09 after 4.55103e+09
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 15:54:01] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :4.55103e+09 after 7.90901e+09
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 34530ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34541ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36085 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 1 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 20 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 15:54:22] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 15:54:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 15:54:22] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 15:54:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 15:54:22] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 15:54:22] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 15:54:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 15:54:22] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 15:54:22] [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 15:54:22] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 15:54:22] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 15:54:22] [INFO ] Flatten gal took : 0 ms
[2024-05-23 15:54:22] [INFO ] Flatten gal took : 0 ms
[2024-05-23 15:54:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4977522692326684207.gal : 0 ms
[2024-05-23 15:54:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10696390493761761325.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/ReachabilityCardinality4977522692326684207.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10696390493761761325.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/ReachabilityCardinality10696390493761761325.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 45
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :45 after 285
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :285 after 625
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :625 after 1285
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1285 after 2585
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2585 after 5165
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5165 after 10305
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10305 after 20565
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :20565 after 41065
Detected timeout of ITS tools.
[2024-05-23 15:54:24] [INFO ] Flatten gal took : 28 ms
[2024-05-23 15:54:24] [INFO ] Applying decomposition
[2024-05-23 15:54:24] [INFO ] Flatten gal took : 30 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/graph14325023464951700466.txt' '-o' '/tmp/graph14325023464951700466.bin' '-w' '/tmp/graph14325023464951700466.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14325023464951700466.bin' '-l' '-1' '-v' '-w' '/tmp/graph14325023464951700466.weights' '-q' '0' '-e' '0.001'
[2024-05-23 15:54:24] [INFO ] Decomposing Gal with order
[2024-05-23 15:54:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 15:54:24] [INFO ] Removed a total of 2082 redundant transitions.
[2024-05-23 15:54:24] [INFO ] Flatten gal took : 66 ms
[2024-05-23 15:54:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 850 labels/synchronizations in 47 ms.
[2024-05-23 15:54:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3747259395720462260.gal : 12 ms
[2024-05-23 15:54:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10910851353457843826.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/ReachabilityCardinality3747259395720462260.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10910851353457843826.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/ReachabilityCardinality10910851353457843826.prop.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :41065 after 82045
Detected timeout of ITS tools.
[2024-05-23 15:54:37] [INFO ] Flatten gal took : 1 ms
[2024-05-23 15:54:37] [INFO ] Applying decomposition
[2024-05-23 15:54:37] [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/graph3281488780643932177.txt' '-o' '/tmp/graph3281488780643932177.bin' '-w' '/tmp/graph3281488780643932177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3281488780643932177.bin' '-l' '-1' '-v' '-w' '/tmp/graph3281488780643932177.weights' '-q' '0' '-e' '0.001'
[2024-05-23 15:54:37] [INFO ] Decomposing Gal with order
[2024-05-23 15:54:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 15:54:37] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-23 15:54:37] [INFO ] Flatten gal took : 2 ms
[2024-05-23 15:54:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2024-05-23 15:54:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4527574708998805840.gal : 1 ms
[2024-05-23 15:54:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17591789576877470302.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/ReachabilityCardinality4527574708998805840.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17591789576877470302.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/ReachabilityCardinality17591789576877470302.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 30
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30193 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:[439] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-03 in 161441 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 15:54:52] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-23 15:54:52] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 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 15:54:52] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:54:52] [INFO ] Invariant cache hit.
[2024-05-23 15:54:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:54:52] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 15:54:52] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:54:52] [INFO ] [Real]Added 95 Read/Feed constraints in 40 ms returned sat
[2024-05-23 15:54:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:54:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:54:53] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 15:54:53] [INFO ] [Nat]Added 95 Read/Feed constraints in 26 ms returned sat
[2024-05-23 15:54:53] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 88 ms.
[2024-05-23 15:54:53] [INFO ] Added : 2 causal constraints over 1 iterations in 184 ms. Result :sat
Minimization took 272 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 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 465 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 465 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 460 transition count 1300
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 460 transition count 1300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 455 transition count 1288
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 455 transition count 1288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 450 transition count 1276
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 450 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 445 transition count 1266
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 445 transition count 1266
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 440 transition count 1256
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 440 transition count 1256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 435 transition count 1246
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 435 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 431 transition count 1238
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 431 transition count 1238
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 428 transition count 1232
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 428 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 82 place count 426 transition count 1228
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 425 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 425 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 424 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 424 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 423 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 423 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 422 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 422 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 421 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 421 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 420 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 419 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 419 transition count 1212
Applied a total of 98 rules in 161 ms. Remains 419 /469 variables (removed 50) and now considering 1212/1317 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 419/469 places, 1212/1317 transitions.
[2024-05-23 15:54:53] [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 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 15:54:54] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2024-05-23 15:54:54] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 2019 ms. (495 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 552 ms. (1808 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[482] Max Struct:[+inf]
[2024-05-23 15:54:56] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 15:54:56] [INFO ] Invariant cache hit.
[2024-05-23 15:54:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:54:56] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-05-23 15:54:56] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 15:54:56] [INFO ] [Real]Added 75 Read/Feed constraints in 36 ms returned sat
[2024-05-23 15:54:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:54:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:54:57] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-23 15:54:57] [INFO ] [Nat]Added 75 Read/Feed constraints in 31 ms returned sat
[2024-05-23 15:54:57] [INFO ] Deduced a trap composed of 71 places in 188 ms of which 2 ms to minimize.
[2024-05-23 15:54:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2024-05-23 15:54:57] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 78 ms.
[2024-05-23 15:54:57] [INFO ] Added : 17 causal constraints over 5 iterations in 335 ms. Result :sat
Minimization took 248 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[482] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[482] 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 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 51 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-23 15:54:59] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 15:54:59] [INFO ] Invariant cache hit.
[2024-05-23 15:55:00] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-23 15:55:00] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 15:55:00] [INFO ] Invariant cache hit.
[2024-05-23 15:55:00] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 15:55:01] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1551 ms to find 0 implicit places.
[2024-05-23 15:55:01] [INFO ] Redundant transitions in 14 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-23 15:55:01] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 15:55:01] [INFO ] Invariant cache hit.
[2024-05-23 15:55:01] [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 15:55:16] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 3 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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34977ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34988ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36610 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-23 15:55:36] [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 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[482] Max Struct:[+inf]
[2024-05-23 15:55:36] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 15:55:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[482] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2006 ms. (498 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 553 ms. (1805 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[482] Max Struct:[+inf]
[2024-05-23 15:55:39] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 15:55:39] [INFO ] Invariant cache hit.
[2024-05-23 15:55:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:55:39] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-23 15:55:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 15:55:39] [INFO ] [Real]Added 75 Read/Feed constraints in 35 ms returned sat
[2024-05-23 15:55:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:55:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:55:39] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-05-23 15:55:39] [INFO ] [Nat]Added 75 Read/Feed constraints in 29 ms returned sat
[2024-05-23 15:55:39] [INFO ] Deduced a trap composed of 71 places in 182 ms of which 2 ms to minimize.
[2024-05-23 15:55:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2024-05-23 15:55:39] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 61 ms.
[2024-05-23 15:55:40] [INFO ] Added : 17 causal constraints over 5 iterations in 311 ms. Result :sat
Minimization took 241 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[482] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[482] 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 40 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 15:55:42] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 15:55:42] [INFO ] Invariant cache hit.
[2024-05-23 15:55:42] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-23 15:55:42] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 15:55:42] [INFO ] Invariant cache hit.
[2024-05-23 15:55:42] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 15:55:43] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
[2024-05-23 15:55:43] [INFO ] Redundant transitions in 20 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-23 15:55:43] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 15:55:43] [INFO ] Invariant cache hit.
[2024-05-23 15:55:43] [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 15:55:57] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 3 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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34452ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34462ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36003 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-23 15:56:18] [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 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[482] Max Struct:[+inf]
[2024-05-23 15:56:18] [INFO ] Flatten gal took : 38 ms
RANDOM walk for 40001 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
[2024-05-23 15:56:18] [INFO ] Flatten gal took : 26 ms
[2024-05-23 15:56:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3373976055428368399.gal : 5 ms
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
[2024-05-23 15:56:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16824627013480371053.prop : 5 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/ReachabilityCardinality3373976055428368399.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16824627013480371053.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/ReachabilityCardinality16824627013480371053.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 1862
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1862 after 695653
Interrupted probabilistic random walk after 502754 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 502754 steps, saw 308284 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2024-05-23 15:56:21] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 15:56:21] [INFO ] Invariant cache hit.
[2024-05-23 15:56:21] [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 293 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 275 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 601ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :695653 after 6.64141e+07
Parikh walk visited 0 properties in 2040 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 46 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 46 ms. Remains : 419/419 places, 1212/1212 transitions.
RANDOM walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6.64141e+07 after 2.25041e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.25041e+08 after 2.6536e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.6536e+08 after 3.64167e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.64167e+08 after 4.55772e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.55772e+08 after 5.88835e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.88835e+08 after 1.32186e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.32186e+09 after 1.38954e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.38954e+09 after 1.58161e+09
Interrupted probabilistic random walk after 506433 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 506433 steps, saw 310540 distinct states, run finished after 3003 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-23 15:56:27] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 15:56:27] [INFO ] Invariant cache hit.
[2024-05-23 15:56:27] [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 310 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 282 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 611ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.58161e+09 after 2.00419e+09
Parikh walk visited 0 properties in 2049 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 49 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-23 15:56:29] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 15:56:29] [INFO ] Invariant cache hit.
[2024-05-23 15:56:30] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-23 15:56:30] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 15:56:30] [INFO ] Invariant cache hit.
[2024-05-23 15:56:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 15:56:31] [INFO ] Implicit Places using invariants and state equation in 1214 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2024-05-23 15:56:31] [INFO ] Redundant transitions in 16 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-23 15:56:31] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 15:56:31] [INFO ] Invariant cache hit.
[2024-05-23 15:56:31] [INFO ] State equation strengthened by 75 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.00419e+09 after 2.86971e+09
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.86971e+09 after 4.56761e+09
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-23 15:56:46] [INFO ] Deduced a trap composed of 131 places in 198 ms of which 3 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 131072
SDD size :4.56761e+09 after 7.96307e+09
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 34885ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34895ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36482 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 1 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 23 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 15:57:06] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 15:57:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 15:57:06] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 15:57:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 15:57:06] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 15:57:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 15:57:06] [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 15:57:06] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 15:57:06] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 15:57:06] [INFO ] Flatten gal took : 0 ms
[2024-05-23 15:57:06] [INFO ] Flatten gal took : 0 ms
[2024-05-23 15:57:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5075494112389432402.gal : 0 ms
[2024-05-23 15:57:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16464297906112756688.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/ReachabilityCardinality5075494112389432402.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16464297906112756688.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/ReachabilityCardinality16464297906112756688.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 45
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :45 after 285
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :285 after 625
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :625 after 1285
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1285 after 2585
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2585 after 5165
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5165 after 10305
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10305 after 20565
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :20565 after 41065
Detected timeout of ITS tools.
[2024-05-23 15:57:08] [INFO ] Flatten gal took : 24 ms
[2024-05-23 15:57:08] [INFO ] Applying decomposition
[2024-05-23 15:57:08] [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/graph8806318378562318808.txt' '-o' '/tmp/graph8806318378562318808.bin' '-w' '/tmp/graph8806318378562318808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8806318378562318808.bin' '-l' '-1' '-v' '-w' '/tmp/graph8806318378562318808.weights' '-q' '0' '-e' '0.001'
[2024-05-23 15:57:08] [INFO ] Decomposing Gal with order
[2024-05-23 15:57:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 15:57:08] [INFO ] Removed a total of 2073 redundant transitions.
[2024-05-23 15:57:08] [INFO ] Flatten gal took : 45 ms
[2024-05-23 15:57:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 827 labels/synchronizations in 17 ms.
[2024-05-23 15:57:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5952036770574488026.gal : 5 ms
[2024-05-23 15:57:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6104266594877567835.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/ReachabilityCardinality5952036770574488026.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6104266594877567835.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/ReachabilityCardinality6104266594877567835.prop.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :41065 after 82045
Detected timeout of ITS tools.
[2024-05-23 15:57:21] [INFO ] Flatten gal took : 2 ms
[2024-05-23 15:57:21] [INFO ] Applying decomposition
[2024-05-23 15:57:21] [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/graph793225845460166652.txt' '-o' '/tmp/graph793225845460166652.bin' '-w' '/tmp/graph793225845460166652.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph793225845460166652.bin' '-l' '-1' '-v' '-w' '/tmp/graph793225845460166652.weights' '-q' '0' '-e' '0.001'
[2024-05-23 15:57:21] [INFO ] Decomposing Gal with order
[2024-05-23 15:57:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 15:57:21] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-23 15:57:21] [INFO ] Flatten gal took : 2 ms
[2024-05-23 15:57:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2024-05-23 15:57:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality695838667409202024.gal : 0 ms
[2024-05-23 15:57:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9035962921827144958.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/ReachabilityCardinality695838667409202024.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9035962921827144958.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/ReachabilityCardinality9035962921827144958.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 30
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30157 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:[482] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-05 in 164088 ms.
Starting property specific reduction for FunctionPointer-PT-c004-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 15:57:36] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-23 15:57:36] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10003 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:[32] Max Struct:[+inf]
[2024-05-23 15:57:36] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 15:57:36] [INFO ] Invariant cache hit.
[2024-05-23 15:57:36] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 15:57:36] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 15:57:36] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 15:57:36] [INFO ] [Real]Added 95 Read/Feed constraints in 40 ms returned sat
[2024-05-23 15:57:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:57:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:57:37] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 15:57:37] [INFO ] [Nat]Added 95 Read/Feed constraints in 37 ms returned sat
[2024-05-23 15:57:37] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 67 ms.
[2024-05-23 15:57:37] [INFO ] Added : 4 causal constraints over 1 iterations in 151 ms. Result :sat
Minimization took 262 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[32] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[32] Max Struct:[+inf]
Support contains 1 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 466 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 466 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 461 transition count 1300
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 461 transition count 1300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 456 transition count 1288
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 456 transition count 1288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 451 transition count 1276
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 451 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 446 transition count 1266
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 446 transition count 1266
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 441 transition count 1256
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 441 transition count 1256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 436 transition count 1246
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 436 transition count 1246
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 433 transition count 1240
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 433 transition count 1240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 431 transition count 1236
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 431 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 430 transition count 1234
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 430 transition count 1234
Applied a total of 78 rules in 116 ms. Remains 430 /469 variables (removed 39) and now considering 1234/1317 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 430/469 places, 1234/1317 transitions.
[2024-05-23 15:57:37] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
Found an invariant !
This invariant on transitions {192=1, 289=1, 489=1, 694=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 349=1, 549=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[40]
Current structural bounds on expressions (after cover walk) : Max Seen:[40] Max Struct:[+inf]
[2024-05-23 15:57:38] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
// Phase 1: matrix 699 rows 430 cols
[2024-05-23 15:57:38] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[40] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2067 ms. (483 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 553 ms. (1805 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7081] Max Struct:[+inf]
[2024-05-23 15:57:40] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-23 15:57:40] [INFO ] Invariant cache hit.
[2024-05-23 15:57:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:57:40] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-23 15:57:40] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 15:57:40] [INFO ] [Real]Added 77 Read/Feed constraints in 30 ms returned sat
[2024-05-23 15:57:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:57:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:57:41] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-23 15:57:41] [INFO ] [Nat]Added 77 Read/Feed constraints in 34 ms returned sat
[2024-05-23 15:57:41] [INFO ] Computed and/alt/rep : 343/1274/336 causal constraints (skipped 361 transitions) in 63 ms.
[2024-05-23 15:57:41] [INFO ] Added : 17 causal constraints over 4 iterations in 308 ms. Result :sat
Minimization took 232 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7081] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[61834] Max Struct:[+inf]
Support contains 1 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1234/1234 transitions.
Applied a total of 0 rules in 42 ms. Remains 430 /430 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 430/430 places, 1234/1234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1234/1234 transitions.
Applied a total of 0 rules in 42 ms. Remains 430 /430 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
[2024-05-23 15:58:11] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-23 15:58:11] [INFO ] Invariant cache hit.
[2024-05-23 15:58:12] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-23 15:58:12] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-23 15:58:12] [INFO ] Invariant cache hit.
[2024-05-23 15:58:12] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 15:58:13] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1653 ms to find 0 implicit places.
[2024-05-23 15:58:13] [INFO ] Redundant transitions in 18 ms returned []
Running 1232 sub problems to find dead transitions.
[2024-05-23 15:58:13] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-23 15:58:13] [INFO ] Invariant cache hit.
[2024-05-23 15:58:13] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
[2024-05-23 15:58:27] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
At refinement iteration 3 (OVERLAPS) 699/1128 variables, 429/433 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
SMT process timed out in 34552ms, After SMT, problems are : Problem set: 0 solved, 1232 unsolved
Search for dead transitions found 0 dead transitions in 34562ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36281 ms. Remains : 430/430 places, 1234/1234 transitions.
[2024-05-23 15:58:48] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
Found an invariant !
This invariant on transitions {192=1, 289=1, 489=1, 694=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 349=1, 549=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[26]
Current structural bounds on expressions (after cover walk) : Max Seen:[61834] Max Struct:[+inf]
[2024-05-23 15:58:48] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-23 15:58:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[61834] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2011 ms. (497 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 564 ms. (1769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[61834] Max Struct:[+inf]
[2024-05-23 15:58:50] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-23 15:58:50] [INFO ] Invariant cache hit.
[2024-05-23 15:58:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 15:58:51] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-23 15:58:51] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 15:58:51] [INFO ] [Real]Added 77 Read/Feed constraints in 25 ms returned sat
[2024-05-23 15:58:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:58:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 15:58:51] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-23 15:58:51] [INFO ] [Nat]Added 77 Read/Feed constraints in 35 ms returned sat
[2024-05-23 15:58:51] [INFO ] Computed and/alt/rep : 343/1274/336 causal constraints (skipped 361 transitions) in 67 ms.
[2024-05-23 15:58:51] [INFO ] Added : 17 causal constraints over 4 iterations in 303 ms. Result :sat
Minimization took 239 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[61834] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[61834] Max Struct:[+inf]
Support contains 1 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1234/1234 transitions.
Applied a total of 0 rules in 46 ms. Remains 430 /430 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 430/430 places, 1234/1234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1234/1234 transitions.
Applied a total of 0 rules in 46 ms. Remains 430 /430 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
[2024-05-23 15:59:22] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-23 15:59:22] [INFO ] Invariant cache hit.
[2024-05-23 15:59:22] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-23 15:59:22] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-23 15:59:22] [INFO ] Invariant cache hit.
[2024-05-23 15:59:22] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 15:59:23] [INFO ] Implicit Places using invariants and state equation in 1460 ms returned []
Implicit Place search using SMT with State Equation took 1787 ms to find 0 implicit places.
[2024-05-23 15:59:23] [INFO ] Redundant transitions in 21 ms returned []
Running 1232 sub problems to find dead transitions.
[2024-05-23 15:59:23] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-23 15:59:23] [INFO ] Invariant cache hit.
[2024-05-23 15:59:23] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
[2024-05-23 15:59:38] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
At refinement iteration 3 (OVERLAPS) 699/1128 variables, 429/433 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
SMT process timed out in 35058ms, After SMT, problems are : Problem set: 0 solved, 1232 unsolved
Search for dead transitions found 0 dead transitions in 35072ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36939 ms. Remains : 430/430 places, 1234/1234 transitions.
[2024-05-23 15:59:58] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
Found an invariant !
This invariant on transitions {192=1, 289=1, 489=1, 694=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 349=1, 549=1, 694=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[20]
Current structural bounds on expressions (after cover walk) : Max Seen:[61834] Max Struct:[+inf]
[2024-05-23 15:59:59] [INFO ] Flatten gal took : 26 ms
RANDOM walk for 40000 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
[2024-05-23 15:59:59] [INFO ] Flatten gal took : 26 ms
[2024-05-23 15:59:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3398565642257994773.gal : 4 ms
[2024-05-23 15:59:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8078789885320432114.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/ReachabilityCardinality3398565642257994773.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8078789885320432114.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 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/ReachabilityCardinality8078789885320432114.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 1844
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1844 after 666889
Interrupted probabilistic random walk after 511873 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 511873 steps, saw 313876 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2024-05-23 16:00:02] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-23 16:00:02] [INFO ] Invariant cache hit.
[2024-05-23 16:00:02] [INFO ] State equation strengthened by 77 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) 351/354 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 9/363 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 609/972 variables, 340/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1034 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1034 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 74/1108 variables, 69/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1108 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/1120 variables, 6/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/1129 variables, 6/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1129 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1129 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1129/1129 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 430/430 constraints, ReadFeed: 77/77 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) 351/354 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/363 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 609/972 variables, 340/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/972 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1034 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1034 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 74/1108 variables, 69/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1108 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1120 variables, 6/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1120 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/1129 variables, 6/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1129 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1129 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1129/1129 variables, and 511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 430/430 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 598ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1234/1234 transitions.
Applied a total of 0 rules in 47 ms. Remains 430 /430 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 430/430 places, 1234/1234 transitions.
RANDOM walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 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 :666889 after 4.93325e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4.93325e+07 after 1.09048e+08
Interrupted probabilistic random walk after 512644 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 512644 steps, saw 314348 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2024-05-23 16:00:05] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-23 16:00:05] [INFO ] Invariant cache hit.
[2024-05-23 16:00:06] [INFO ] State equation strengthened by 77 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) 351/354 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 9/363 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 609/972 variables, 340/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1034 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1034 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 74/1108 variables, 69/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1108 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/1120 variables, 6/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/1129 variables, 6/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1129 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1129 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1129/1129 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 430/430 constraints, ReadFeed: 77/77 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) 351/354 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/363 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 609/972 variables, 340/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/972 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1034 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1034 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 74/1108 variables, 69/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1108 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1120 variables, 6/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1120 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/1129 variables, 6/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1129 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1129 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1129/1129 variables, and 511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 430/430 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 608ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1234/1234 transitions.
Applied a total of 0 rules in 46 ms. Remains 430 /430 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 430/430 places, 1234/1234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1234/1234 transitions.
Applied a total of 0 rules in 41 ms. Remains 430 /430 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
[2024-05-23 16:00:06] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-23 16:00:06] [INFO ] Invariant cache hit.
[2024-05-23 16:00:06] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-23 16:00:06] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-23 16:00:06] [INFO ] Invariant cache hit.
[2024-05-23 16:00:07] [INFO ] State equation strengthened by 77 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.09048e+08 after 1.80279e+08
[2024-05-23 16:00:08] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 1673 ms to find 0 implicit places.
[2024-05-23 16:00:08] [INFO ] Redundant transitions in 19 ms returned []
Running 1232 sub problems to find dead transitions.
[2024-05-23 16:00:08] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-23 16:00:08] [INFO ] Invariant cache hit.
[2024-05-23 16:00:08] [INFO ] State equation strengthened by 77 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.80279e+08 after 2.99934e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.99934e+08 after 4.78189e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.78189e+08 after 5.30724e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.30724e+08 after 5.98649e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.98649e+08 after 1.52252e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.52252e+09 after 3.92209e+09
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
[2024-05-23 16:00:21] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
At refinement iteration 3 (OVERLAPS) 699/1128 variables, 429/433 constraints. Problems are: Problem set: 0 solved, 1232 unsolved
SMT process timed out in 34079ms, After SMT, problems are : Problem set: 0 solved, 1232 unsolved
Search for dead transitions found 0 dead transitions in 34090ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35831 ms. Remains : 430/430 places, 1234/1234 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 535 transitions
Reduce isomorphic transitions removed 535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 551 rules applied. Total rules applied 551 place count 430 transition count 683
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 567 place count 414 transition count 683
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 567 place count 414 transition count 610
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 713 place count 341 transition count 610
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 967 place count 214 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1031 place count 150 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1095 place count 150 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1096 place count 150 transition count 354
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1159 place count 87 transition count 228
Iterating global reduction 3 with 63 rules applied. Total rules applied 1222 place count 87 transition count 228
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1285 place count 24 transition count 102
Iterating global reduction 3 with 63 rules applied. Total rules applied 1348 place count 24 transition count 102
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1411 place count 24 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1411 place count 24 transition count 38
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 1413 place count 23 transition count 38
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 1415 place count 22 transition count 37
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 1417 place count 21 transition count 37
Applied a total of 1417 rules in 23 ms. Remains 21 /430 variables (removed 409) and now considering 37/1234 (removed 1197) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 37 rows 21 cols
[2024-05-23 16:00:42] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 16:00:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 16:00:42] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:00:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 16:00:42] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:00:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:00:42] [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 16:00:42] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:00:42] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:00:42] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:00:42] [INFO ] Flatten gal took : 0 ms
[2024-05-23 16:00:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6828746102488861041.gal : 0 ms
[2024-05-23 16:00:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1500841678786971726.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/ReachabilityCardinality6828746102488861041.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1500841678786971726.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/ReachabilityCardinality1500841678786971726.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 60
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :60 after 900
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :900 after 4560
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4560 after 19900
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :19900 after 81980
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :81980 after 330300
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :330300 after 1.32104e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.32104e+06 after 5.2737e+06
Detected timeout of ITS tools.
[2024-05-23 16:00:49] [INFO ] Flatten gal took : 26 ms
[2024-05-23 16:00:49] [INFO ] Applying decomposition
[2024-05-23 16:00:49] [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/graph13718484410467744455.txt' '-o' '/tmp/graph13718484410467744455.bin' '-w' '/tmp/graph13718484410467744455.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13718484410467744455.bin' '-l' '-1' '-v' '-w' '/tmp/graph13718484410467744455.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:00:49] [INFO ] Decomposing Gal with order
[2024-05-23 16:00:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:00:49] [INFO ] Removed a total of 2117 redundant transitions.
[2024-05-23 16:00:49] [INFO ] Flatten gal took : 45 ms
[2024-05-23 16:00:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 995 labels/synchronizations in 21 ms.
[2024-05-23 16:00:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11999973935404381016.gal : 6 ms
[2024-05-23 16:00:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1572415683777488013.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/ReachabilityCardinality11999973935404381016.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1572415683777488013.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
SDD proceeding with computation,1 properties remain. new max is 2048
Loading property file /tmp/ReachabilityCardinality1572415683777488013.prop.
SDD size :5.2737e+06 after 2.10536e+07
Detected timeout of ITS tools.
[2024-05-23 16:00:57] [INFO ] Flatten gal took : 3 ms
[2024-05-23 16:00:57] [INFO ] Applying decomposition
[2024-05-23 16:00:57] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3256967478373107595.txt' '-o' '/tmp/graph3256967478373107595.bin' '-w' '/tmp/graph3256967478373107595.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3256967478373107595.bin' '-l' '-1' '-v' '-w' '/tmp/graph3256967478373107595.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:00:57] [INFO ] Decomposing Gal with order
[2024-05-23 16:00:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:00:57] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-23 16:00:57] [INFO ] Flatten gal took : 2 ms
[2024-05-23 16:00:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2024-05-23 16:00:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4280211172809012441.gal : 1 ms
[2024-05-23 16:00:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12058515238264681630.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/ReachabilityCardinality4280211172809012441.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12058515238264681630.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/ReachabilityCardinality12058515238264681630.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 30
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30164 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:[61834] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-06 in 216081 ms.
Starting property specific reduction for FunctionPointer-PT-c004-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 16:01:12] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-23 16:01:12] [INFO ] Computed 3 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 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 16:01:12] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 16:01:12] [INFO ] Invariant cache hit.
[2024-05-23 16:01:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:01:12] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-23 16:01:12] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 16:01:12] [INFO ] [Real]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-23 16:01:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:01:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 16:01:13] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 16:01:13] [INFO ] [Nat]Added 95 Read/Feed constraints in 28 ms returned sat
[2024-05-23 16:01:13] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 75 ms.
[2024-05-23 16:01:13] [INFO ] Added : 2 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 294 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:[2] Max Struct:[+inf]
Support contains 1 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 468 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 462 transition count 1303
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 462 transition count 1303
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 456 transition count 1289
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 456 transition count 1289
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 31 place count 450 transition count 1275
Iterating global reduction 0 with 6 rules applied. Total rules applied 37 place count 450 transition count 1275
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 43 place count 444 transition count 1263
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 444 transition count 1263
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 55 place count 438 transition count 1251
Iterating global reduction 0 with 6 rules applied. Total rules applied 61 place count 438 transition count 1251
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 67 place count 432 transition count 1239
Iterating global reduction 0 with 6 rules applied. Total rules applied 73 place count 432 transition count 1239
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 77 place count 428 transition count 1231
Iterating global reduction 0 with 4 rules applied. Total rules applied 81 place count 428 transition count 1231
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 84 place count 425 transition count 1225
Iterating global reduction 0 with 3 rules applied. Total rules applied 87 place count 425 transition count 1225
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 423 transition count 1221
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 423 transition count 1221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 92 place count 422 transition count 1217
Iterating global reduction 0 with 1 rules applied. Total rules applied 93 place count 422 transition count 1217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 94 place count 421 transition count 1215
Iterating global reduction 0 with 1 rules applied. Total rules applied 95 place count 421 transition count 1215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 96 place count 420 transition count 1213
Iterating global reduction 0 with 1 rules applied. Total rules applied 97 place count 420 transition count 1213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 98 place count 419 transition count 1211
Iterating global reduction 0 with 1 rules applied. Total rules applied 99 place count 419 transition count 1211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 100 place count 418 transition count 1209
Iterating global reduction 0 with 1 rules applied. Total rules applied 101 place count 418 transition count 1209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 102 place count 417 transition count 1207
Iterating global reduction 0 with 1 rules applied. Total rules applied 103 place count 417 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 104 place count 416 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 105 place count 416 transition count 1205
Applied a total of 105 rules in 161 ms. Remains 416 /469 variables (removed 53) and now considering 1205/1317 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 416/469 places, 1205/1317 transitions.
[2024-05-23 16:01:13] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 16:01:14] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2024-05-23 16:01:14] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1955 ms. (511 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 545 ms. (1831 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 16:01:16] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 16:01:16] [INFO ] Invariant cache hit.
[2024-05-23 16:01:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:01:16] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-05-23 16:01:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:01:16] [INFO ] [Real]Added 75 Read/Feed constraints in 21 ms returned sat
[2024-05-23 16:01:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:01:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:01:17] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 16:01:17] [INFO ] [Nat]Added 75 Read/Feed constraints in 47 ms returned sat
[2024-05-23 16:01:17] [INFO ] Deduced a trap composed of 69 places in 175 ms of which 3 ms to minimize.
[2024-05-23 16:01:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2024-05-23 16:01:17] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 61 ms.
[2024-05-23 16:01:17] [INFO ] Deduced a trap composed of 75 places in 172 ms of which 3 ms to minimize.
[2024-05-23 16:01:17] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 3 ms to minimize.
[2024-05-23 16:01:18] [INFO ] Deduced a trap composed of 69 places in 167 ms of which 3 ms to minimize.
[2024-05-23 16:01:18] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 3 ms to minimize.
[2024-05-23 16:01:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 786 ms
[2024-05-23 16:01:18] [INFO ] Added : 5 causal constraints over 2 iterations in 1010 ms. Result :sat
Minimization took 260 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:[3] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 39 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 40 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-23 16:01:18] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 16:01:18] [INFO ] Invariant cache hit.
[2024-05-23 16:01:19] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-23 16:01:19] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 16:01:19] [INFO ] Invariant cache hit.
[2024-05-23 16:01:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:01:20] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
[2024-05-23 16:01:20] [INFO ] Redundant transitions in 18 ms returned []
Running 1203 sub problems to find dead transitions.
[2024-05-23 16:01:20] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 16:01:20] [INFO ] Invariant cache hit.
[2024-05-23 16:01:20] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2024-05-23 16:01:33] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 34227ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 34237ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35767 ms. Remains : 416/416 places, 1205/1205 transitions.
[2024-05-23 16:01:54] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 16:01:54] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 16:01:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2165 ms. (461 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 612 ms. (1631 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 16:01:57] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 16:01:57] [INFO ] Invariant cache hit.
[2024-05-23 16:01:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:01:57] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 16:01:57] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:01:57] [INFO ] [Real]Added 75 Read/Feed constraints in 23 ms returned sat
[2024-05-23 16:01:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:01:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:01:58] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 16:01:58] [INFO ] [Nat]Added 75 Read/Feed constraints in 40 ms returned sat
[2024-05-23 16:01:58] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 2 ms to minimize.
[2024-05-23 16:01:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2024-05-23 16:01:58] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 74 ms.
[2024-05-23 16:01:58] [INFO ] Deduced a trap composed of 72 places in 193 ms of which 3 ms to minimize.
[2024-05-23 16:01:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2024-05-23 16:01:58] [INFO ] Added : 4 causal constraints over 2 iterations in 489 ms. Result :sat
Minimization took 246 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 41 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 39 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-23 16:01:59] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 16:01:59] [INFO ] Invariant cache hit.
[2024-05-23 16:01:59] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-23 16:01:59] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 16:01:59] [INFO ] Invariant cache hit.
[2024-05-23 16:01:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:02:00] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
[2024-05-23 16:02:00] [INFO ] Redundant transitions in 14 ms returned []
Running 1203 sub problems to find dead transitions.
[2024-05-23 16:02:00] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 16:02:00] [INFO ] Invariant cache hit.
[2024-05-23 16:02:00] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2024-05-23 16:02:14] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1203 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) 680/1096 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 34339ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 34355ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35947 ms. Remains : 416/416 places, 1205/1205 transitions.
[2024-05-23 16:02:35] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 16:02:35] [INFO ] Flatten gal took : 40 ms
RANDOM walk for 40001 steps (8 resets) in 178 ms. (223 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
[2024-05-23 16:02:35] [INFO ] Flatten gal took : 24 ms
[2024-05-23 16:02:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7400012335630189352.gal : 4 ms
[2024-05-23 16:02:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6852058437856276203.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/ReachabilityCardinality7400012335630189352.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6852058437856276203.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/ReachabilityCardinality6852058437856276203.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 1862
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1862 after 695653
Interrupted probabilistic random walk after 514262 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 1
Probabilistic random walk after 514262 steps, saw 315340 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
[2024-05-23 16:02:38] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 16:02:38] [INFO ] Invariant cache hit.
[2024-05-23 16:02: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) 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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 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) 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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/354 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 598/952 variables, 333/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 74/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1082 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1090 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1090 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1096 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 602ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 6 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:[3] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-10 in 86403 ms.
Starting property specific reduction for FunctionPointer-PT-c004-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 16:02:39] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-23 16:02:39] [INFO ] Computed 3 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 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 16:02:39] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 16:02:39] [INFO ] Invariant cache hit.
[2024-05-23 16:02:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:02:39] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-23 16:02:39] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 16:02:39] [INFO ] [Real]Added 95 Read/Feed constraints in 27 ms returned sat
[2024-05-23 16:02:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:02:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:02:39] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-23 16:02:39] [INFO ] [Nat]Added 95 Read/Feed constraints in 33 ms returned sat
[2024-05-23 16:02:39] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-23 16:02:39] [INFO ] Added : 2 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 261 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 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 465 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 465 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 460 transition count 1300
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 460 transition count 1300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 455 transition count 1288
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 455 transition count 1288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 450 transition count 1276
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 450 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 445 transition count 1266
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 445 transition count 1266
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 440 transition count 1256
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 440 transition count 1256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 435 transition count 1246
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 435 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 431 transition count 1238
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 431 transition count 1238
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 428 transition count 1232
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 428 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 82 place count 426 transition count 1228
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 425 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 425 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 424 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 424 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 423 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 423 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 422 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 422 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 421 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 421 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 420 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 419 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 419 transition count 1212
Applied a total of 98 rules in 160 ms. Remains 419 /469 variables (removed 50) and now considering 1212/1317 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 419/469 places, 1212/1317 transitions.
[2024-05-23 16:02:40] [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 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 16:02:40] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2024-05-23 16:02:40] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2026 ms. (493 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 548 ms. (1821 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 16:02:43] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 16:02:43] [INFO ] Invariant cache hit.
[2024-05-23 16:02:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:02:43] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-05-23 16:02:43] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:02:43] [INFO ] [Real]Added 75 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:02:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:02:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:02:43] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-23 16:02:43] [INFO ] [Nat]Added 75 Read/Feed constraints in 42 ms returned sat
[2024-05-23 16:02:43] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 63 ms.
[2024-05-23 16:02:43] [INFO ] Added : 8 causal constraints over 2 iterations in 209 ms. Result :sat
Minimization took 233 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 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.
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.
[2024-05-23 16:02:44] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 16:02:44] [INFO ] Invariant cache hit.
[2024-05-23 16:02:44] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-23 16:02:44] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 16:02:44] [INFO ] Invariant cache hit.
[2024-05-23 16:02:44] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:02:45] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
[2024-05-23 16:02:45] [INFO ] Redundant transitions in 19 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-23 16:02:45] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-23 16:02:45] [INFO ] Invariant cache hit.
[2024-05-23 16:02:45] [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 16:02:59] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 3 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 34110ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35667 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-23 16:03:19] [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 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 40008 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
[2024-05-23 16:03:20] [INFO ] Flatten gal took : 37 ms
BEST_FIRST walk for 30892 steps (6 resets) in 22 ms. (1343 steps per ms) remains 0/1 properties
[2024-05-23 16:03:20] [INFO ] Flatten gal took : 24 ms
[2024-05-23 16:03:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11704466457409990875.gal : 4 ms
[2024-05-23 16:03:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9469947284690698070.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/ReachabilityCardinality11704466457409990875.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9469947284690698070.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 ...329
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-11 in 41214 ms.
Starting property specific reduction for FunctionPointer-PT-c004-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 16:03:20] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-23 16:03:20] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10004 steps (2 resets) in 23 ms. (416 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 16:03:20] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-23 16:03:20] [INFO ] Invariant cache hit.
[2024-05-23 16:03:20] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 16:03:20] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-23 16:03:20] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-23 16:03:20] [INFO ] [Real]Added 95 Read/Feed constraints in 35 ms returned sat
[2024-05-23 16:03:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:03:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:03:20] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-23 16:03:20] [INFO ] [Nat]Added 95 Read/Feed constraints in 26 ms returned sat
[2024-05-23 16:03:20] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 73 ms.
[2024-05-23 16:03:21] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 303 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 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 465 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 465 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 460 transition count 1302
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 460 transition count 1302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 455 transition count 1290
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 455 transition count 1290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 450 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 450 transition count 1278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 445 transition count 1268
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 445 transition count 1268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 440 transition count 1258
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 440 transition count 1258
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 435 transition count 1248
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 435 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 432 transition count 1242
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 432 transition count 1242
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 429 transition count 1236
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 429 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 427 transition count 1232
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 427 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 426 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 425 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 424 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 420 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 420 transition count 1216
Applied a total of 96 rules in 155 ms. Remains 420 /469 variables (removed 49) and now considering 1216/1317 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 420/469 places, 1216/1317 transitions.
[2024-05-23 16:03:21] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 16:03:21] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
// Phase 1: matrix 687 rows 420 cols
[2024-05-23 16:03:21] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 2034 ms. (491 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 549 ms. (1818 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 16:03:24] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:03:24] [INFO ] Invariant cache hit.
[2024-05-23 16:03:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:03:24] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 16:03:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:03:24] [INFO ] [Real]Added 75 Read/Feed constraints in 28 ms returned sat
[2024-05-23 16:03:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:03:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:03:24] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-23 16:03:24] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-23 16:03:24] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 353 transitions) in 67 ms.
[2024-05-23 16:03:25] [INFO ] Added : 17 causal constraints over 6 iterations in 357 ms. Result :sat
Minimization took 270 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 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 42 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 41 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-23 16:03:25] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:03:25] [INFO ] Invariant cache hit.
[2024-05-23 16:03:25] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-23 16:03:25] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:03:25] [INFO ] Invariant cache hit.
[2024-05-23 16:03:26] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:03:27] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
[2024-05-23 16:03:27] [INFO ] Redundant transitions in 17 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-23 16:03:27] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:03:27] [INFO ] Invariant cache hit.
[2024-05-23 16:03:27] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-23 16:03:41] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 34426ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 34440ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36216 ms. Remains : 420/420 places, 1216/1216 transitions.
[2024-05-23 16:04:01] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 16:04:02] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:04:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2138 ms. (467 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 598 ms. (1669 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 16:04:04] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:04:04] [INFO ] Invariant cache hit.
[2024-05-23 16:04:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:04:05] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 16:04:05] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:04:05] [INFO ] [Real]Added 75 Read/Feed constraints in 29 ms returned sat
[2024-05-23 16:04:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:04:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-23 16:04:05] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2024-05-23 16:04:05] [INFO ] [Nat]Added 75 Read/Feed constraints in 54 ms returned sat
[2024-05-23 16:04:05] [INFO ] Deduced a trap composed of 74 places in 187 ms of which 3 ms to minimize.
[2024-05-23 16:04:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2024-05-23 16:04:05] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 353 transitions) in 109 ms.
[2024-05-23 16:04:06] [INFO ] Added : 8 causal constraints over 3 iterations in 320 ms. Result :sat
Minimization took 368 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 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 42 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 41 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-23 16:04:06] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:04:06] [INFO ] Invariant cache hit.
[2024-05-23 16:04:06] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-23 16:04:06] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:04:06] [INFO ] Invariant cache hit.
[2024-05-23 16:04:07] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:04:08] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 1703 ms to find 0 implicit places.
[2024-05-23 16:04:08] [INFO ] Redundant transitions in 22 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-23 16:04:08] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:04:08] [INFO ] Invariant cache hit.
[2024-05-23 16:04:08] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-23 16:04:21] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 33816ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 33827ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35603 ms. Remains : 420/420 places, 1216/1216 transitions.
[2024-05-23 16:04:42] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 16:04:42] [INFO ] Flatten gal took : 27 ms
RANDOM walk for 40000 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
[2024-05-23 16:04:42] [INFO ] Flatten gal took : 71 ms
BEST_FIRST walk for 30753 steps (6 resets) in 165 ms. (185 steps per ms) remains 0/1 properties
[2024-05-23 16:04:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10706116980033556986.gal : 3 ms
[2024-05-23 16:04:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6715782910559880399.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/ReachabilityCardinality10706116980033556986.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6715782910559880399.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 ...329
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-12 in 82221 ms.
[2024-05-23 16:04:42] [INFO ] Flatten gal took : 26 ms
[2024-05-23 16:04:42] [INFO ] Applying decomposition
[2024-05-23 16:04:42] [INFO ] Flatten gal took : 26 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/graph3999231370495171999.txt' '-o' '/tmp/graph3999231370495171999.bin' '-w' '/tmp/graph3999231370495171999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3999231370495171999.bin' '-l' '-1' '-v' '-w' '/tmp/graph3999231370495171999.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:04:42] [INFO ] Decomposing Gal with order
[2024-05-23 16:04:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:04:42] [INFO ] Removed a total of 2264 redundant transitions.
[2024-05-23 16:04:42] [INFO ] Flatten gal took : 45 ms
[2024-05-23 16:04:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 974 labels/synchronizations in 21 ms.
[2024-05-23 16:04:42] [INFO ] Time to serialize gal into /tmp/UpperBounds11571465256768567209.gal : 5 ms
[2024-05-23 16:04:42] [INFO ] Time to serialize properties into /tmp/UpperBounds17744507776581229686.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/UpperBounds11571465256768567209.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17744507776581229686.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/UpperBounds17744507776581229686.prop.
ITS-tools command line returned an error code 137
[2024-05-23 16:25:36] [INFO ] Flatten gal took : 28 ms
[2024-05-23 16:25:36] [INFO ] Time to serialize gal into /tmp/UpperBounds11570334699841920945.gal : 5 ms
[2024-05-23 16:25:36] [INFO ] Time to serialize properties into /tmp/UpperBounds12238151615544152482.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/UpperBounds11570334699841920945.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12238151615544152482.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/UpperBounds12238151615544152482.prop.
ITS-tools command line returned an error code 137
[2024-05-23 16:38:12] [INFO ] Flatten gal took : 38 ms
[2024-05-23 16:38:12] [INFO ] Input system was already deterministic with 1317 transitions.
[2024-05-23 16:38:12] [INFO ] Transformed 469 places.
[2024-05-23 16:38:12] [INFO ] Transformed 1317 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 16:38:12] [INFO ] Time to serialize gal into /tmp/UpperBounds7790613015637455915.gal : 5 ms
[2024-05-23 16:38:12] [INFO ] Time to serialize properties into /tmp/UpperBounds6206978264450838376.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/UpperBounds7790613015637455915.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6206978264450838376.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds6206978264450838376.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c004"
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-c004, 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-171640603100285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c004.tgz
mv FunctionPointer-PT-c004 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 ;