About the Execution of ITS-Tools for FunctionPointer-PT-c016
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10797.052 | 3600000.00 | 6775670.00 | 7050.10 | FF?FFFFFFFF??TTF | 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-171640603100300.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-c016, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603100300
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716484521184
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-23 17:15:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 17:15:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 17:15:22] [INFO ] Load time of PNML (sax parser for PT used): 382 ms
[2024-05-23 17:15:22] [INFO ] Transformed 2826 places.
[2024-05-23 17:15:22] [INFO ] Transformed 8960 transitions.
[2024-05-23 17:15:22] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 555 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1198 places in 38 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 310 place count 1318 transition count 3768
Iterating global reduction 1 with 293 rules applied. Total rules applied 603 place count 1318 transition count 3768
Ensure Unique test removed 410 transitions
Reduce isomorphic transitions removed 410 transitions.
Iterating post reduction 1 with 410 rules applied. Total rules applied 1013 place count 1318 transition count 3358
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 1165 place count 1166 transition count 3054
Iterating global reduction 2 with 152 rules applied. Total rules applied 1317 place count 1166 transition count 3054
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 1405 place count 1166 transition count 2966
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1418 place count 1153 transition count 2940
Iterating global reduction 3 with 13 rules applied. Total rules applied 1431 place count 1153 transition count 2940
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1444 place count 1140 transition count 2914
Iterating global reduction 3 with 13 rules applied. Total rules applied 1457 place count 1140 transition count 2914
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1470 place count 1127 transition count 2888
Iterating global reduction 3 with 13 rules applied. Total rules applied 1483 place count 1127 transition count 2888
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1496 place count 1114 transition count 2862
Iterating global reduction 3 with 13 rules applied. Total rules applied 1509 place count 1114 transition count 2862
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1522 place count 1101 transition count 2836
Iterating global reduction 3 with 13 rules applied. Total rules applied 1535 place count 1101 transition count 2836
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1547 place count 1089 transition count 2812
Iterating global reduction 3 with 12 rules applied. Total rules applied 1559 place count 1089 transition count 2812
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1571 place count 1077 transition count 2788
Iterating global reduction 3 with 12 rules applied. Total rules applied 1583 place count 1077 transition count 2788
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1632 place count 1028 transition count 2604
Iterating global reduction 3 with 49 rules applied. Total rules applied 1681 place count 1028 transition count 2604
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1734 place count 975 transition count 2392
Iterating global reduction 3 with 53 rules applied. Total rules applied 1787 place count 975 transition count 2392
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1840 place count 922 transition count 2264
Iterating global reduction 3 with 53 rules applied. Total rules applied 1893 place count 922 transition count 2264
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1945 place count 870 transition count 2160
Iterating global reduction 3 with 52 rules applied. Total rules applied 1997 place count 870 transition count 2160
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2048 place count 819 transition count 2058
Iterating global reduction 3 with 51 rules applied. Total rules applied 2099 place count 819 transition count 2058
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2150 place count 768 transition count 1956
Iterating global reduction 3 with 51 rules applied. Total rules applied 2201 place count 768 transition count 1956
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 2250 place count 719 transition count 1858
Iterating global reduction 3 with 49 rules applied. Total rules applied 2299 place count 719 transition count 1858
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2309 place count 709 transition count 1838
Iterating global reduction 3 with 10 rules applied. Total rules applied 2319 place count 709 transition count 1838
Applied a total of 2319 rules in 1240 ms. Remains 709 /1628 variables (removed 919) and now considering 1838/5962 (removed 4124) transitions.
[2024-05-23 17:15:24] [INFO ] Flow matrix only has 1236 transitions (discarded 602 similar events)
// Phase 1: matrix 1236 rows 709 cols
[2024-05-23 17:15:24] [INFO ] Computed 2 invariants in 40 ms
[2024-05-23 17:15:25] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-05-23 17:15:25] [INFO ] Flow matrix only has 1236 transitions (discarded 602 similar events)
[2024-05-23 17:15:25] [INFO ] Invariant cache hit.
[2024-05-23 17:15:25] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-23 17:15:27] [INFO ] Implicit Places using invariants and state equation in 2018 ms returned []
Implicit Place search using SMT with State Equation took 2691 ms to find 0 implicit places.
Running 1836 sub problems to find dead transitions.
[2024-05-23 17:15:27] [INFO ] Flow matrix only has 1236 transitions (discarded 602 similar events)
[2024-05-23 17:15:27] [INFO ] Invariant cache hit.
[2024-05-23 17:15:27] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/709 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/709 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1836 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 709/1945 variables, and 2 constraints, problems are : Problem set: 0 solved, 1836 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/709 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1836/1836 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1836 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/709 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/709 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/709 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 3 (OVERLAPS) 1236/1945 variables, 709/711 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1945 variables, 303/1014 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1945/1945 variables, and 2850 constraints, problems are : Problem set: 0 solved, 1836 unsolved in 31991 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 709/709 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 1836/1836 constraints, Known Traps: 0/0 constraints]
After SMT, in 71193ms problems are : Problem set: 0 solved, 1836 unsolved
Search for dead transitions found 0 dead transitions in 71228ms
Starting structural reductions in LTL mode, iteration 1 : 709/1628 places, 1838/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75191 ms. Remains : 709/1628 places, 1838/5962 transitions.
Support contains 23 out of 709 places after structural reductions.
[2024-05-23 17:16:38] [INFO ] Flatten gal took : 163 ms
[2024-05-23 17:16:38] [INFO ] Flatten gal took : 99 ms
[2024-05-23 17:16:38] [INFO ] Input system was already deterministic with 1838 transitions.
Support contains 22 out of 709 places (down from 23) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40019 steps (8 resets) in 3074 ms. (13 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 51 ms. (77 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
[2024-05-23 17:16:40] [INFO ] Flow matrix only has 1236 transitions (discarded 602 similar events)
[2024-05-23 17:16:40] [INFO ] Invariant cache hit.
[2024-05-23 17:16:40] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 382/401 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 25/426 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 954/1380 variables, 426/428 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1380 variables, 237/665 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1380 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 448/1828 variables, 185/850 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1828 variables, 66/916 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1828 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 116/1944 variables, 97/1013 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1944 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 1/1945 variables, 1/1014 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1945 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/1945 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1945/1945 variables, and 1014 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2882 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 709/709 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 382/401 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 25/426 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 954/1380 variables, 426/428 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1380 variables, 237/665 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1380 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 448/1828 variables, 185/850 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1828 variables, 66/916 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1828 variables, 15/931 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 17:16:45] [INFO ] Deduced a trap composed of 135 places in 204 ms of which 24 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1828 variables, 1/932 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1828 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 116/1944 variables, 97/1029 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1944 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 1/1945 variables, 1/1030 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1945/1945 variables, and 1030 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 709/709 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
After SMT, in 8050ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 706 transition count 1830
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 706 transition count 1830
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 706 transition count 1828
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 703 transition count 1822
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 703 transition count 1822
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 701 transition count 1816
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 701 transition count 1816
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 699 transition count 1810
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 699 transition count 1810
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 697 transition count 1806
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 697 transition count 1806
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 695 transition count 1802
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 695 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 694 transition count 1800
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 694 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 693 transition count 1798
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 693 transition count 1798
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 692 transition count 1796
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 692 transition count 1796
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 54 place count 692 transition count 1778
Applied a total of 54 rules in 460 ms. Remains 692 /709 variables (removed 17) and now considering 1778/1838 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 460 ms. Remains : 692/709 places, 1778/1838 transitions.
RANDOM walk for 40024 steps (8 resets) in 271 ms. (147 steps per ms) remains 13/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 79 ms. (500 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (11 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
[2024-05-23 17:16:48] [INFO ] Flow matrix only has 1196 transitions (discarded 582 similar events)
// Phase 1: matrix 1196 rows 692 cols
[2024-05-23 17:16:48] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 17:16:48] [INFO ] State equation strengthened by 295 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 22/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 613/646 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/646 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1001/1647 variables, 500/547 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1647 variables, 282/829 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1647 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 62/1709 variables, 1/830 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1709 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 167/1876 variables, 152/982 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1876 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 7/1883 variables, 4/986 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1883 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 5/1888 variables, 3/989 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1888 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/1888 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1888/1888 variables, and 989 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1778 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 692/692 constraints, ReadFeed: 295/295 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 22/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 613/646 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/646 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1001/1647 variables, 500/547 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1647 variables, 282/829 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1647 variables, 8/837 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1647 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 62/1709 variables, 1/838 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 17:16:52] [INFO ] Deduced a trap composed of 139 places in 146 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1709 variables, 1/839 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1709 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 167/1876 variables, 152/991 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1876 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 7/1883 variables, 4/995 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1883 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 5/1888 variables, 3/998 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1888 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/1888 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1888/1888 variables, and 998 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 692/692 constraints, ReadFeed: 295/295 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 6926ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 11 out of 692 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 692/692 places, 1778/1778 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 688 transition count 1770
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 688 transition count 1770
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 688 transition count 1768
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 686 transition count 1764
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 686 transition count 1764
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 684 transition count 1760
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 684 transition count 1760
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 682 transition count 1756
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 682 transition count 1756
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 681 transition count 1754
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 681 transition count 1754
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 680 transition count 1752
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 680 transition count 1752
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 679 transition count 1750
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 679 transition count 1750
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 678 transition count 1748
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 678 transition count 1748
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 676 transition count 1740
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 676 transition count 1740
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 674 transition count 1736
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 674 transition count 1736
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 672 transition count 1732
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 672 transition count 1732
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 670 transition count 1728
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 670 transition count 1728
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 668 transition count 1724
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 668 transition count 1724
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 666 transition count 1720
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 666 transition count 1720
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 664 transition count 1716
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 664 transition count 1716
Applied a total of 58 rules in 319 ms. Remains 664 /692 variables (removed 28) and now considering 1716/1778 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 664/692 places, 1716/1778 transitions.
RANDOM walk for 40037 steps (8 resets) in 182 ms. (218 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
[2024-05-23 17:16:56] [INFO ] Flow matrix only has 1150 transitions (discarded 566 similar events)
// Phase 1: matrix 1150 rows 664 cols
[2024-05-23 17:16:56] [INFO ] Computed 2 invariants in 18 ms
[2024-05-23 17:16:56] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 17/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 587/614 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 976/1590 variables, 487/525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1590 variables, 273/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1590 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 62/1652 variables, 1/799 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1652 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 159/1811 variables, 147/946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1811 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 3/1814 variables, 3/949 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1814 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/1814 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1814/1814 variables, and 949 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1401 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 664/664 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 17/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 587/614 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 976/1590 variables, 487/525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1590 variables, 273/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1590 variables, 7/805 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1590 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 62/1652 variables, 1/806 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 17:16:59] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1652 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1652 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 159/1811 variables, 147/954 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1811 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 3/1814 variables, 3/957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1814 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/1814 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1814/1814 variables, and 957 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3974 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 664/664 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 5443ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 5 properties in 3413 ms.
Support contains 3 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1716/1716 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 659 transition count 1706
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 659 transition count 1706
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 659 transition count 1704
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 654 transition count 1694
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 654 transition count 1694
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 649 transition count 1678
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 649 transition count 1678
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 644 transition count 1666
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 644 transition count 1666
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 640 transition count 1658
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 640 transition count 1658
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 636 transition count 1650
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 636 transition count 1650
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 632 transition count 1642
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 632 transition count 1642
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 628 transition count 1634
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 628 transition count 1634
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 624 transition count 1626
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 624 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 623 transition count 1624
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 623 transition count 1624
Applied a total of 84 rules in 227 ms. Remains 623 /664 variables (removed 41) and now considering 1624/1716 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 623/664 places, 1624/1716 transitions.
RANDOM walk for 40030 steps (8 resets) in 137 ms. (290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 285320 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 285320 steps, saw 185203 distinct states, run finished after 3014 ms. (steps per millisecond=94 ) properties seen :0
[2024-05-23 17:17:08] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2024-05-23 17:17:08] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 17:17:08] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1156/1498 variables, 478/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 268/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 62/1560 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1560 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1561 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1561 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1561 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 145/1706 variables, 139/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1706 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/1708 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1708 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1708 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1708/1708 variables, and 893 constraints, problems are : Problem set: 0 solved, 2 unsolved in 724 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1156/1498 variables, 478/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 268/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 2/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 62/1560 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1560 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1561 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1561 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1561 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 145/1706 variables, 139/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 17:17:10] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1706 variables, 1/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1706 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/1708 variables, 2/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1708 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1708 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 896 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1749 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2519ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 482 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 72 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 623/623 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 73 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-05-23 17:17:11] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-23 17:17:11] [INFO ] Invariant cache hit.
[2024-05-23 17:17:12] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-23 17:17:12] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-23 17:17:12] [INFO ] Invariant cache hit.
[2024-05-23 17:17:12] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 17:17:13] [INFO ] Implicit Places using invariants and state equation in 1726 ms returned []
Implicit Place search using SMT with State Equation took 2127 ms to find 0 implicit places.
[2024-05-23 17:17:13] [INFO ] Redundant transitions in 111 ms returned []
Running 1622 sub problems to find dead transitions.
[2024-05-23 17:17:14] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-23 17:17:14] [INFO ] Invariant cache hit.
[2024-05-23 17:17:14] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 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 623/1708 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1708 variables, 623/625 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1708 variables, 268/893 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 2515 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 31653 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
After SMT, in 69533ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 69551ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71876 ms. Remains : 623/623 places, 1624/1624 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 696 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 43 place count 685 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 54 place count 685 transition count 1782
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 675 transition count 1752
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 675 transition count 1752
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 664 transition count 1716
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 664 transition count 1716
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 105 place count 655 transition count 1694
Iterating global reduction 1 with 9 rules applied. Total rules applied 114 place count 655 transition count 1694
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 123 place count 646 transition count 1676
Iterating global reduction 1 with 9 rules applied. Total rules applied 132 place count 646 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 140 place count 638 transition count 1660
Iterating global reduction 1 with 8 rules applied. Total rules applied 148 place count 638 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 156 place count 630 transition count 1644
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 630 transition count 1644
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 172 place count 622 transition count 1626
Iterating global reduction 1 with 8 rules applied. Total rules applied 180 place count 622 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 183 place count 619 transition count 1618
Iterating global reduction 1 with 3 rules applied. Total rules applied 186 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 187 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 188 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 189 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 190 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 614 transition count 1608
Applied a total of 196 rules in 193 ms. Remains 614 /709 variables (removed 95) and now considering 1608/1838 (removed 230) transitions.
[2024-05-23 17:18:24] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 17:18:24] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 17:18:24] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-23 17:18:24] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:18:24] [INFO ] Invariant cache hit.
[2024-05-23 17:18:24] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:18:26] [INFO ] Implicit Places using invariants and state equation in 1705 ms returned []
Implicit Place search using SMT with State Equation took 2085 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 17:18:26] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:18:26] [INFO ] Invariant cache hit.
[2024-05-23 17:18:26] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69166ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69184ms
Starting structural reductions in LTL mode, iteration 1 : 614/709 places, 1608/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71474 ms. Remains : 614/709 places, 1608/1838 transitions.
Stuttering acceptance computed with spot in 308 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-02
Product exploration explored 100000 steps with 1 reset in 739 ms.
Product exploration explored 100000 steps with 0 reset in 525 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40008 steps (8 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 249942 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 3
Probabilistic random walk after 249942 steps, saw 162242 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2024-05-23 17:19:40] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:19:40] [INFO ] Invariant cache hit.
[2024-05-23 17:19:40] [INFO ] State equation strengthened by 265 read => feed constraints.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/738 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/739 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/739 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/740 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 141/1681 variables, 136/877 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1681 variables, 0/877 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/1686 variables, 3/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1686 variables, 0/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/1687 variables, 1/881 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1687/1687 variables, and 881 constraints, problems are : Problem set: 1 solved, 2 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 2/740 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/740 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/742 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/743 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/743 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 141/1681 variables, 136/879 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-23 17:19:42] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 1/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1681 variables, 0/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/1686 variables, 3/883 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1686 variables, 0/883 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1687 variables, 1/884 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1687 variables, 0/884 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1687 variables, 0/884 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 884 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1856 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 2697ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 349 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 159 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 614/614 places, 1604/1608 transitions.
RANDOM walk for 40006 steps (8 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 333219 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 2
Probabilistic random walk after 333219 steps, saw 216291 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-23 17:19:46] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 17:19:46] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 17:19:46] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/878 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 17:19:48] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/1685 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 884 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1720 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2477ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 379 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 81 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 69 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 17:19:49] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 17:19:49] [INFO ] Invariant cache hit.
[2024-05-23 17:19:50] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-23 17:19:50] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 17:19:50] [INFO ] Invariant cache hit.
[2024-05-23 17:19:50] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:19:51] [INFO ] Implicit Places using invariants and state equation in 1619 ms returned []
Implicit Place search using SMT with State Equation took 1997 ms to find 0 implicit places.
[2024-05-23 17:19:51] [INFO ] Redundant transitions in 26 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 17:19:51] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 17:19:51] [INFO ] Invariant cache hit.
[2024-05-23 17:19:51] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 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 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31463 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68971ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68989ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71094 ms. Remains : 614/614 places, 1604/1604 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 4 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 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 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
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 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
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 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 95 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-23 17:21:00] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 17:21:00] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 17:21:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 17:21:01] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-23 17:21:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 17:21:01] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 17:21:01] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 17:21:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 17:21:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 17:21:01] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 17:21:01] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 17:21:01] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 17:21:01] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 217 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 30 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 17:21:01] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 17:21:01] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 17:21:01] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-23 17:21:01] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:21:01] [INFO ] Invariant cache hit.
[2024-05-23 17:21:02] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:21:03] [INFO ] Implicit Places using invariants and state equation in 1737 ms returned []
Implicit Place search using SMT with State Equation took 2104 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 17:21:03] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:21:03] [INFO ] Invariant cache hit.
[2024-05-23 17:21:03] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69379ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69394ms
Finished structural reductions in LTL mode , in 1 iterations and 71539 ms. Remains : 614/614 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 40025 steps (8 resets) in 115 ms. (345 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 556082 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :0 out of 1
Probabilistic random walk after 556082 steps, saw 360931 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
[2024-05-23 17:22:16] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:22:16] [INFO ] Invariant cache hit.
[2024-05-23 17:22:16] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 141/1681 variables, 136/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1681 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1686 variables, 3/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1686 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1687 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1687/1687 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 141/1681 variables, 136/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:22:17] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1681 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1686 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1686 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1687 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1687 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1687 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1244 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1781ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 153 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 614/614 places, 1604/1608 transitions.
RANDOM walk for 40032 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 548778 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 548778 steps, saw 356190 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2024-05-23 17:22:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 17:22:21] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 17:22:21] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:22:22] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1685 variables, 2/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1685 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1685 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1222 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1797ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 72 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 70 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 17:22:23] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 17:22:23] [INFO ] Invariant cache hit.
[2024-05-23 17:22:23] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-23 17:22:23] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 17:22:23] [INFO ] Invariant cache hit.
[2024-05-23 17:22:24] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:22:25] [INFO ] Implicit Places using invariants and state equation in 1662 ms returned []
Implicit Place search using SMT with State Equation took 2029 ms to find 0 implicit places.
[2024-05-23 17:22:25] [INFO ] Redundant transitions in 88 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 17:22:25] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 17:22:25] [INFO ] Invariant cache hit.
[2024-05-23 17:22:25] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31571 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 70090ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 70105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72303 ms. Remains : 614/614 places, 1604/1604 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 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 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
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 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 31 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-23 17:23:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 17:23:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 17:23:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 17:23:35] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 17:23:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 17:23:35] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:23:35] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:23:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 17:23:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 17:23:35] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 17:23:35] [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 17:23:35] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 17:23:35] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 133 ms.
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4 reset in 447 ms.
Product exploration explored 100000 steps with 1 reset in 511 ms.
Built C files in :
/tmp/ltsmin5859541716954052400
[2024-05-23 17:23:37] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5859541716954052400
Running compilation step : cd /tmp/ltsmin5859541716954052400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5859541716954052400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5859541716954052400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 16 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 17:23:40] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 17:23:40] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 17:23:41] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-23 17:23:41] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:23:41] [INFO ] Invariant cache hit.
[2024-05-23 17:23:41] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:23:43] [INFO ] Implicit Places using invariants and state equation in 1762 ms returned []
Implicit Place search using SMT with State Equation took 2121 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 17:23:43] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:23:43] [INFO ] Invariant cache hit.
[2024-05-23 17:23:43] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31631 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69856ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69873ms
Finished structural reductions in LTL mode , in 1 iterations and 72016 ms. Remains : 614/614 places, 1608/1608 transitions.
Built C files in :
/tmp/ltsmin13478516310308293147
[2024-05-23 17:24:52] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13478516310308293147
Running compilation step : cd /tmp/ltsmin13478516310308293147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13478516310308293147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13478516310308293147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 17:24:56] [INFO ] Flatten gal took : 56 ms
[2024-05-23 17:24:56] [INFO ] Flatten gal took : 58 ms
[2024-05-23 17:24:56] [INFO ] Time to serialize gal into /tmp/LTL6858059592474636177.gal : 16 ms
[2024-05-23 17:24:56] [INFO ] Time to serialize properties into /tmp/LTL2326168065529924270.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6858059592474636177.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6563173916295525452.hoa' '-atoms' '/tmp/LTL2326168065529924270.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2326168065529924270.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6563173916295525452.hoa
Detected timeout of ITS tools.
[2024-05-23 17:25:11] [INFO ] Flatten gal took : 56 ms
[2024-05-23 17:25:11] [INFO ] Flatten gal took : 53 ms
[2024-05-23 17:25:11] [INFO ] Time to serialize gal into /tmp/LTL16183288150859282711.gal : 12 ms
[2024-05-23 17:25:11] [INFO ] Time to serialize properties into /tmp/LTL3499046918897970369.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16183288150859282711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3499046918897970369.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((s0<1)||(l2051<1))")||(X("((s0<1)||(l2051<1))")))))))
Formula 0 simplified : XXF(!"((s0<1)||(l2051<1))" & X!"((s0<1)||(l2051<1))")
Detected timeout of ITS tools.
[2024-05-23 17:25:26] [INFO ] Flatten gal took : 45 ms
[2024-05-23 17:25:26] [INFO ] Applying decomposition
[2024-05-23 17:25:26] [INFO ] Flatten gal took : 45 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/graph8665765672357181621.txt' '-o' '/tmp/graph8665765672357181621.bin' '-w' '/tmp/graph8665765672357181621.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8665765672357181621.bin' '-l' '-1' '-v' '-w' '/tmp/graph8665765672357181621.weights' '-q' '0' '-e' '0.001'
[2024-05-23 17:25:26] [INFO ] Decomposing Gal with order
[2024-05-23 17:25:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 17:25:26] [INFO ] Removed a total of 2672 redundant transitions.
[2024-05-23 17:25:27] [INFO ] Flatten gal took : 169 ms
[2024-05-23 17:25:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 1138 labels/synchronizations in 93 ms.
[2024-05-23 17:25:27] [INFO ] Time to serialize gal into /tmp/LTL17124840348161347667.gal : 15 ms
[2024-05-23 17:25:27] [INFO ] Time to serialize properties into /tmp/LTL16583621427033134615.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17124840348161347667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16583621427033134615.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((i0.u0.s0<1)||(i25.i3.u155.l2051<1))")||(X("((i0.u0.s0<1)||(i25.i3.u155.l2051<1))")))))))
Formula 0 simplified : XXF(!"((i0.u0.s0<1)||(i25.i3.u155.l2051<1))" & X!"((i0.u0.s0<1)||(i25.i3.u155.l2051<1))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c016-LTLFireability-02 finished in 438414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 697 transition count 1812
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 697 transition count 1812
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 30 place count 697 transition count 1806
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 687 transition count 1786
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 687 transition count 1786
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 59 place count 678 transition count 1758
Iterating global reduction 1 with 9 rules applied. Total rules applied 68 place count 678 transition count 1758
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 78 place count 668 transition count 1724
Iterating global reduction 1 with 10 rules applied. Total rules applied 88 place count 668 transition count 1724
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 97 place count 659 transition count 1702
Iterating global reduction 1 with 9 rules applied. Total rules applied 106 place count 659 transition count 1702
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 115 place count 650 transition count 1684
Iterating global reduction 1 with 9 rules applied. Total rules applied 124 place count 650 transition count 1684
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 132 place count 642 transition count 1668
Iterating global reduction 1 with 8 rules applied. Total rules applied 140 place count 642 transition count 1668
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 148 place count 634 transition count 1652
Iterating global reduction 1 with 8 rules applied. Total rules applied 156 place count 634 transition count 1652
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 164 place count 626 transition count 1634
Iterating global reduction 1 with 8 rules applied. Total rules applied 172 place count 626 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 175 place count 623 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 178 place count 623 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 622 transition count 1624
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 622 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 181 place count 621 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 182 place count 621 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 183 place count 620 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 184 place count 620 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 185 place count 619 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 186 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 187 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 188 place count 618 transition count 1616
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 192 place count 618 transition count 1612
Applied a total of 192 rules in 641 ms. Remains 618 /709 variables (removed 91) and now considering 1612/1838 (removed 226) transitions.
[2024-05-23 17:25:42] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
// Phase 1: matrix 1078 rows 618 cols
[2024-05-23 17:25:42] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 17:25:43] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-23 17:25:43] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 17:25:43] [INFO ] Invariant cache hit.
[2024-05-23 17:25:43] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 17:25:45] [INFO ] Implicit Places using invariants and state equation in 1770 ms returned []
Implicit Place search using SMT with State Equation took 2194 ms to find 0 implicit places.
[2024-05-23 17:25:45] [INFO ] Redundant transitions in 28 ms returned []
Running 1610 sub problems to find dead transitions.
[2024-05-23 17:25:45] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 17:25:45] [INFO ] Invariant cache hit.
[2024-05-23 17:25:45] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1696 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 268/888 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2498 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31601 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69813ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69829ms
Starting structural reductions in SI_LTL mode, iteration 1 : 618/709 places, 1612/1838 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72704 ms. Remains : 618/709 places, 1612/1838 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-04
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-04 finished in 72828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 696 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 43 place count 685 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 54 place count 685 transition count 1782
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 675 transition count 1750
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 675 transition count 1750
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 664 transition count 1712
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 664 transition count 1712
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 106 place count 654 transition count 1688
Iterating global reduction 1 with 10 rules applied. Total rules applied 116 place count 654 transition count 1688
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 126 place count 644 transition count 1668
Iterating global reduction 1 with 10 rules applied. Total rules applied 136 place count 644 transition count 1668
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 145 place count 635 transition count 1650
Iterating global reduction 1 with 9 rules applied. Total rules applied 154 place count 635 transition count 1650
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 163 place count 626 transition count 1632
Iterating global reduction 1 with 9 rules applied. Total rules applied 172 place count 626 transition count 1632
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 181 place count 617 transition count 1612
Iterating global reduction 1 with 9 rules applied. Total rules applied 190 place count 617 transition count 1612
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 193 place count 614 transition count 1604
Iterating global reduction 1 with 3 rules applied. Total rules applied 196 place count 614 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 613 transition count 1602
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 613 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 612 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 612 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 201 place count 611 transition count 1598
Iterating global reduction 1 with 1 rules applied. Total rules applied 202 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 203 place count 610 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 204 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 609 transition count 1594
Applied a total of 206 rules in 281 ms. Remains 609 /709 variables (removed 100) and now considering 1594/1838 (removed 244) transitions.
[2024-05-23 17:26:55] [INFO ] Flow matrix only has 1065 transitions (discarded 529 similar events)
// Phase 1: matrix 1065 rows 609 cols
[2024-05-23 17:26:55] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 17:26:55] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-23 17:26:55] [INFO ] Flow matrix only has 1065 transitions (discarded 529 similar events)
[2024-05-23 17:26:55] [INFO ] Invariant cache hit.
[2024-05-23 17:26:56] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:26:57] [INFO ] Implicit Places using invariants and state equation in 1935 ms returned []
Implicit Place search using SMT with State Equation took 2369 ms to find 0 implicit places.
Running 1592 sub problems to find dead transitions.
[2024-05-23 17:26:57] [INFO ] Flow matrix only has 1065 transitions (discarded 529 similar events)
[2024-05-23 17:26:57] [INFO ] Invariant cache hit.
[2024-05-23 17:26:57] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1592 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 609/1674 variables, and 2 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1592/1592 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 3 (OVERLAPS) 1065/1674 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1674 variables, 265/876 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1674/1674 variables, and 2468 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 31596 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1592/1592 constraints, Known Traps: 0/0 constraints]
After SMT, in 69819ms problems are : Problem set: 0 solved, 1592 unsolved
Search for dead transitions found 0 dead transitions in 69836ms
Starting structural reductions in LTL mode, iteration 1 : 609/709 places, 1594/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72494 ms. Remains : 609/709 places, 1594/1838 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-07 finished in 72696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&(p1||F(G(p2))))))))'
Support contains 5 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 697 transition count 1814
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 697 transition count 1814
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 30 place count 697 transition count 1808
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 687 transition count 1788
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 687 transition count 1788
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 59 place count 678 transition count 1760
Iterating global reduction 1 with 9 rules applied. Total rules applied 68 place count 678 transition count 1760
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 78 place count 668 transition count 1726
Iterating global reduction 1 with 10 rules applied. Total rules applied 88 place count 668 transition count 1726
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 96 place count 660 transition count 1706
Iterating global reduction 1 with 8 rules applied. Total rules applied 104 place count 660 transition count 1706
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 112 place count 652 transition count 1690
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 652 transition count 1690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 128 place count 644 transition count 1674
Iterating global reduction 1 with 8 rules applied. Total rules applied 136 place count 644 transition count 1674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 144 place count 636 transition count 1658
Iterating global reduction 1 with 8 rules applied. Total rules applied 152 place count 636 transition count 1658
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 160 place count 628 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 168 place count 628 transition count 1640
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 625 transition count 1632
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 625 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 624 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 624 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 623 transition count 1628
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 623 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 622 transition count 1626
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 622 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 181 place count 621 transition count 1624
Iterating global reduction 1 with 1 rules applied. Total rules applied 182 place count 621 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 183 place count 620 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 184 place count 620 transition count 1622
Applied a total of 184 rules in 240 ms. Remains 620 /709 variables (removed 89) and now considering 1622/1838 (removed 216) transitions.
[2024-05-23 17:28:08] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
// Phase 1: matrix 1084 rows 620 cols
[2024-05-23 17:28:08] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 17:28:08] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-23 17:28:08] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-23 17:28:08] [INFO ] Invariant cache hit.
[2024-05-23 17:28:08] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 17:28:10] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
Running 1620 sub problems to find dead transitions.
[2024-05-23 17:28:10] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-23 17:28:10] [INFO ] Invariant cache hit.
[2024-05-23 17:28:10] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 7.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1704 variables, and 2 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1620/1620 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1704 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1704 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1704/1704 variables, and 2510 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 31630 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1620/1620 constraints, Known Traps: 0/0 constraints]
After SMT, in 69915ms problems are : Problem set: 0 solved, 1620 unsolved
Search for dead transitions found 0 dead transitions in 69929ms
Starting structural reductions in LTL mode, iteration 1 : 620/709 places, 1622/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72182 ms. Remains : 620/709 places, 1622/1838 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-08
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-08 finished in 72494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 695 transition count 1808
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 695 transition count 1808
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 34 place count 695 transition count 1802
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 46 place count 683 transition count 1778
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 683 transition count 1778
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 69 place count 672 transition count 1744
Iterating global reduction 1 with 11 rules applied. Total rules applied 80 place count 672 transition count 1744
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 92 place count 660 transition count 1704
Iterating global reduction 1 with 12 rules applied. Total rules applied 104 place count 660 transition count 1704
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 114 place count 650 transition count 1680
Iterating global reduction 1 with 10 rules applied. Total rules applied 124 place count 650 transition count 1680
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 134 place count 640 transition count 1660
Iterating global reduction 1 with 10 rules applied. Total rules applied 144 place count 640 transition count 1660
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 153 place count 631 transition count 1642
Iterating global reduction 1 with 9 rules applied. Total rules applied 162 place count 631 transition count 1642
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 171 place count 622 transition count 1624
Iterating global reduction 1 with 9 rules applied. Total rules applied 180 place count 622 transition count 1624
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 189 place count 613 transition count 1604
Iterating global reduction 1 with 9 rules applied. Total rules applied 198 place count 613 transition count 1604
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 201 place count 610 transition count 1596
Iterating global reduction 1 with 3 rules applied. Total rules applied 204 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 207 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 208 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 209 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 210 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 211 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 212 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 213 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 214 place count 605 transition count 1586
Applied a total of 214 rules in 216 ms. Remains 605 /709 variables (removed 104) and now considering 1586/1838 (removed 252) transitions.
[2024-05-23 17:29:20] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-23 17:29:20] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 17:29:20] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-23 17:29:20] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 17:29:20] [INFO ] Invariant cache hit.
[2024-05-23 17:29:21] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 17:29:22] [INFO ] Implicit Places using invariants and state equation in 1661 ms returned []
Implicit Place search using SMT with State Equation took 2028 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2024-05-23 17:29:22] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 17:29:22] [INFO ] Invariant cache hit.
[2024-05-23 17:29:22] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1663 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1058/1663 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1663 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1663/1663 variables, and 2453 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 31438 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints]
After SMT, in 69192ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 69205ms
Starting structural reductions in LTL mode, iteration 1 : 605/709 places, 1586/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71453 ms. Remains : 605/709 places, 1586/1838 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-09
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-09 finished in 71557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((X(p0)&&G(p1))||X(G(p0)))))'
Support contains 4 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 696 transition count 1804
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 684 transition count 1780
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 684 transition count 1780
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 67 place count 673 transition count 1746
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 673 transition count 1746
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 90 place count 661 transition count 1706
Iterating global reduction 1 with 12 rules applied. Total rules applied 102 place count 661 transition count 1706
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 112 place count 651 transition count 1682
Iterating global reduction 1 with 10 rules applied. Total rules applied 122 place count 651 transition count 1682
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 132 place count 641 transition count 1662
Iterating global reduction 1 with 10 rules applied. Total rules applied 142 place count 641 transition count 1662
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 151 place count 632 transition count 1644
Iterating global reduction 1 with 9 rules applied. Total rules applied 160 place count 632 transition count 1644
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 169 place count 623 transition count 1626
Iterating global reduction 1 with 9 rules applied. Total rules applied 178 place count 623 transition count 1626
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 187 place count 614 transition count 1606
Iterating global reduction 1 with 9 rules applied. Total rules applied 196 place count 614 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 199 place count 611 transition count 1598
Iterating global reduction 1 with 3 rules applied. Total rules applied 202 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 203 place count 610 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 204 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 205 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 206 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 207 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 208 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 209 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 210 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 211 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 212 place count 606 transition count 1588
Applied a total of 212 rules in 220 ms. Remains 606 /709 variables (removed 103) and now considering 1588/1838 (removed 250) transitions.
[2024-05-23 17:30:32] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
// Phase 1: matrix 1061 rows 606 cols
[2024-05-23 17:30:32] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 17:30:32] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-23 17:30:32] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2024-05-23 17:30:32] [INFO ] Invariant cache hit.
[2024-05-23 17:30:32] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 17:30:33] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 1851 ms to find 0 implicit places.
Running 1586 sub problems to find dead transitions.
[2024-05-23 17:30:33] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2024-05-23 17:30:33] [INFO ] Invariant cache hit.
[2024-05-23 17:30:33] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/1667 variables, and 2 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/606 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1586/1586 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 3 (OVERLAPS) 1061/1667 variables, 606/608 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1667 variables, 264/872 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1667/1667 variables, and 2458 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 31636 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1586/1586 constraints, Known Traps: 0/0 constraints]
After SMT, in 69087ms problems are : Problem set: 0 solved, 1586 unsolved
Search for dead transitions found 0 dead transitions in 69101ms
Starting structural reductions in LTL mode, iteration 1 : 606/709 places, 1588/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71178 ms. Remains : 606/709 places, 1588/1838 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-10 finished in 71446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 696 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 43 place count 685 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 54 place count 685 transition count 1782
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 675 transition count 1750
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 675 transition count 1750
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 664 transition count 1712
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 664 transition count 1712
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 105 place count 655 transition count 1690
Iterating global reduction 1 with 9 rules applied. Total rules applied 114 place count 655 transition count 1690
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 123 place count 646 transition count 1672
Iterating global reduction 1 with 9 rules applied. Total rules applied 132 place count 646 transition count 1672
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 140 place count 638 transition count 1656
Iterating global reduction 1 with 8 rules applied. Total rules applied 148 place count 638 transition count 1656
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 156 place count 630 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 630 transition count 1640
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 172 place count 622 transition count 1624
Iterating global reduction 1 with 8 rules applied. Total rules applied 180 place count 622 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 182 place count 620 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 184 place count 620 transition count 1620
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 188 place count 620 transition count 1616
Applied a total of 188 rules in 382 ms. Remains 620 /709 variables (removed 89) and now considering 1616/1838 (removed 222) transitions.
[2024-05-23 17:31:43] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
// Phase 1: matrix 1079 rows 620 cols
[2024-05-23 17:31:43] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 17:31:44] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-23 17:31:44] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 17:31:44] [INFO ] Invariant cache hit.
[2024-05-23 17:31:44] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 17:31:45] [INFO ] Implicit Places using invariants and state equation in 1756 ms returned []
Implicit Place search using SMT with State Equation took 2138 ms to find 0 implicit places.
[2024-05-23 17:31:45] [INFO ] Redundant transitions in 31 ms returned []
Running 1614 sub problems to find dead transitions.
[2024-05-23 17:31:45] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 17:31:45] [INFO ] Invariant cache hit.
[2024-05-23 17:31:45] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 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 620/1699 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1699 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1699 variables, 266/888 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1699/1699 variables, and 2502 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 31567 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
After SMT, in 70049ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 70066ms
Starting structural reductions in SI_LTL mode, iteration 1 : 620/709 places, 1616/1838 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72631 ms. Remains : 620/709 places, 1616/1838 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-11
Product exploration explored 100000 steps with 8 reset in 471 ms.
Product exploration explored 100000 steps with 38 reset in 589 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30849 steps (6 resets) in 132 ms. (231 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Applied a total of 0 rules in 82 ms. Remains 620 /620 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
[2024-05-23 17:32:57] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 17:32:57] [INFO ] Invariant cache hit.
[2024-05-23 17:32:58] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-23 17:32:58] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 17:32:58] [INFO ] Invariant cache hit.
[2024-05-23 17:32:58] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 17:32:59] [INFO ] Implicit Places using invariants and state equation in 1745 ms returned []
Implicit Place search using SMT with State Equation took 2137 ms to find 0 implicit places.
[2024-05-23 17:32:59] [INFO ] Redundant transitions in 28 ms returned []
Running 1614 sub problems to find dead transitions.
[2024-05-23 17:32:59] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 17:32:59] [INFO ] Invariant cache hit.
[2024-05-23 17:32:59] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1699 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1699 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1699 variables, 266/888 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1699/1699 variables, and 2502 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 31592 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
After SMT, in 69999ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 70013ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72277 ms. Remains : 620/620 places, 1616/1616 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24183 steps (5 resets) in 80 ms. (298 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16 reset in 473 ms.
Product exploration explored 100000 steps with 9 reset in 509 ms.
Built C files in :
/tmp/ltsmin17188453517831565764
[2024-05-23 17:34:11] [INFO ] Too many transitions (1616) to apply POR reductions. Disabling POR matrices.
[2024-05-23 17:34:11] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17188453517831565764
Running compilation step : cd /tmp/ltsmin17188453517831565764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17188453517831565764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17188453517831565764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Applied a total of 0 rules in 94 ms. Remains 620 /620 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
[2024-05-23 17:34:14] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 17:34:14] [INFO ] Invariant cache hit.
[2024-05-23 17:34:15] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-23 17:34:15] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 17:34:15] [INFO ] Invariant cache hit.
[2024-05-23 17:34:15] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 17:34:16] [INFO ] Implicit Places using invariants and state equation in 1835 ms returned []
Implicit Place search using SMT with State Equation took 2286 ms to find 0 implicit places.
[2024-05-23 17:34:16] [INFO ] Redundant transitions in 30 ms returned []
Running 1614 sub problems to find dead transitions.
[2024-05-23 17:34:16] [INFO ] Flow matrix only has 1079 transitions (discarded 537 similar events)
[2024-05-23 17:34:16] [INFO ] Invariant cache hit.
[2024-05-23 17:34:17] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 5.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 0.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1699 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1699 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1699 variables, 266/888 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1699/1699 variables, and 2502 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 31682 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints]
After SMT, in 70190ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 70204ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72641 ms. Remains : 620/620 places, 1616/1616 transitions.
Built C files in :
/tmp/ltsmin7616287691845309175
[2024-05-23 17:35:27] [INFO ] Too many transitions (1616) to apply POR reductions. Disabling POR matrices.
[2024-05-23 17:35:27] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7616287691845309175
Running compilation step : cd /tmp/ltsmin7616287691845309175;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7616287691845309175;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7616287691845309175;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 17:35:30] [INFO ] Flatten gal took : 42 ms
[2024-05-23 17:35:30] [INFO ] Flatten gal took : 41 ms
[2024-05-23 17:35:30] [INFO ] Time to serialize gal into /tmp/LTL17113555543695431081.gal : 7 ms
[2024-05-23 17:35:30] [INFO ] Time to serialize properties into /tmp/LTL17119432090595085827.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17113555543695431081.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13638581790016621319.hoa' '-atoms' '/tmp/LTL17119432090595085827.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17119432090595085827.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13638581790016621319.hoa
Detected timeout of ITS tools.
[2024-05-23 17:35:45] [INFO ] Flatten gal took : 38 ms
[2024-05-23 17:35:45] [INFO ] Flatten gal took : 38 ms
[2024-05-23 17:35:45] [INFO ] Time to serialize gal into /tmp/LTL528985338409749924.gal : 7 ms
[2024-05-23 17:35:45] [INFO ] Time to serialize properties into /tmp/LTL9508540890085333528.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL528985338409749924.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9508540890085333528.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(p2439<1))"))))
Formula 0 simplified : FG!"((s1<1)||(p2439<1))"
Detected timeout of ITS tools.
[2024-05-23 17:36:00] [INFO ] Flatten gal took : 36 ms
[2024-05-23 17:36:00] [INFO ] Applying decomposition
[2024-05-23 17:36:00] [INFO ] Flatten gal took : 38 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/graph1162254852617214663.txt' '-o' '/tmp/graph1162254852617214663.bin' '-w' '/tmp/graph1162254852617214663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1162254852617214663.bin' '-l' '-1' '-v' '-w' '/tmp/graph1162254852617214663.weights' '-q' '0' '-e' '0.001'
[2024-05-23 17:36:00] [INFO ] Decomposing Gal with order
[2024-05-23 17:36:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 17:36:00] [INFO ] Removed a total of 2694 redundant transitions.
[2024-05-23 17:36:00] [INFO ] Flatten gal took : 75 ms
[2024-05-23 17:36:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 1106 labels/synchronizations in 65 ms.
[2024-05-23 17:36:00] [INFO ] Time to serialize gal into /tmp/LTL8164366935452012981.gal : 9 ms
[2024-05-23 17:36:00] [INFO ] Time to serialize properties into /tmp/LTL7624422812328809120.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8164366935452012981.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7624422812328809120.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i15.u1.s1<1)||(i25.i1.u154.p2439<1))"))))
Formula 0 simplified : FG!"((i15.u1.s1<1)||(i25.i1.u154.p2439<1))"
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c016-LTLFireability-11 finished in 272728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((G(p0)||p1))))))'
Support contains 3 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 696 transition count 1806
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 685 transition count 1784
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 685 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 675 transition count 1752
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 675 transition count 1752
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 665 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 665 transition count 1720
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 657 transition count 1704
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 657 transition count 1704
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 116 place count 649 transition count 1688
Iterating global reduction 1 with 8 rules applied. Total rules applied 124 place count 649 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 131 place count 642 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 138 place count 642 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 145 place count 635 transition count 1660
Iterating global reduction 1 with 7 rules applied. Total rules applied 152 place count 635 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 160 place count 627 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 168 place count 627 transition count 1640
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 170 place count 625 transition count 1632
Iterating global reduction 1 with 2 rules applied. Total rules applied 172 place count 625 transition count 1632
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 174 place count 623 transition count 1628
Iterating global reduction 1 with 2 rules applied. Total rules applied 176 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 178 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 180 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 182 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 184 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 186 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 188 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 190 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 192 place count 615 transition count 1612
Applied a total of 192 rules in 229 ms. Remains 615 /709 variables (removed 94) and now considering 1612/1838 (removed 226) transitions.
[2024-05-23 17:36:16] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 17:36:16] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 17:36:16] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-23 17:36:16] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:36:16] [INFO ] Invariant cache hit.
[2024-05-23 17:36:16] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:36:18] [INFO ] Implicit Places using invariants and state equation in 1651 ms returned []
Implicit Place search using SMT with State Equation took 2051 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 17:36:18] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:36:18] [INFO ] Invariant cache hit.
[2024-05-23 17:36:18] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31615 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69831ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69850ms
Starting structural reductions in LTL mode, iteration 1 : 615/709 places, 1612/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72137 ms. Remains : 615/709 places, 1612/1838 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-12
Product exploration explored 100000 steps with 33392 reset in 505 ms.
Product exploration explored 100000 steps with 33380 reset in 565 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40022 steps (8 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 160877 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 4
Probabilistic random walk after 160877 steps, saw 104441 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-23 17:37:32] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:37:32] [INFO ] Invariant cache hit.
[2024-05-23 17:37:32] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1541 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1541 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1542 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1542 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 140/1682 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1682 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 7/1689 variables, 4/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1689 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/1690 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1690/1690 variables, and 882 constraints, problems are : Problem set: 0 solved, 4 unsolved in 995 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1479 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1541 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1541 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1542 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1542 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 140/1682 variables, 135/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 17:37:35] [INFO ] Deduced a trap composed of 135 places in 140 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/1689 variables, 4/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1689 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/1690 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 887 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3193 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4223ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 458 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 615 transition count 1608
Applied a total of 4 rules in 156 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 615/615 places, 1608/1612 transitions.
RANDOM walk for 40015 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 523919 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 523919 steps, saw 340057 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-23 17:37:40] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-23 17:37:40] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 17:37:40] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 138/1678 variables, 134/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1678 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/1685 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1688 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1688/1688 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 138/1678 variables, 134/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:37:42] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1678 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1678 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/1685 variables, 4/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1688 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1688 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1688 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 884 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1313 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1828ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 78 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 78 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 17:37:42] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:37:42] [INFO ] Invariant cache hit.
[2024-05-23 17:37:43] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-23 17:37:43] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:37:43] [INFO ] Invariant cache hit.
[2024-05-23 17:37:43] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:37:45] [INFO ] Implicit Places using invariants and state equation in 1836 ms returned []
Implicit Place search using SMT with State Equation took 2215 ms to find 0 implicit places.
[2024-05-23 17:37:45] [INFO ] Redundant transitions in 31 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-23 17:37:45] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:37:45] [INFO ] Invariant cache hit.
[2024-05-23 17:37:45] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31696 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 70282ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 70298ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72631 ms. Remains : 615/615 places, 1608/1608 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 1 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 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 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
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 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 24 transition count 41
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 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
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 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 36 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 37 rows 22 cols
[2024-05-23 17:38:55] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 17:38:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 17:38:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 17:38:55] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 17:38:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 17:38:55] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:38:55] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:38:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 17:38:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 17:38:55] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 17:38:55] [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 17:38:55] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 17:38:55] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 136 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 196 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 19 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-23 17:38:56] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 17:38:56] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 17:38:56] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-23 17:38:56] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:38:56] [INFO ] Invariant cache hit.
[2024-05-23 17:38:56] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:38:58] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 17:38:58] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:38:58] [INFO ] Invariant cache hit.
[2024-05-23 17:38:58] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31661 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69651ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69666ms
Finished structural reductions in LTL mode , in 1 iterations and 71697 ms. Remains : 615/615 places, 1612/1612 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40022 steps (8 resets) in 727 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 162218 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 4
Probabilistic random walk after 162218 steps, saw 105310 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
[2024-05-23 17:40:11] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:40:11] [INFO ] Invariant cache hit.
[2024-05-23 17:40:11] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1541 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1541 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1542 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1542 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 140/1682 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1682 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 7/1689 variables, 4/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1689 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/1690 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1690/1690 variables, and 882 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1479 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1541 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1541 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1542 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1542 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 140/1682 variables, 135/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 17:40:13] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/1689 variables, 4/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1689 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/1690 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 887 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4084ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1339 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 615 transition count 1608
Applied a total of 4 rules in 161 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 615/615 places, 1608/1612 transitions.
RANDOM walk for 40003 steps (8 resets) in 473 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 157928 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 4
Probabilistic random walk after 157928 steps, saw 102526 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2024-05-23 17:40:20] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-23 17:40:20] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 17:40:20] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 138/1678 variables, 134/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1678 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 7/1685 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/1688 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1688/1688 variables, and 882 constraints, problems are : Problem set: 0 solved, 4 unsolved in 986 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 138/1678 variables, 134/880 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 17:40:22] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1678 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1678 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/1685 variables, 4/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/1688 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1688 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1688 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 887 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4063ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 1563 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 84 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 615/615 places, 1608/1608 transitions.
RANDOM walk for 40014 steps (8 resets) in 116 ms. (342 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 522144 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 522144 steps, saw 338903 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-05-23 17:40:28] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:40:28] [INFO ] Invariant cache hit.
[2024-05-23 17:40:28] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 138/1678 variables, 134/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1678 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/1685 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1688 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1688/1688 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 138/1678 variables, 134/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:40:30] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1678 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1678 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/1685 variables, 4/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1688 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1688 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1688 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 884 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1268 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1823ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 76 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 79 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 17:40:31] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:40:31] [INFO ] Invariant cache hit.
[2024-05-23 17:40:31] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-23 17:40:31] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:40:31] [INFO ] Invariant cache hit.
[2024-05-23 17:40:31] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:40:33] [INFO ] Implicit Places using invariants and state equation in 1857 ms returned []
Implicit Place search using SMT with State Equation took 2228 ms to find 0 implicit places.
[2024-05-23 17:40:33] [INFO ] Redundant transitions in 29 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-23 17:40:33] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:40:33] [INFO ] Invariant cache hit.
[2024-05-23 17:40:33] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31601 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69622ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69638ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71983 ms. Remains : 615/615 places, 1608/1608 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 0 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 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 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
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 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 24 transition count 41
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 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
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 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 30 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 37 rows 22 cols
[2024-05-23 17:41:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 17:41:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 17:41:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 17:41:43] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 17:41:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 17:41:43] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:41:43] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:41:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 17:41:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 17:41:43] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 17:41:43] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 17:41:43] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 17:41:43] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 121 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 211 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33356 reset in 529 ms.
Product exploration explored 100000 steps with 33337 reset in 527 ms.
Built C files in :
/tmp/ltsmin13709533736446578537
[2024-05-23 17:41:44] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13709533736446578537
Running compilation step : cd /tmp/ltsmin13709533736446578537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13709533736446578537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13709533736446578537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 18 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-23 17:41:47] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 17:41:47] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 17:41:48] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-23 17:41:48] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:41:48] [INFO ] Invariant cache hit.
[2024-05-23 17:41:48] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:41:49] [INFO ] Implicit Places using invariants and state equation in 1597 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 17:41:49] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:41:49] [INFO ] Invariant cache hit.
[2024-05-23 17:41:49] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31562 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 68835ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 68849ms
Finished structural reductions in LTL mode , in 1 iterations and 70839 ms. Remains : 615/615 places, 1612/1612 transitions.
Built C files in :
/tmp/ltsmin7191033104645249014
[2024-05-23 17:42:58] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7191033104645249014
Running compilation step : cd /tmp/ltsmin7191033104645249014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7191033104645249014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7191033104645249014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 17:43:01] [INFO ] Flatten gal took : 42 ms
[2024-05-23 17:43:01] [INFO ] Flatten gal took : 40 ms
[2024-05-23 17:43:01] [INFO ] Time to serialize gal into /tmp/LTL13569296517221877158.gal : 8 ms
[2024-05-23 17:43:01] [INFO ] Time to serialize properties into /tmp/LTL1940241104306841920.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13569296517221877158.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11878230799124582065.hoa' '-atoms' '/tmp/LTL1940241104306841920.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1940241104306841920.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11878230799124582065.hoa
Detected timeout of ITS tools.
[2024-05-23 17:43:17] [INFO ] Flatten gal took : 35 ms
[2024-05-23 17:43:17] [INFO ] Flatten gal took : 36 ms
[2024-05-23 17:43:17] [INFO ] Time to serialize gal into /tmp/LTL15089731835616420870.gal : 5 ms
[2024-05-23 17:43:17] [INFO ] Time to serialize properties into /tmp/LTL14591501747658763919.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15089731835616420870.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14591501747658763919.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((X(("((s0<1)||(l2128<1))")||(G("((s0<1)||(l753<1))"))))&&("((s0<1)||(l753<1))")))))
Formula 0 simplified : FG(!"((s0<1)||(l753<1))" | X(!"((s0<1)||(l2128<1))" & F!"((s0<1)||(l753<1))"))
Detected timeout of ITS tools.
[2024-05-23 17:43:32] [INFO ] Flatten gal took : 35 ms
[2024-05-23 17:43:32] [INFO ] Applying decomposition
[2024-05-23 17:43:32] [INFO ] Flatten gal took : 35 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/graph7076831778455421360.txt' '-o' '/tmp/graph7076831778455421360.bin' '-w' '/tmp/graph7076831778455421360.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7076831778455421360.bin' '-l' '-1' '-v' '-w' '/tmp/graph7076831778455421360.weights' '-q' '0' '-e' '0.001'
[2024-05-23 17:43:32] [INFO ] Decomposing Gal with order
[2024-05-23 17:43:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 17:43:32] [INFO ] Removed a total of 2685 redundant transitions.
[2024-05-23 17:43:32] [INFO ] Flatten gal took : 74 ms
[2024-05-23 17:43:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1198 labels/synchronizations in 49 ms.
[2024-05-23 17:43:32] [INFO ] Time to serialize gal into /tmp/LTL17462460351765268565.gal : 10 ms
[2024-05-23 17:43:32] [INFO ] Time to serialize properties into /tmp/LTL14864308609622627482.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17462460351765268565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14864308609622627482.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F((X(("((i0.u0.s0<1)||(i25.i2.u155.l2128<1))")||(G("((i0.u0.s0<1)||(i14.u100.l753<1))"))))&&("((i0.u0.s0<1)||(i14.u100.l753<1))")...159
Formula 0 simplified : FG(!"((i0.u0.s0<1)||(i14.u100.l753<1))" | X(!"((i0.u0.s0<1)||(i25.i2.u155.l2128<1))" & F!"((i0.u0.s0<1)||(i14.u100.l753<1))"))
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c016-LTLFireability-12 finished in 451538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 696 transition count 1806
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 42 place count 684 transition count 1782
Iterating global reduction 1 with 12 rules applied. Total rules applied 54 place count 684 transition count 1782
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 65 place count 673 transition count 1748
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 673 transition count 1748
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 88 place count 661 transition count 1708
Iterating global reduction 1 with 12 rules applied. Total rules applied 100 place count 661 transition count 1708
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 110 place count 651 transition count 1684
Iterating global reduction 1 with 10 rules applied. Total rules applied 120 place count 651 transition count 1684
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 130 place count 641 transition count 1664
Iterating global reduction 1 with 10 rules applied. Total rules applied 140 place count 641 transition count 1664
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 148 place count 633 transition count 1648
Iterating global reduction 1 with 8 rules applied. Total rules applied 156 place count 633 transition count 1648
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 164 place count 625 transition count 1632
Iterating global reduction 1 with 8 rules applied. Total rules applied 172 place count 625 transition count 1632
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 180 place count 617 transition count 1616
Iterating global reduction 1 with 8 rules applied. Total rules applied 188 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 190 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 192 place count 615 transition count 1612
Applied a total of 192 rules in 167 ms. Remains 615 /709 variables (removed 94) and now considering 1612/1838 (removed 226) transitions.
[2024-05-23 17:43:47] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 17:43:47] [INFO ] Computed 2 invariants in 18 ms
[2024-05-23 17:43:48] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-23 17:43:48] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:43:48] [INFO ] Invariant cache hit.
[2024-05-23 17:43:48] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:43:49] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 17:43:49] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:43:49] [INFO ] Invariant cache hit.
[2024-05-23 17:43:49] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31606 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69579ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69594ms
Starting structural reductions in LTL mode, iteration 1 : 615/709 places, 1612/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71777 ms. Remains : 615/709 places, 1612/1838 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 573 ms.
Product exploration explored 100000 steps with 33333 reset in 503 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLFireability-13 finished in 73020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1)&&X((p2&&X(p3))))))'
Support contains 6 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 698 transition count 1814
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 698 transition count 1814
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 698 transition count 1810
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 689 transition count 1792
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 689 transition count 1792
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 680 transition count 1766
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 680 transition count 1766
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 72 place count 670 transition count 1734
Iterating global reduction 1 with 10 rules applied. Total rules applied 82 place count 670 transition count 1734
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 90 place count 662 transition count 1714
Iterating global reduction 1 with 8 rules applied. Total rules applied 98 place count 662 transition count 1714
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 106 place count 654 transition count 1698
Iterating global reduction 1 with 8 rules applied. Total rules applied 114 place count 654 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 121 place count 647 transition count 1684
Iterating global reduction 1 with 7 rules applied. Total rules applied 128 place count 647 transition count 1684
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 135 place count 640 transition count 1670
Iterating global reduction 1 with 7 rules applied. Total rules applied 142 place count 640 transition count 1670
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 149 place count 633 transition count 1654
Iterating global reduction 1 with 7 rules applied. Total rules applied 156 place count 633 transition count 1654
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 159 place count 630 transition count 1646
Iterating global reduction 1 with 3 rules applied. Total rules applied 162 place count 630 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 629 transition count 1644
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 629 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 628 transition count 1642
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 628 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 167 place count 627 transition count 1640
Iterating global reduction 1 with 1 rules applied. Total rules applied 168 place count 627 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 626 transition count 1638
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 626 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 625 transition count 1636
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 625 transition count 1636
Applied a total of 172 rules in 223 ms. Remains 625 /709 variables (removed 84) and now considering 1636/1838 (removed 202) transitions.
[2024-05-23 17:45:00] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
// Phase 1: matrix 1093 rows 625 cols
[2024-05-23 17:45:00] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 17:45:01] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-23 17:45:01] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-23 17:45:01] [INFO ] Invariant cache hit.
[2024-05-23 17:45:01] [INFO ] State equation strengthened by 270 read => feed constraints.
[2024-05-23 17:45:02] [INFO ] Implicit Places using invariants and state equation in 1521 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
Running 1634 sub problems to find dead transitions.
[2024-05-23 17:45:02] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-23 17:45:02] [INFO ] Invariant cache hit.
[2024-05-23 17:45:02] [INFO ] State equation strengthened by 270 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/1718 variables, and 2 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/625 constraints, ReadFeed: 0/270 constraints, PredecessorRefiner: 1634/1634 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 3 (OVERLAPS) 1093/1718 variables, 625/627 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1718 variables, 270/897 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 2531 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 31685 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 625/625 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 1634/1634 constraints, Known Traps: 0/0 constraints]
After SMT, in 70025ms problems are : Problem set: 0 solved, 1634 unsolved
Search for dead transitions found 0 dead transitions in 70043ms
Starting structural reductions in LTL mode, iteration 1 : 625/709 places, 1636/1838 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72098 ms. Remains : 625/709 places, 1636/1838 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, (OR (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (NOT p1), (OR (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-15
Product exploration explored 100000 steps with 1 reset in 584 ms.
Product exploration explored 100000 steps with 4 reset in 563 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 72 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p1), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40021 steps (8 resets) in 190 ms. (209 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2024-05-23 17:46:14] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-23 17:46:14] [INFO ] Invariant cache hit.
[2024-05-23 17:46:14] [INFO ] State equation strengthened by 270 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 338/340 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1160/1500 variables, 477/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1500 variables, 270/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1500 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1562 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1562 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1563 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1563 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1563 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 148/1711 variables, 140/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1711 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/1717 variables, 4/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1717 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1718 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1718 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1718 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1718/1718 variables, and 897 constraints, problems are : Problem set: 0 solved, 1 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 625/625 constraints, ReadFeed: 270/270 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 338/340 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1160/1500 variables, 477/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1500 variables, 270/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1500 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1500 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1562 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1562 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1563 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1563 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1563 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 148/1711 variables, 140/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:46:15] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1711 variables, 1/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1711 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1717 variables, 4/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1717 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1718 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1718 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1718 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 625/625 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1617ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 2 out of 625 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 625/625 places, 1636/1636 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 623 transition count 1632
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 623 transition count 1632
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 623 transition count 1630
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 621 transition count 1626
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 621 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 620 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 620 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 619 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 614 transition count 1604
Applied a total of 28 rules in 295 ms. Remains 614 /625 variables (removed 11) and now considering 1604/1636 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 614/625 places, 1604/1636 transitions.
RANDOM walk for 40041 steps (8 resets) in 117 ms. (339 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
Interrupted probabilistic random walk after 502167 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 502167 steps, saw 325938 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2024-05-23 17:46:19] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 17:46:19] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 17:46:19] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:46:20] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1685 variables, 2/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1685 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1685 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1678ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 86 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 81 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 17:46:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 17:46:21] [INFO ] Invariant cache hit.
[2024-05-23 17:46:21] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-23 17:46:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 17:46:21] [INFO ] Invariant cache hit.
[2024-05-23 17:46:22] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:46:23] [INFO ] Implicit Places using invariants and state equation in 1686 ms returned []
Implicit Place search using SMT with State Equation took 2049 ms to find 0 implicit places.
[2024-05-23 17:46:23] [INFO ] Redundant transitions in 28 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 17:46:23] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 17:46:23] [INFO ] Invariant cache hit.
[2024-05-23 17:46:23] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 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 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31420 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 69044ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 69058ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71228 ms. Remains : 614/614 places, 1604/1604 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 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 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
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 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
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 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 40 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-23 17:47:32] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 17:47:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 17:47:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 17:47:32] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 17:47:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 17:47:32] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:47:32] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:47:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 17:47:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 17:47:32] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 17:47:32] [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 17:47:32] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 17:47:32] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 115 ms.
Knowledge obtained : [(AND p1 p0 p2 p3), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p3))), (F (NOT (AND p1 p3)))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 9 factoid took 119 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLFireability-15 finished in 152299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c016-LTLFireability-02
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 696 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 43 place count 685 transition count 1782
Iterating global reduction 1 with 11 rules applied. Total rules applied 54 place count 685 transition count 1782
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 675 transition count 1752
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 675 transition count 1752
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 85 place count 664 transition count 1716
Iterating global reduction 1 with 11 rules applied. Total rules applied 96 place count 664 transition count 1716
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 105 place count 655 transition count 1694
Iterating global reduction 1 with 9 rules applied. Total rules applied 114 place count 655 transition count 1694
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 123 place count 646 transition count 1676
Iterating global reduction 1 with 9 rules applied. Total rules applied 132 place count 646 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 140 place count 638 transition count 1660
Iterating global reduction 1 with 8 rules applied. Total rules applied 148 place count 638 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 156 place count 630 transition count 1644
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 630 transition count 1644
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 172 place count 622 transition count 1626
Iterating global reduction 1 with 8 rules applied. Total rules applied 180 place count 622 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 183 place count 619 transition count 1618
Iterating global reduction 1 with 3 rules applied. Total rules applied 186 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 187 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 188 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 189 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 190 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 614 transition count 1608
Applied a total of 196 rules in 282 ms. Remains 614 /709 variables (removed 95) and now considering 1608/1838 (removed 230) transitions.
[2024-05-23 17:47:33] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 17:47:33] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 17:47:33] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-23 17:47:33] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:47:33] [INFO ] Invariant cache hit.
[2024-05-23 17:47:34] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:47:35] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 2079 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 17:47:35] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:47:35] [INFO ] Invariant cache hit.
[2024-05-23 17:47:35] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31631 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69727ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69745ms
Starting structural reductions in LI_LTL mode, iteration 1 : 614/709 places, 1608/1838 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 72111 ms. Remains : 614/709 places, 1608/1838 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-02
Product exploration explored 100000 steps with 1 reset in 483 ms.
Product exploration explored 100000 steps with 1 reset in 497 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40016 steps (8 resets) in 390 ms. (102 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 187744 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 3
Probabilistic random walk after 187744 steps, saw 121878 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-23 17:48:49] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:48:49] [INFO ] Invariant cache hit.
[2024-05-23 17:48:49] [INFO ] State equation strengthened by 265 read => feed constraints.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/738 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/739 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/739 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/740 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 141/1681 variables, 136/877 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1681 variables, 0/877 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/1686 variables, 3/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1686 variables, 0/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/1687 variables, 1/881 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1687/1687 variables, and 881 constraints, problems are : Problem set: 1 solved, 2 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 2/740 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/740 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/741 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/742 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/743 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/743 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 141/1681 variables, 136/879 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-23 17:48:51] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 1/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1681 variables, 0/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/1686 variables, 3/883 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1686 variables, 0/883 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1687 variables, 1/884 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1687 variables, 0/884 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1687 variables, 0/884 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 884 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1899 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 2625ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 364 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 158 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 614/614 places, 1604/1608 transitions.
RANDOM walk for 40016 steps (8 resets) in 302 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 265109 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 2
Probabilistic random walk after 265109 steps, saw 172086 distinct states, run finished after 3004 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-23 17:48:56] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 17:48:56] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 17:48:56] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/878 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 17:48:57] [INFO ] Deduced a trap composed of 135 places in 141 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/1685 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 884 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1688 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2396ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 404 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 82 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 83 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 17:48:59] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 17:48:59] [INFO ] Invariant cache hit.
[2024-05-23 17:48:59] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-23 17:48:59] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 17:48:59] [INFO ] Invariant cache hit.
[2024-05-23 17:48:59] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:49:01] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2114 ms to find 0 implicit places.
[2024-05-23 17:49:01] [INFO ] Redundant transitions in 30 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 17:49:01] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 17:49:01] [INFO ] Invariant cache hit.
[2024-05-23 17:49:01] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 5.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 1.0)
(s507 1.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)timeout
(s519 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31613 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 70289ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 70304ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72542 ms. Remains : 614/614 places, 1604/1604 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 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 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
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 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
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 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 35 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-23 17:50:11] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 17:50:11] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 17:50:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 17:50:11] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-23 17:50:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 17:50:11] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 17:50:11] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 17:50:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 17:50:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 17:50:11] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 17:50:11] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 17:50:11] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 17:50:11] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 147 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 18 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 17:50:12] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 17:50:12] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 17:50:12] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-23 17:50:12] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:50:12] [INFO ] Invariant cache hit.
[2024-05-23 17:50:12] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:50:14] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2123 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 17:50:14] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:50:14] [INFO ] Invariant cache hit.
[2024-05-23 17:50:14] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 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 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31667 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69266ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69280ms
Finished structural reductions in LTL mode , in 1 iterations and 71425 ms. Remains : 614/614 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 40008 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 537855 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 1
Probabilistic random walk after 537855 steps, saw 349101 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
[2024-05-23 17:51:26] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:51:26] [INFO ] Invariant cache hit.
[2024-05-23 17:51:26] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 141/1681 variables, 136/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1681 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1686 variables, 3/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1686 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1687 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1687/1687 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1141/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 141/1681 variables, 136/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:51:28] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1681 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1686 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1686 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1687 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1687 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1687 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1261 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1825ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 144 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 614/614 places, 1604/1608 transitions.
RANDOM walk for 40020 steps (8 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 565222 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 1
Probabilistic random walk after 565222 steps, saw 366860 distinct states, run finished after 3002 ms. (steps per millisecond=188 ) properties seen :0
[2024-05-23 17:51:31] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 17:51:31] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 17:51:32] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:51:33] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1685 variables, 2/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1685 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1685 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1238 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1781ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 71 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 70 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 17:51:33] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 17:51:33] [INFO ] Invariant cache hit.
[2024-05-23 17:51:34] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-23 17:51:34] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 17:51:34] [INFO ] Invariant cache hit.
[2024-05-23 17:51:34] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:51:36] [INFO ] Implicit Places using invariants and state equation in 1682 ms returned []
Implicit Place search using SMT with State Equation took 2045 ms to find 0 implicit places.
[2024-05-23 17:51:36] [INFO ] Redundant transitions in 30 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 17:51:36] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 17:51:36] [INFO ] Invariant cache hit.
[2024-05-23 17:51:36] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31393 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68435ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68448ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70606 ms. Remains : 614/614 places, 1604/1604 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 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 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
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 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
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 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 29 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-23 17:52:44] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 17:52:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 17:52:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 17:52:44] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 17:52:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 17:52:44] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:52:44] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:52:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 17:52:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 17:52:44] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 17:52:44] [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 17:52:44] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 17:52:44] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 111 ms.
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 434 ms.
Product exploration explored 100000 steps with 0 reset in 534 ms.
Built C files in :
/tmp/ltsmin17765622879921465877
[2024-05-23 17:52:46] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17765622879921465877
Running compilation step : cd /tmp/ltsmin17765622879921465877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17765622879921465877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17765622879921465877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 21 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 17:52:49] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 17:52:49] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 17:52:49] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-23 17:52:49] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:52:49] [INFO ] Invariant cache hit.
[2024-05-23 17:52:50] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:52:51] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 2162 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 17:52:51] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:52:51] [INFO ] Invariant cache hit.
[2024-05-23 17:52:51] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31475 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 68947ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 68963ms
Finished structural reductions in LTL mode , in 1 iterations and 71152 ms. Remains : 614/614 places, 1608/1608 transitions.
Built C files in :
/tmp/ltsmin16100498191557478896
[2024-05-23 17:54:00] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16100498191557478896
Running compilation step : cd /tmp/ltsmin16100498191557478896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16100498191557478896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16100498191557478896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 17:54:03] [INFO ] Flatten gal took : 50 ms
[2024-05-23 17:54:03] [INFO ] Flatten gal took : 31 ms
[2024-05-23 17:54:03] [INFO ] Time to serialize gal into /tmp/LTL9219888527898865660.gal : 8 ms
[2024-05-23 17:54:03] [INFO ] Time to serialize properties into /tmp/LTL3828003908883584331.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9219888527898865660.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4620171353993707179.hoa' '-atoms' '/tmp/LTL3828003908883584331.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3828003908883584331.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4620171353993707179.hoa
Detected timeout of ITS tools.
[2024-05-23 17:54:18] [INFO ] Flatten gal took : 32 ms
[2024-05-23 17:54:18] [INFO ] Flatten gal took : 72 ms
[2024-05-23 17:54:18] [INFO ] Time to serialize gal into /tmp/LTL13152348710942999765.gal : 5 ms
[2024-05-23 17:54:18] [INFO ] Time to serialize properties into /tmp/LTL17609655612521576950.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13152348710942999765.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17609655612521576950.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((s0<1)||(l2051<1))")||(X("((s0<1)||(l2051<1))")))))))
Formula 0 simplified : XXF(!"((s0<1)||(l2051<1))" & X!"((s0<1)||(l2051<1))")
Detected timeout of ITS tools.
[2024-05-23 17:54:33] [INFO ] Flatten gal took : 33 ms
[2024-05-23 17:54:33] [INFO ] Applying decomposition
[2024-05-23 17:54:34] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1973396460475736550.txt' '-o' '/tmp/graph1973396460475736550.bin' '-w' '/tmp/graph1973396460475736550.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1973396460475736550.bin' '-l' '-1' '-v' '-w' '/tmp/graph1973396460475736550.weights' '-q' '0' '-e' '0.001'
[2024-05-23 17:54:34] [INFO ] Decomposing Gal with order
[2024-05-23 17:54:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 17:54:34] [INFO ] Removed a total of 2666 redundant transitions.
[2024-05-23 17:54:34] [INFO ] Flatten gal took : 130 ms
[2024-05-23 17:54:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1127 labels/synchronizations in 64 ms.
[2024-05-23 17:54:34] [INFO ] Time to serialize gal into /tmp/LTL12615937023788963432.gal : 22 ms
[2024-05-23 17:54:34] [INFO ] Time to serialize properties into /tmp/LTL9395692581815858907.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12615937023788963432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9395692581815858907.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((i1.u1.s0<1)||(i26.i2.u148.l2051<1))")||(X("((i1.u1.s0<1)||(i26.i2.u148.l2051<1))")))))))
Formula 0 simplified : XXF(!"((i1.u1.s0<1)||(i26.i2.u148.l2051<1))" & X!"((i1.u1.s0<1)||(i26.i2.u148.l2051<1))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c016-LTLFireability-02 finished in 436660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((G(p0)||p1))))))'
Found a Shortening insensitive property : FunctionPointer-PT-c016-LTLFireability-12
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 709 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 709/709 places, 1838/1838 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 696 transition count 1810
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 696 transition count 1810
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 696 transition count 1806
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 685 transition count 1784
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 685 transition count 1784
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 675 transition count 1752
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 675 transition count 1752
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 665 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 665 transition count 1720
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 657 transition count 1704
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 657 transition count 1704
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 116 place count 649 transition count 1688
Iterating global reduction 1 with 8 rules applied. Total rules applied 124 place count 649 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 131 place count 642 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 138 place count 642 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 145 place count 635 transition count 1660
Iterating global reduction 1 with 7 rules applied. Total rules applied 152 place count 635 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 160 place count 627 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 168 place count 627 transition count 1640
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 170 place count 625 transition count 1632
Iterating global reduction 1 with 2 rules applied. Total rules applied 172 place count 625 transition count 1632
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 174 place count 623 transition count 1628
Iterating global reduction 1 with 2 rules applied. Total rules applied 176 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 178 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 180 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 182 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 184 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 186 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 188 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 190 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 192 place count 615 transition count 1612
Applied a total of 192 rules in 265 ms. Remains 615 /709 variables (removed 94) and now considering 1612/1838 (removed 226) transitions.
[2024-05-23 17:54:50] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 17:54:50] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 17:54:50] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-23 17:54:50] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:54:50] [INFO ] Invariant cache hit.
[2024-05-23 17:54:50] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:54:51] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 17:54:52] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:54:52] [INFO ] Invariant cache hit.
[2024-05-23 17:54:52] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)timeout
(s239 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31463 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69873ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69888ms
Starting structural reductions in LI_LTL mode, iteration 1 : 615/709 places, 1612/1838 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 72102 ms. Remains : 615/709 places, 1612/1838 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-12
Product exploration explored 100000 steps with 33361 reset in 502 ms.
Product exploration explored 100000 steps with 33175 reset in 507 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40008 steps (8 resets) in 155 ms. (256 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 109839 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 4
Probabilistic random walk after 109839 steps, saw 71317 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-23 17:56:06] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:56:06] [INFO ] Invariant cache hit.
[2024-05-23 17:56:06] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1541 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1541 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1542 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1542 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 140/1682 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1682 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 7/1689 variables, 4/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1689 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/1690 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1690/1690 variables, and 882 constraints, problems are : Problem set: 0 solved, 4 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1479 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1541 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1541 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1542 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1542 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 140/1682 variables, 135/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 17:56:08] [INFO ] Deduced a trap composed of 135 places in 156 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/1689 variables, 4/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1689 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/1690 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 887 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2740 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 3738ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 1408 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 615 transition count 1608
Applied a total of 4 rules in 150 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 615/615 places, 1608/1612 transitions.
RANDOM walk for 40001 steps (8 resets) in 358 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 163342 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 3
Probabilistic random walk after 163342 steps, saw 106040 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :0
[2024-05-23 17:56:14] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-23 17:56:14] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 17:56:14] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 138/1678 variables, 134/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1678 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 7/1685 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 3/1688 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1688/1688 variables, and 882 constraints, problems are : Problem set: 0 solved, 3 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 3/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 138/1678 variables, 134/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 17:56:16] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1678 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1678 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 7/1685 variables, 4/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 3/1688 variables, 2/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1688 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1688 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 886 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3058ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1581 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 72 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 99 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 17:56:19] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:56:19] [INFO ] Invariant cache hit.
[2024-05-23 17:56:20] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-23 17:56:20] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:56:20] [INFO ] Invariant cache hit.
[2024-05-23 17:56:20] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:56:21] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 2124 ms to find 0 implicit places.
[2024-05-23 17:56:21] [INFO ] Redundant transitions in 24 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-23 17:56:21] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:56:21] [INFO ] Invariant cache hit.
[2024-05-23 17:56:21] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31422 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69897ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69910ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72164 ms. Remains : 615/615 places, 1608/1608 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 0 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 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 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
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 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 24 transition count 41
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 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
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 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 30 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2024-05-23 17:57:31] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 17:57:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 17:57:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 17:57:31] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-23 17:57:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 17:57:31] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 17:57:31] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 17:57:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 17:57:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 17:57:31] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 17:57:31] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 17:57:31] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 17:57:31] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 152 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 146 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 12 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-23 17:57:32] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 17:57:32] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 17:57:32] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-23 17:57:32] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:57:32] [INFO ] Invariant cache hit.
[2024-05-23 17:57:32] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:57:34] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 1952 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 17:57:34] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:57:34] [INFO ] Invariant cache hit.
[2024-05-23 17:57:34] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31613 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69387ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69402ms
Finished structural reductions in LTL mode , in 1 iterations and 71372 ms. Remains : 615/615 places, 1612/1612 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 135 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40004 steps (8 resets) in 611 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 131343 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 4
Probabilistic random walk after 131343 steps, saw 85272 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-23 17:58:47] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 17:58:47] [INFO ] Invariant cache hit.
[2024-05-23 17:58:47] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1541 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1541 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1542 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1542 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 140/1682 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1682 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 7/1689 variables, 4/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1689 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/1690 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1690 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1690/1690 variables, and 882 constraints, problems are : Problem set: 0 solved, 4 unsolved in 889 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1479 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1479 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1479 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1479 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1541 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1541 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1542 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1542 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 140/1682 variables, 135/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 17:58:49] [INFO ] Deduced a trap composed of 135 places in 130 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/1689 variables, 4/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1689 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/1690 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1690 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 887 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2694 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 3629ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 1280 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 615 transition count 1608
Applied a total of 4 rules in 148 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 615/615 places, 1608/1612 transitions.
RANDOM walk for 40026 steps (8 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 561900 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 561900 steps, saw 364704 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
[2024-05-23 17:58:55] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-23 17:58:55] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 17:58:55] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 138/1678 variables, 134/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1678 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/1685 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1688 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1688 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1688/1688 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 336/339 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1138/1477 variables, 471/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 138/1678 variables, 134/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:58:56] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1678 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1678 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/1685 variables, 4/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1688 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1688 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1688 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 884 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1126 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1605ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 74 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 73 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 17:58:57] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:58:57] [INFO ] Invariant cache hit.
[2024-05-23 17:58:57] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-23 17:58:57] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:58:57] [INFO ] Invariant cache hit.
[2024-05-23 17:58:58] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 17:58:59] [INFO ] Implicit Places using invariants and state equation in 1790 ms returned []
Implicit Place search using SMT with State Equation took 2145 ms to find 0 implicit places.
[2024-05-23 17:58:59] [INFO ] Redundant transitions in 29 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-23 17:58:59] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 17:58:59] [INFO ] Invariant cache hit.
[2024-05-23 17:58:59] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31544 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69464ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69481ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71745 ms. Remains : 615/615 places, 1608/1608 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 1 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 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 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
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 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 24 transition count 41
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 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
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 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 59 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 37 rows 22 cols
[2024-05-23 18:00:09] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 18:00:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 18:00:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 18:00:09] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 18:00:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 18:00:09] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:00:09] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:00:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 18:00:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 18:00:09] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:00:09] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:00:09] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:00:09] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 146 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 202 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33297 reset in 504 ms.
Product exploration explored 100000 steps with 33475 reset in 503 ms.
Built C files in :
/tmp/ltsmin2694065422711082300
[2024-05-23 18:00:11] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2694065422711082300
Running compilation step : cd /tmp/ltsmin2694065422711082300;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2694065422711082300;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2694065422711082300;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 19 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-23 18:00:14] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 18:00:14] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 18:00:14] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-23 18:00:14] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 18:00:14] [INFO ] Invariant cache hit.
[2024-05-23 18:00:14] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 18:00:16] [INFO ] Implicit Places using invariants and state equation in 1644 ms returned []
Implicit Place search using SMT with State Equation took 2025 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 18:00:16] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 18:00:16] [INFO ] Invariant cache hit.
[2024-05-23 18:00:16] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31510 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69869ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69887ms
Finished structural reductions in LTL mode , in 1 iterations and 71940 ms. Remains : 615/615 places, 1612/1612 transitions.
Built C files in :
/tmp/ltsmin12616639059327256071
[2024-05-23 18:01:26] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12616639059327256071
Running compilation step : cd /tmp/ltsmin12616639059327256071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12616639059327256071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12616639059327256071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 18:01:29] [INFO ] Flatten gal took : 35 ms
[2024-05-23 18:01:29] [INFO ] Flatten gal took : 35 ms
[2024-05-23 18:01:29] [INFO ] Time to serialize gal into /tmp/LTL16009223964737617451.gal : 6 ms
[2024-05-23 18:01:29] [INFO ] Time to serialize properties into /tmp/LTL13644269940624185526.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16009223964737617451.gal' '-t' 'CGAL' '-hoa' '/tmp/aut869470107204577928.hoa' '-atoms' '/tmp/LTL13644269940624185526.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13644269940624185526.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut869470107204577928.hoa
Detected timeout of ITS tools.
[2024-05-23 18:01:44] [INFO ] Flatten gal took : 34 ms
[2024-05-23 18:01:44] [INFO ] Flatten gal took : 36 ms
[2024-05-23 18:01:44] [INFO ] Time to serialize gal into /tmp/LTL8753421368030534142.gal : 5 ms
[2024-05-23 18:01:44] [INFO ] Time to serialize properties into /tmp/LTL18416768822448077630.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8753421368030534142.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18416768822448077630.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((X(("((s0<1)||(l2128<1))")||(G("((s0<1)||(l753<1))"))))&&("((s0<1)||(l753<1))")))))
Formula 0 simplified : FG(!"((s0<1)||(l753<1))" | X(!"((s0<1)||(l2128<1))" & F!"((s0<1)||(l753<1))"))
Detected timeout of ITS tools.
[2024-05-23 18:01:59] [INFO ] Flatten gal took : 38 ms
[2024-05-23 18:01:59] [INFO ] Applying decomposition
[2024-05-23 18:01:59] [INFO ] Flatten gal took : 34 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/graph14389562501882808518.txt' '-o' '/tmp/graph14389562501882808518.bin' '-w' '/tmp/graph14389562501882808518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14389562501882808518.bin' '-l' '-1' '-v' '-w' '/tmp/graph14389562501882808518.weights' '-q' '0' '-e' '0.001'
[2024-05-23 18:01:59] [INFO ] Decomposing Gal with order
[2024-05-23 18:01:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 18:01:59] [INFO ] Removed a total of 2681 redundant transitions.
[2024-05-23 18:01:59] [INFO ] Flatten gal took : 65 ms
[2024-05-23 18:01:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1221 labels/synchronizations in 33 ms.
[2024-05-23 18:01:59] [INFO ] Time to serialize gal into /tmp/LTL13344626935384618468.gal : 22 ms
[2024-05-23 18:01:59] [INFO ] Time to serialize properties into /tmp/LTL5128581761796669008.ltl : 41 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13344626935384618468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5128581761796669008.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((X(("((i0.u0.s0<1)||(i23.i2.u157.l2128<1))")||(G("((i0.u0.s0<1)||(i2.i1.u104.l753<1))"))))&&("((i0.u0.s0<1)||(i2.i1.u104.l753<1...163
Formula 0 simplified : FG(!"((i0.u0.s0<1)||(i2.i1.u104.l753<1))" | X(!"((i0.u0.s0<1)||(i23.i2.u157.l2128<1))" & F!"((i0.u0.s0<1)||(i2.i1.u104.l753<1))"))
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c016-LTLFireability-12 finished in 445142 ms.
[2024-05-23 18:02:14] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2621829723373640502
[2024-05-23 18:02:14] [INFO ] Too many transitions (1838) to apply POR reductions. Disabling POR matrices.
[2024-05-23 18:02:14] [INFO ] Applying decomposition
[2024-05-23 18:02:14] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2621829723373640502
Running compilation step : cd /tmp/ltsmin2621829723373640502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 18:02:14] [INFO ] Flatten gal took : 48 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/graph10859735894837283218.txt' '-o' '/tmp/graph10859735894837283218.bin' '-w' '/tmp/graph10859735894837283218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10859735894837283218.bin' '-l' '-1' '-v' '-w' '/tmp/graph10859735894837283218.weights' '-q' '0' '-e' '0.001'
[2024-05-23 18:02:14] [INFO ] Decomposing Gal with order
[2024-05-23 18:02:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 18:02:15] [INFO ] Removed a total of 3087 redundant transitions.
[2024-05-23 18:02:15] [INFO ] Flatten gal took : 66 ms
[2024-05-23 18:02:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 1331 labels/synchronizations in 51 ms.
[2024-05-23 18:02:15] [INFO ] Time to serialize gal into /tmp/LTLFireability10429452563872715168.gal : 10 ms
[2024-05-23 18:02:15] [INFO ] Time to serialize properties into /tmp/LTLFireability18184904858654701832.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10429452563872715168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18184904858654701832.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((X(X(G(("((i0.i0.u0.s0<1)||(i26.i0.u185.l2051<1))")||(X("((i0.i0.u0.s0<1)||(i26.i0.u185.l2051<1))")))))))
Formula 0 simplified : XXF(!"((i0.i0.u0.s0<1)||(i26.i0.u185.l2051<1))" & X!"((i0.i0.u0.s0<1)||(i26.i0.u185.l2051<1))")
Compilation finished in 4348 ms.
Running link step : cd /tmp/ltsmin2621829723373640502;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin2621829723373640502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2621829723373640502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2621829723373640502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-c016"
export BK_EXAMINATION="LTLFireability"
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-c016, examination is LTLFireability"
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-171640603100300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c016.tgz
mv FunctionPointer-PT-c016 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;