About the Execution of ITS-Tools for FunctionPointer-PT-c008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16199.852 | 3600000.00 | 8957648.00 | 6834.80 | FTTTF?T?FFFTF?FF | 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-171640603100291.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-c008, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603100291
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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-c008-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716480904309
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-23 16:15:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 16:15:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 16:15:05] [INFO ] Load time of PNML (sax parser for PT used): 395 ms
[2024-05-23 16:15:06] [INFO ] Transformed 2826 places.
[2024-05-23 16:15:06] [INFO ] Transformed 8960 transitions.
[2024-05-23 16:15:06] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 574 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1198 places in 47 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c008-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 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 3714
Iterating global reduction 1 with 293 rules applied. Total rules applied 603 place count 1318 transition count 3714
Ensure Unique test removed 364 transitions
Reduce isomorphic transitions removed 364 transitions.
Iterating post reduction 1 with 364 rules applied. Total rules applied 967 place count 1318 transition count 3350
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 1119 place count 1166 transition count 3046
Iterating global reduction 2 with 152 rules applied. Total rules applied 1271 place count 1166 transition count 3046
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1339 place count 1166 transition count 2978
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1351 place count 1154 transition count 2954
Iterating global reduction 3 with 12 rules applied. Total rules applied 1363 place count 1154 transition count 2954
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1373 place count 1144 transition count 2934
Iterating global reduction 3 with 10 rules applied. Total rules applied 1383 place count 1144 transition count 2934
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1393 place count 1134 transition count 2914
Iterating global reduction 3 with 10 rules applied. Total rules applied 1403 place count 1134 transition count 2914
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1413 place count 1124 transition count 2894
Iterating global reduction 3 with 10 rules applied. Total rules applied 1423 place count 1124 transition count 2894
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1433 place count 1114 transition count 2874
Iterating global reduction 3 with 10 rules applied. Total rules applied 1443 place count 1114 transition count 2874
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1452 place count 1105 transition count 2856
Iterating global reduction 3 with 9 rules applied. Total rules applied 1461 place count 1105 transition count 2856
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1468 place count 1098 transition count 2842
Iterating global reduction 3 with 7 rules applied. Total rules applied 1475 place count 1098 transition count 2842
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 1508 place count 1065 transition count 2716
Iterating global reduction 3 with 33 rules applied. Total rules applied 1541 place count 1065 transition count 2716
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1583 place count 1023 transition count 2548
Iterating global reduction 3 with 42 rules applied. Total rules applied 1625 place count 1023 transition count 2548
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1666 place count 982 transition count 2442
Iterating global reduction 3 with 41 rules applied. Total rules applied 1707 place count 982 transition count 2442
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1748 place count 941 transition count 2360
Iterating global reduction 3 with 41 rules applied. Total rules applied 1789 place count 941 transition count 2360
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1829 place count 901 transition count 2280
Iterating global reduction 3 with 40 rules applied. Total rules applied 1869 place count 901 transition count 2280
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1908 place count 862 transition count 2202
Iterating global reduction 3 with 39 rules applied. Total rules applied 1947 place count 862 transition count 2202
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1982 place count 827 transition count 2132
Iterating global reduction 3 with 35 rules applied. Total rules applied 2017 place count 827 transition count 2132
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2028 place count 816 transition count 2110
Iterating global reduction 3 with 11 rules applied. Total rules applied 2039 place count 816 transition count 2110
Applied a total of 2039 rules in 1086 ms. Remains 816 /1628 variables (removed 812) and now considering 2110/5962 (removed 3852) transitions.
[2024-05-23 16:15:07] [INFO ] Flow matrix only has 1428 transitions (discarded 682 similar events)
// Phase 1: matrix 1428 rows 816 cols
[2024-05-23 16:15:07] [INFO ] Computed 2 invariants in 37 ms
[2024-05-23 16:15:08] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2024-05-23 16:15:08] [INFO ] Flow matrix only has 1428 transitions (discarded 682 similar events)
[2024-05-23 16:15:08] [INFO ] Invariant cache hit.
[2024-05-23 16:15:08] [INFO ] State equation strengthened by 346 read => feed constraints.
[2024-05-23 16:15:11] [INFO ] Implicit Places using invariants and state equation in 2649 ms returned []
Implicit Place search using SMT with State Equation took 3701 ms to find 0 implicit places.
Running 2108 sub problems to find dead transitions.
[2024-05-23 16:15:11] [INFO ] Flow matrix only has 1428 transitions (discarded 682 similar events)
[2024-05-23 16:15:11] [INFO ] Invariant cache hit.
[2024-05-23 16:15:11] [INFO ] State equation strengthened by 346 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/816 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 816/2244 variables, and 2 constraints, problems are : Problem set: 0 solved, 2108 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/816 constraints, ReadFeed: 0/346 constraints, PredecessorRefiner: 2108/2108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/816 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/2244 variables, and 2 constraints, problems are : Problem set: 0 solved, 2108 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/816 constraints, ReadFeed: 0/346 constraints, PredecessorRefiner: 0/2108 constraints, Known Traps: 0/0 constraints]
After SMT, in 71077ms problems are : Problem set: 0 solved, 2108 unsolved
Search for dead transitions found 0 dead transitions in 71126ms
Starting structural reductions in LTL mode, iteration 1 : 816/1628 places, 2110/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75947 ms. Remains : 816/1628 places, 2110/5962 transitions.
Support contains 27 out of 816 places after structural reductions.
[2024-05-23 16:16:22] [INFO ] Flatten gal took : 216 ms
[2024-05-23 16:16:22] [INFO ] Flatten gal took : 119 ms
[2024-05-23 16:16:23] [INFO ] Input system was already deterministic with 2110 transitions.
RANDOM walk for 40005 steps (8 resets) in 2278 ms. (17 steps per ms) remains 10/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 114 ms. (347 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
[2024-05-23 16:16:24] [INFO ] Flow matrix only has 1428 transitions (discarded 682 similar events)
[2024-05-23 16:16:24] [INFO ] Invariant cache hit.
[2024-05-23 16:16:24] [INFO ] State equation strengthened by 346 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 381/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 377/1412 variables, 10/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1412 variables, 251/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1412 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 614/2026 variables, 271/920 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2026 variables, 1/921 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2026 variables, 95/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2026 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 174/2200 variables, 125/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2200 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 32/2232 variables, 13/1154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2232 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 12/2244 variables, 10/1164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2244 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/2244 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2244/2244 variables, and 1164 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1429 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 816/816 constraints, ReadFeed: 346/346 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 381/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 377/1412 variables, 10/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1412 variables, 251/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1412 variables, 3/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1412 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 614/2026 variables, 271/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2026 variables, 1/924 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2026 variables, 95/1019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2026 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 174/2200 variables, 125/1144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2200 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 32/2232 variables, 13/1157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2232 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 12/2244 variables, 10/1167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2244 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/2244 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2244/2244 variables, and 1167 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1206 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 816/816 constraints, ReadFeed: 346/346 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2676ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 163 ms.
Support contains 5 out of 816 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Graph (complete) has 3433 edges and 816 vertex of which 627 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.6 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 627 transition count 1732
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 394 place count 612 transition count 1702
Iterating global reduction 1 with 15 rules applied. Total rules applied 409 place count 612 transition count 1702
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 421 place count 612 transition count 1690
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 433 place count 600 transition count 1666
Iterating global reduction 2 with 12 rules applied. Total rules applied 445 place count 600 transition count 1666
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 449 place count 600 transition count 1662
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 459 place count 590 transition count 1640
Iterating global reduction 3 with 10 rules applied. Total rules applied 469 place count 590 transition count 1640
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 480 place count 579 transition count 1608
Iterating global reduction 3 with 11 rules applied. Total rules applied 491 place count 579 transition count 1608
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 505 place count 565 transition count 1564
Iterating global reduction 3 with 14 rules applied. Total rules applied 519 place count 565 transition count 1564
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 532 place count 552 transition count 1530
Iterating global reduction 3 with 13 rules applied. Total rules applied 545 place count 552 transition count 1530
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 558 place count 539 transition count 1504
Iterating global reduction 3 with 13 rules applied. Total rules applied 571 place count 539 transition count 1504
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 587 place count 523 transition count 1464
Iterating global reduction 3 with 16 rules applied. Total rules applied 603 place count 523 transition count 1464
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 621 place count 505 transition count 1412
Iterating global reduction 3 with 18 rules applied. Total rules applied 639 place count 505 transition count 1412
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 657 place count 487 transition count 1364
Iterating global reduction 3 with 18 rules applied. Total rules applied 675 place count 487 transition count 1364
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 689 place count 473 transition count 1332
Iterating global reduction 3 with 14 rules applied. Total rules applied 703 place count 473 transition count 1332
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 713 place count 463 transition count 1312
Iterating global reduction 3 with 10 rules applied. Total rules applied 723 place count 463 transition count 1312
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 733 place count 453 transition count 1292
Iterating global reduction 3 with 10 rules applied. Total rules applied 743 place count 453 transition count 1292
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 753 place count 443 transition count 1272
Iterating global reduction 3 with 10 rules applied. Total rules applied 763 place count 443 transition count 1272
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 769 place count 437 transition count 1260
Iterating global reduction 3 with 6 rules applied. Total rules applied 775 place count 437 transition count 1260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 777 place count 435 transition count 1256
Iterating global reduction 3 with 2 rules applied. Total rules applied 779 place count 435 transition count 1256
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 785 place count 435 transition count 1250
Applied a total of 785 rules in 406 ms. Remains 435 /816 variables (removed 381) and now considering 1250/2110 (removed 860) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 407 ms. Remains : 435/816 places, 1250/2110 transitions.
RANDOM walk for 40000 steps (8 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
[2024-05-23 16:16:27] [INFO ] Flow matrix only has 711 transitions (discarded 539 similar events)
// Phase 1: matrix 711 rows 435 cols
[2024-05-23 16:16:27] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 16:16:27] [INFO ] State equation strengthened by 81 read => feed constraints.
All remaining problems are real, not stopping.
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) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 646/1032 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1032 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/1073 variables, 8/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1073 variables, 75/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1073 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 47/1120 variables, 26/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1120 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1120 variables, 6/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1120 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/1137 variables, 9/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1137 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/1143 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1143 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/1146 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1146 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1146 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1146/1146 variables, and 518 constraints, problems are : Problem set: 0 solved, 1 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 435/435 constraints, ReadFeed: 81/81 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) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 646/1032 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1032 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/1073 variables, 8/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1073 variables, 75/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1073 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1073 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 47/1120 variables, 26/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1120 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1120 variables, 6/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1120 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 17/1137 variables, 9/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1137 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1143 variables, 4/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1143 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1146 variables, 2/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1146 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1146 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1146/1146 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 435/435 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 875ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 432 steps, including 9 resets, run visited all 1 properties in 3 ms. (steps per millisecond=144 )
Parikh walk visited 1 properties in 6 ms.
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' '!(F(G(p0)))'
Support contains 2 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 42 place count 801 transition count 2068
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 55 place count 788 transition count 2042
Iterating global reduction 1 with 13 rules applied. Total rules applied 68 place count 788 transition count 2042
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 788 transition count 2038
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 778 transition count 2014
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 778 transition count 2014
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 106 place count 764 transition count 1966
Iterating global reduction 2 with 14 rules applied. Total rules applied 120 place count 764 transition count 1966
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 136 place count 748 transition count 1912
Iterating global reduction 2 with 16 rules applied. Total rules applied 152 place count 748 transition count 1912
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 167 place count 733 transition count 1876
Iterating global reduction 2 with 15 rules applied. Total rules applied 182 place count 733 transition count 1876
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 197 place count 718 transition count 1846
Iterating global reduction 2 with 15 rules applied. Total rules applied 212 place count 718 transition count 1846
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 229 place count 701 transition count 1806
Iterating global reduction 2 with 17 rules applied. Total rules applied 246 place count 701 transition count 1806
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 263 place count 684 transition count 1762
Iterating global reduction 2 with 17 rules applied. Total rules applied 280 place count 684 transition count 1762
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 296 place count 668 transition count 1726
Iterating global reduction 2 with 16 rules applied. Total rules applied 312 place count 668 transition count 1726
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 320 place count 660 transition count 1710
Iterating global reduction 2 with 8 rules applied. Total rules applied 328 place count 660 transition count 1710
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 333 place count 655 transition count 1700
Iterating global reduction 2 with 5 rules applied. Total rules applied 338 place count 655 transition count 1700
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 343 place count 650 transition count 1690
Iterating global reduction 2 with 5 rules applied. Total rules applied 348 place count 650 transition count 1690
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 353 place count 645 transition count 1680
Iterating global reduction 2 with 5 rules applied. Total rules applied 358 place count 645 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 360 place count 643 transition count 1676
Iterating global reduction 2 with 2 rules applied. Total rules applied 362 place count 643 transition count 1676
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 370 place count 643 transition count 1668
Applied a total of 370 rules in 576 ms. Remains 643 /816 variables (removed 173) and now considering 1668/2110 (removed 442) transitions.
[2024-05-23 16:16:29] [INFO ] Flow matrix only has 1116 transitions (discarded 552 similar events)
// Phase 1: matrix 1116 rows 643 cols
[2024-05-23 16:16:29] [INFO ] Computed 2 invariants in 21 ms
[2024-05-23 16:16:29] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-05-23 16:16:29] [INFO ] Flow matrix only has 1116 transitions (discarded 552 similar events)
[2024-05-23 16:16:29] [INFO ] Invariant cache hit.
[2024-05-23 16:16:29] [INFO ] State equation strengthened by 276 read => feed constraints.
[2024-05-23 16:16:31] [INFO ] Implicit Places using invariants and state equation in 1863 ms returned []
Implicit Place search using SMT with State Equation took 2363 ms to find 0 implicit places.
[2024-05-23 16:16:31] [INFO ] Redundant transitions in 90 ms returned []
Running 1666 sub problems to find dead transitions.
[2024-05-23 16:16:31] [INFO ] Flow matrix only has 1116 transitions (discarded 552 similar events)
[2024-05-23 16:16:31] [INFO ] Invariant cache hit.
[2024-05-23 16:16:31] [INFO ] State equation strengthened by 276 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/1759 variables, and 2 constraints, problems are : Problem set: 0 solved, 1666 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/643 constraints, ReadFeed: 0/276 constraints, PredecessorRefiner: 1666/1666 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 3 (OVERLAPS) 1116/1759 variables, 643/645 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1759 variables, 276/921 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1759/1759 variables, and 2587 constraints, problems are : Problem set: 0 solved, 1666 unsolved in 31542 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 643/643 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 1666/1666 constraints, Known Traps: 0/0 constraints]
After SMT, in 69495ms problems are : Problem set: 0 solved, 1666 unsolved
Search for dead transitions found 0 dead transitions in 69513ms
Starting structural reductions in SI_LTL mode, iteration 1 : 643/816 places, 1668/2110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72556 ms. Remains : 643/816 places, 1668/2110 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 644 ms.
Stack based approach found an accepted trace after 620 steps with 0 reset with depth 621 and stack size 621 in 4 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-00 finished in 73438 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' '!(F((G(p0)||((p1||X(G(p0)))&&(G(p2)||X(p3)))||G(p1))))'
Support contains 7 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 804 transition count 2086
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 804 transition count 2086
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 36 place count 804 transition count 2074
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 795 transition count 2056
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 795 transition count 2056
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 795 transition count 2052
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 788 transition count 2036
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 788 transition count 2036
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 778 transition count 2004
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 778 transition count 2004
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 104 place count 766 transition count 1964
Iterating global reduction 2 with 12 rules applied. Total rules applied 116 place count 766 transition count 1964
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 128 place count 754 transition count 1934
Iterating global reduction 2 with 12 rules applied. Total rules applied 140 place count 754 transition count 1934
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 152 place count 742 transition count 1910
Iterating global reduction 2 with 12 rules applied. Total rules applied 164 place count 742 transition count 1910
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 177 place count 729 transition count 1880
Iterating global reduction 2 with 13 rules applied. Total rules applied 190 place count 729 transition count 1880
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 205 place count 714 transition count 1840
Iterating global reduction 2 with 15 rules applied. Total rules applied 220 place count 714 transition count 1840
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 235 place count 699 transition count 1800
Iterating global reduction 2 with 15 rules applied. Total rules applied 250 place count 699 transition count 1800
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 260 place count 689 transition count 1776
Iterating global reduction 2 with 10 rules applied. Total rules applied 270 place count 689 transition count 1776
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 277 place count 682 transition count 1762
Iterating global reduction 2 with 7 rules applied. Total rules applied 284 place count 682 transition count 1762
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 291 place count 675 transition count 1748
Iterating global reduction 2 with 7 rules applied. Total rules applied 298 place count 675 transition count 1748
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 305 place count 668 transition count 1734
Iterating global reduction 2 with 7 rules applied. Total rules applied 312 place count 668 transition count 1734
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 317 place count 663 transition count 1724
Iterating global reduction 2 with 5 rules applied. Total rules applied 322 place count 663 transition count 1724
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 324 place count 661 transition count 1720
Iterating global reduction 2 with 2 rules applied. Total rules applied 326 place count 661 transition count 1720
Applied a total of 326 rules in 249 ms. Remains 661 /816 variables (removed 155) and now considering 1720/2110 (removed 390) transitions.
[2024-05-23 16:17:42] [INFO ] Flow matrix only has 1154 transitions (discarded 566 similar events)
// Phase 1: matrix 1154 rows 661 cols
[2024-05-23 16:17:42] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 16:17:42] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-23 16:17:42] [INFO ] Flow matrix only has 1154 transitions (discarded 566 similar events)
[2024-05-23 16:17:42] [INFO ] Invariant cache hit.
[2024-05-23 16:17:43] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-23 16:17:44] [INFO ] Implicit Places using invariants and state equation in 1942 ms returned []
Implicit Place search using SMT with State Equation took 2440 ms to find 0 implicit places.
Running 1718 sub problems to find dead transitions.
[2024-05-23 16:17:44] [INFO ] Flow matrix only has 1154 transitions (discarded 566 similar events)
[2024-05-23 16:17:44] [INFO ] Invariant cache hit.
[2024-05-23 16:17:44] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/661 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/661 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 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 661/1815 variables, and 2 constraints, problems are : Problem set: 0 solved, 1718 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/661 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 1718/1718 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1718 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/661 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/661 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/661 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 3 (OVERLAPS) 1154/1815 variables, 661/663 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1815 variables, 284/947 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1815/1815 variables, and 2665 constraints, problems are : Problem set: 0 solved, 1718 unsolved in 31637 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 661/661 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1718/1718 constraints, Known Traps: 0/0 constraints]
After SMT, in 70192ms problems are : Problem set: 0 solved, 1718 unsolved
Search for dead transitions found 0 dead transitions in 70210ms
Starting structural reductions in LTL mode, iteration 1 : 661/816 places, 1720/2110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72903 ms. Remains : 661/816 places, 1720/2110 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 658 ms.
Product exploration explored 100000 steps with 50000 reset in 607 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 (NOT p0) (NOT p2) p3), (X (NOT p2)), (X (NOT (AND p1 p2 (NOT p0)))), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p0) (NOT p3)))), (X (NOT (AND p1 p2 p0 (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 45 factoid took 175 ms. Reduced automaton from 4 states, 28 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c008-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c008-LTLCardinality-03 finished in 74611 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' '!(F((G(F(p0))||G(p1))))'
Support contains 2 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 44 place count 801 transition count 2066
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 57 place count 788 transition count 2040
Iterating global reduction 1 with 13 rules applied. Total rules applied 70 place count 788 transition count 2040
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 788 transition count 2036
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 85 place count 777 transition count 2010
Iterating global reduction 2 with 11 rules applied. Total rules applied 96 place count 777 transition count 2010
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 111 place count 762 transition count 1960
Iterating global reduction 2 with 15 rules applied. Total rules applied 126 place count 762 transition count 1960
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 143 place count 745 transition count 1904
Iterating global reduction 2 with 17 rules applied. Total rules applied 160 place count 745 transition count 1904
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 176 place count 729 transition count 1866
Iterating global reduction 2 with 16 rules applied. Total rules applied 192 place count 729 transition count 1866
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 208 place count 713 transition count 1834
Iterating global reduction 2 with 16 rules applied. Total rules applied 224 place count 713 transition count 1834
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 240 place count 697 transition count 1802
Iterating global reduction 2 with 16 rules applied. Total rules applied 256 place count 697 transition count 1802
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 276 place count 677 transition count 1750
Iterating global reduction 2 with 20 rules applied. Total rules applied 296 place count 677 transition count 1750
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 314 place count 659 transition count 1700
Iterating global reduction 2 with 18 rules applied. Total rules applied 332 place count 659 transition count 1700
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 342 place count 649 transition count 1678
Iterating global reduction 2 with 10 rules applied. Total rules applied 352 place count 649 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 359 place count 642 transition count 1664
Iterating global reduction 2 with 7 rules applied. Total rules applied 366 place count 642 transition count 1664
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 373 place count 635 transition count 1650
Iterating global reduction 2 with 7 rules applied. Total rules applied 380 place count 635 transition count 1650
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 387 place count 628 transition count 1636
Iterating global reduction 2 with 7 rules applied. Total rules applied 394 place count 628 transition count 1636
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 401 place count 621 transition count 1622
Iterating global reduction 2 with 7 rules applied. Total rules applied 408 place count 621 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 409 place count 620 transition count 1620
Iterating global reduction 2 with 1 rules applied. Total rules applied 410 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 2 with 4 rules applied. Total rules applied 414 place count 620 transition count 1616
Applied a total of 414 rules in 425 ms. Remains 620 /816 variables (removed 196) and now considering 1616/2110 (removed 494) transitions.
[2024-05-23 16:18:57] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 620 cols
[2024-05-23 16:18:57] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 16:18:57] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-23 16:18:57] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 16:18:57] [INFO ] Invariant cache hit.
[2024-05-23 16:18:57] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 16:18:59] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 2260 ms to find 0 implicit places.
[2024-05-23 16:18:59] [INFO ] Redundant transitions in 81 ms returned []
Running 1614 sub problems to find dead transitions.
[2024-05-23 16:18:59] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 16:18:59] [INFO ] Invariant cache hit.
[2024-05-23 16:18:59] [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, 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/1700 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30029 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: 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) 1080/1700 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1700 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1700/1700 variables, and 2504 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 31480 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: 1614/1614 constraints, Known Traps: 0/0 constraints]
After SMT, in 68464ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 68478ms
Starting structural reductions in SI_LTL mode, iteration 1 : 620/816 places, 1616/2110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71257 ms. Remains : 620/816 places, 1616/2110 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 400 ms.
Product exploration explored 100000 steps with 0 reset in 495 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 (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 124 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40011 steps (8 resets) in 253 ms. (157 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
[2024-05-23 16:20:09] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 16:20:09] [INFO ] Invariant cache hit.
[2024-05-23 16:20:09] [INFO ] State equation strengthened by 268 read => feed constraints.
All remaining problems are real, not stopping.
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 930/1482 variables, 468/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1482 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1482 variables, 266/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1482 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 62/1544 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1544 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 137/1681 variables, 132/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/1693 variables, 6/885 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1693 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 7/1700 variables, 5/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1700/1700 variables, and 890 constraints, problems are : Problem set: 0 solved, 2 unsolved in 598 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: 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 930/1482 variables, 468/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1482 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1482 variables, 266/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1482 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1482 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 62/1544 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1544 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 137/1681 variables, 132/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1681 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/1693 variables, 6/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1693 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 7/1700 variables, 5/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1700 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1700 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1700/1700 variables, and 892 constraints, problems are : Problem set: 0 solved, 2 unsolved in 698 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: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1320ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Graph (complete) has 2699 edges and 620 vertex of which 428 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 428 transition count 1232
Applied a total of 385 rules in 46 ms. Remains 428 /620 variables (removed 192) and now considering 1232/1616 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 428/620 places, 1232/1616 transitions.
RANDOM walk for 40000 steps (8 resets) in 254 ms. (156 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2024-05-23 16:20:10] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
// Phase 1: matrix 698 rows 428 cols
[2024-05-23 16:20:10] [INFO ] Computed 3 invariants in 2 ms
[2024-05-23 16:20:10] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1034 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1034 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 73/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/1119 variables, 6/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1119 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/1126 variables, 5/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1126/1126 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/972 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1034 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1034 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 73/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1119 variables, 6/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1119 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/1126 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1126/1126 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 627ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 47 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 428/428 places, 1232/1232 transitions.
RANDOM walk for 40000 steps (8 resets) in 124 ms. (320 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 615923 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 1
Probabilistic random walk after 615923 steps, saw 359726 distinct states, run finished after 3005 ms. (steps per millisecond=204 ) properties seen :0
[2024-05-23 16:20:14] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-23 16:20:14] [INFO ] Invariant cache hit.
[2024-05-23 16:20:14] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1034 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1034 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 73/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/1119 variables, 6/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1119 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/1126 variables, 5/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1126/1126 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/972 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1034 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1034 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 73/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1119 variables, 6/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1119 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/1126 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1126/1126 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 674ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 44 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 428/428 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 43 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-23 16:20:15] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-23 16:20:15] [INFO ] Invariant cache hit.
[2024-05-23 16:20:15] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-23 16:20:15] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-23 16:20:15] [INFO ] Invariant cache hit.
[2024-05-23 16:20:15] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 16:20:17] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
[2024-05-23 16:20:17] [INFO ] Redundant transitions in 17 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-23 16:20:17] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-23 16:20:17] [INFO ] Invariant cache hit.
[2024-05-23 16:20:17] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-23 16:20:30] [INFO ] Deduced a trap composed of 131 places in 166 ms of which 20 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 698/1126 variables, 428/432 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 34127ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 34140ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35944 ms. Remains : 428/428 places, 1232/1232 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 534 transitions
Reduce isomorphic transitions removed 534 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 549 rules applied. Total rules applied 549 place count 428 transition count 683
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 564 place count 413 transition count 683
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 564 place count 413 transition count 611
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 708 place count 341 transition count 611
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 964 place count 213 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1028 place count 149 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1092 place count 149 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1093 place count 149 transition count 354
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1156 place count 86 transition count 228
Iterating global reduction 3 with 63 rules applied. Total rules applied 1219 place count 86 transition count 228
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1282 place count 23 transition count 102
Iterating global reduction 3 with 63 rules applied. Total rules applied 1345 place count 23 transition count 102
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1408 place count 23 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1408 place count 23 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 22 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1412 place count 21 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1414 place count 20 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1416 place count 20 transition count 35
Applied a total of 1416 rules in 71 ms. Remains 20 /428 variables (removed 408) and now considering 35/1232 (removed 1197) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 20 cols
[2024-05-23 16:20:51] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 16:20:51] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:20:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 16:20:51] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:20:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:20:51] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:20:51] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:20:51] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 270 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 327 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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 16:20:52] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 620 cols
[2024-05-23 16:20:52] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 16:20:52] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-23 16:20:52] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 16:20:52] [INFO ] Invariant cache hit.
[2024-05-23 16:20:52] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 16:20:54] [INFO ] Implicit Places using invariants and state equation in 1757 ms returned []
Implicit Place search using SMT with State Equation took 2215 ms to find 0 implicit places.
[2024-05-23 16:20:54] [INFO ] Redundant transitions in 24 ms returned []
Running 1614 sub problems to find dead transitions.
[2024-05-23 16:20:54] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 16:20:54] [INFO ] Invariant cache hit.
[2024-05-23 16:20:54] [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, 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 "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1700 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30028 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: 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) 1080/1700 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1700 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1700/1700 variables, and 2504 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 31323 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: 1614/1614 constraints, Known Traps: 0/0 constraints]
After SMT, in 68765ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 68778ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71125 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 : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40002 steps (8 resets) in 148 ms. (268 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2024-05-23 16:22:03] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 16:22:03] [INFO ] Invariant cache hit.
[2024-05-23 16:22:03] [INFO ] State equation strengthened by 268 read => feed constraints.
All remaining problems are real, not stopping.
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 930/1482 variables, 468/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1482 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1482 variables, 266/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1482 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1544 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1544 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 137/1681 variables, 132/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/1693 variables, 6/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1693 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/1700 variables, 5/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1700 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1700/1700 variables, and 890 constraints, problems are : Problem set: 0 solved, 1 unsolved in 402 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: 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 930/1482 variables, 468/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1482 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1482 variables, 266/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1482 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1482 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1544 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1544 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 137/1681 variables, 132/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1681 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/1693 variables, 6/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1693 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/1700 variables, 5/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1700 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1700 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1700/1700 variables, and 891 constraints, problems are : Problem set: 0 solved, 1 unsolved in 468 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: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 883ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 1616/1616 transitions.
Graph (complete) has 2699 edges and 620 vertex of which 428 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 428 transition count 1232
Applied a total of 385 rules in 52 ms. Remains 428 /620 variables (removed 192) and now considering 1232/1616 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 428/620 places, 1232/1616 transitions.
RANDOM walk for 40000 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 638541 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :0 out of 1
Probabilistic random walk after 638541 steps, saw 372345 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
[2024-05-23 16:22:07] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
// Phase 1: matrix 698 rows 428 cols
[2024-05-23 16:22:07] [INFO ] Computed 3 invariants in 4 ms
[2024-05-23 16:22:07] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1034 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1034 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 73/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/1119 variables, 6/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1119 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/1126 variables, 5/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1126 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1126/1126 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 354/362 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/370 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 602/972 variables, 338/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 76/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/972 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1034 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1034 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 73/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1119 variables, 6/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1119 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/1126 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1126/1126 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 633ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 48 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 428/428 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 45 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-23 16:22:08] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-23 16:22:08] [INFO ] Invariant cache hit.
[2024-05-23 16:22:08] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-23 16:22:08] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-23 16:22:08] [INFO ] Invariant cache hit.
[2024-05-23 16:22:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 16:22:09] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned []
Implicit Place search using SMT with State Equation took 1690 ms to find 0 implicit places.
[2024-05-23 16:22:09] [INFO ] Redundant transitions in 14 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-23 16:22:09] [INFO ] Flow matrix only has 698 transitions (discarded 534 similar events)
[2024-05-23 16:22:09] [INFO ] Invariant cache hit.
[2024-05-23 16:22:09] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-23 16:22:23] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 698/1126 variables, 428/432 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 34262ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 34272ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36034 ms. Remains : 428/428 places, 1232/1232 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 534 transitions
Reduce isomorphic transitions removed 534 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 549 rules applied. Total rules applied 549 place count 428 transition count 683
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 564 place count 413 transition count 683
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 564 place count 413 transition count 611
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 708 place count 341 transition count 611
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 964 place count 213 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1028 place count 149 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1092 place count 149 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1093 place count 149 transition count 354
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1156 place count 86 transition count 228
Iterating global reduction 3 with 63 rules applied. Total rules applied 1219 place count 86 transition count 228
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1282 place count 23 transition count 102
Iterating global reduction 3 with 63 rules applied. Total rules applied 1345 place count 23 transition count 102
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1408 place count 23 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1408 place count 23 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 22 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1412 place count 21 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1414 place count 20 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1416 place count 20 transition count 35
Applied a total of 1416 rules in 30 ms. Remains 20 /428 variables (removed 408) and now considering 35/1232 (removed 1197) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 20 cols
[2024-05-23 16:22:44] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 16:22:44] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:22:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 16:22:44] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:22:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:22: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 16:22:44] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:22:44] [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 86 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 180 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 387 ms.
Product exploration explored 100000 steps with 0 reset in 478 ms.
Built C files in :
/tmp/ltsmin17672425727728461658
[2024-05-23 16:22:45] [INFO ] Too many transitions (1616) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:22:45] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17672425727728461658
Running compilation step : cd /tmp/ltsmin17672425727728461658;'/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/ltsmin17672425727728461658;'/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/ltsmin17672425727728461658;'/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 70 ms. Remains 620 /620 variables (removed 0) and now considering 1616/1616 (removed 0) transitions.
[2024-05-23 16:22:48] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 620 cols
[2024-05-23 16:22:48] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 16:22:49] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-23 16:22:49] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 16:22:49] [INFO ] Invariant cache hit.
[2024-05-23 16:22:49] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 16:22:50] [INFO ] Implicit Places using invariants and state equation in 1764 ms returned []
Implicit Place search using SMT with State Equation took 2201 ms to find 0 implicit places.
[2024-05-23 16:22:50] [INFO ] Redundant transitions in 28 ms returned []
Running 1614 sub problems to find dead transitions.
[2024-05-23 16:22:50] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2024-05-23 16:22:50] [INFO ] Invariant cache hit.
[2024-05-23 16:22:50] [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, 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 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 620/1700 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30031 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: 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) 1080/1700 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1700 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1700/1700 variables, and 2504 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 31438 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: 1614/1614 constraints, Known Traps: 0/0 constraints]
After SMT, in 68609ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 68623ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70929 ms. Remains : 620/620 places, 1616/1616 transitions.
Built C files in :
/tmp/ltsmin5493514817824246488
[2024-05-23 16:23:59] [INFO ] Too many transitions (1616) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:23:59] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5493514817824246488
Running compilation step : cd /tmp/ltsmin5493514817824246488;'/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/ltsmin5493514817824246488;'/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/ltsmin5493514817824246488;'/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 16:24:02] [INFO ] Flatten gal took : 57 ms
[2024-05-23 16:24:02] [INFO ] Flatten gal took : 56 ms
[2024-05-23 16:24:02] [INFO ] Time to serialize gal into /tmp/LTL9276351048559577412.gal : 16 ms
[2024-05-23 16:24:02] [INFO ] Time to serialize properties into /tmp/LTL8715201016585203690.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/LTL9276351048559577412.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5164128063120050666.hoa' '-atoms' '/tmp/LTL8715201016585203690.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/LTL8715201016585203690.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5164128063120050666.hoa
Detected timeout of ITS tools.
[2024-05-23 16:24:17] [INFO ] Flatten gal took : 46 ms
[2024-05-23 16:24:18] [INFO ] Flatten gal took : 47 ms
[2024-05-23 16:24:18] [INFO ] Time to serialize gal into /tmp/LTL7262317118615428778.gal : 11 ms
[2024-05-23 16:24:18] [INFO ] Time to serialize properties into /tmp/LTL9025984443974681794.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/LTL7262317118615428778.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9025984443974681794.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...275
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(l1024<=0)")))||(G("(l1978>=3)")))))
Formula 0 simplified : G(FG!"(l1024<=0)" & F!"(l1978>=3)")
Detected timeout of ITS tools.
[2024-05-23 16:24:33] [INFO ] Flatten gal took : 41 ms
[2024-05-23 16:24:33] [INFO ] Applying decomposition
[2024-05-23 16:24:33] [INFO ] Flatten gal took : 42 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/graph11037936360772670448.txt' '-o' '/tmp/graph11037936360772670448.bin' '-w' '/tmp/graph11037936360772670448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11037936360772670448.bin' '-l' '-1' '-v' '-w' '/tmp/graph11037936360772670448.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:24:33] [INFO ] Decomposing Gal with order
[2024-05-23 16:24:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:24:33] [INFO ] Removed a total of 2691 redundant transitions.
[2024-05-23 16:24:33] [INFO ] Flatten gal took : 157 ms
[2024-05-23 16:24:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1101 labels/synchronizations in 93 ms.
[2024-05-23 16:24:33] [INFO ] Time to serialize gal into /tmp/LTL13881195991842794774.gal : 32 ms
[2024-05-23 16:24:33] [INFO ] Time to serialize properties into /tmp/LTL7761225806789001456.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/LTL13881195991842794774.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7761225806789001456.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 : !((F((G(F("(i0.u135.l1024<=0)")))||(G("(i23.i1.u149.l1978>=3)")))))
Formula 0 simplified : G(FG!"(i0.u135.l1024<=0)" & F!"(i23.i1.u149.l1978>=3)")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-04 finished in 352282 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' '!(F(G((X(F(p0)) U (p1||F(p2))))))'
Support contains 4 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 40 place count 801 transition count 2070
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 52 place count 789 transition count 2046
Iterating global reduction 1 with 12 rules applied. Total rules applied 64 place count 789 transition count 2046
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 789 transition count 2042
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 80 place count 777 transition count 2014
Iterating global reduction 2 with 12 rules applied. Total rules applied 92 place count 777 transition count 2014
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 108 place count 761 transition count 1962
Iterating global reduction 2 with 16 rules applied. Total rules applied 124 place count 761 transition count 1962
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 142 place count 743 transition count 1904
Iterating global reduction 2 with 18 rules applied. Total rules applied 160 place count 743 transition count 1904
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 177 place count 726 transition count 1864
Iterating global reduction 2 with 17 rules applied. Total rules applied 194 place count 726 transition count 1864
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 211 place count 709 transition count 1830
Iterating global reduction 2 with 17 rules applied. Total rules applied 228 place count 709 transition count 1830
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 247 place count 690 transition count 1786
Iterating global reduction 2 with 19 rules applied. Total rules applied 266 place count 690 transition count 1786
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 287 place count 669 transition count 1730
Iterating global reduction 2 with 21 rules applied. Total rules applied 308 place count 669 transition count 1730
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 327 place count 650 transition count 1682
Iterating global reduction 2 with 19 rules applied. Total rules applied 346 place count 650 transition count 1682
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 357 place count 639 transition count 1658
Iterating global reduction 2 with 11 rules applied. Total rules applied 368 place count 639 transition count 1658
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 376 place count 631 transition count 1642
Iterating global reduction 2 with 8 rules applied. Total rules applied 384 place count 631 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 392 place count 623 transition count 1626
Iterating global reduction 2 with 8 rules applied. Total rules applied 400 place count 623 transition count 1626
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 408 place count 615 transition count 1610
Iterating global reduction 2 with 8 rules applied. Total rules applied 416 place count 615 transition count 1610
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 421 place count 610 transition count 1600
Iterating global reduction 2 with 5 rules applied. Total rules applied 426 place count 610 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 427 place count 609 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 428 place count 609 transition count 1598
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 430 place count 609 transition count 1596
Applied a total of 430 rules in 370 ms. Remains 609 /816 variables (removed 207) and now considering 1596/2110 (removed 514) transitions.
[2024-05-23 16:24:49] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2024-05-23 16:24:49] [INFO ] Computed 2 invariants in 17 ms
[2024-05-23 16:24:49] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-05-23 16:24:49] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 16:24:49] [INFO ] Invariant cache hit.
[2024-05-23 16:24:50] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 16:24:51] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 2385 ms to find 0 implicit places.
[2024-05-23 16:24:51] [INFO ] Redundant transitions in 25 ms returned []
Running 1594 sub problems to find dead transitions.
[2024-05-23 16:24:51] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 16:24:51] [INFO ] Invariant cache hit.
[2024-05-23 16:24:51] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/1676 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1676 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1676 variables, 266/877 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 2471 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 31485 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
After SMT, in 69005ms problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 69019ms
Starting structural reductions in SI_LTL mode, iteration 1 : 609/816 places, 1596/2110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71806 ms. Remains : 609/816 places, 1596/2110 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 408 ms.
Product exploration explored 100000 steps with 0 reset in 473 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/609 stabilizing places and 512/1596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 150 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2024-05-23 16:26:02] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 16:26:02] [INFO ] Invariant cache hit.
[2024-05-23 16:26:02] [INFO ] State equation strengthened by 266 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 220/1255 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1255 variables, 199/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1255 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 337/1592 variables, 139/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1592 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1592 variables, 67/803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1592 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 70/1662 variables, 66/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1670 variables, 4/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1670 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1676 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1676/1676 variables, and 877 constraints, problems are : Problem set: 0 solved, 1 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 220/1255 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1255 variables, 199/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1255 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1255 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 337/1592 variables, 139/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1592 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1592 variables, 67/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1592 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 70/1662 variables, 66/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1662 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1670 variables, 4/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1670 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1676 variables, 4/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1676 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1676 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 878 constraints, problems are : Problem set: 0 solved, 1 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 938ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 6114 steps, including 135 resets, run visited all 1 properties in 24 ms. (steps per millisecond=254 )
Parikh walk visited 1 properties in 23 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 16 factoid took 422 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 74 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2024-05-23 16:26:03] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 16:26:03] [INFO ] Invariant cache hit.
[2024-05-23 16:26:04] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-05-23 16:26:04] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 16:26:04] [INFO ] Invariant cache hit.
[2024-05-23 16:26:04] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 16:26:06] [INFO ] Implicit Places using invariants and state equation in 1850 ms returned []
Implicit Place search using SMT with State Equation took 2260 ms to find 0 implicit places.
[2024-05-23 16:26:06] [INFO ] Redundant transitions in 22 ms returned []
Running 1594 sub problems to find dead transitions.
[2024-05-23 16:26:06] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 16:26:06] [INFO ] Invariant cache hit.
[2024-05-23 16:26:06] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 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 609/1676 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 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/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1676 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1676 variables, 266/877 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 2471 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 31438 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
After SMT, in 68709ms problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 68723ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71089 ms. Remains : 609/609 places, 1596/1596 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/609 stabilizing places and 512/1596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 159 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40002 steps (8 resets) in 292 ms. (136 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 55 ms. (714 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
[2024-05-23 16:27:15] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 16:27:15] [INFO ] Invariant cache hit.
[2024-05-23 16:27:15] [INFO ] State equation strengthened by 266 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 220/1255 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1255 variables, 199/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1255 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 337/1592 variables, 139/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1592 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1592 variables, 67/803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1592 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 70/1662 variables, 66/869 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 8/1670 variables, 4/873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1670 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 6/1676 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1676/1676 variables, and 877 constraints, problems are : Problem set: 0 solved, 3 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 220/1255 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1255 variables, 199/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1255 variables, 3/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1255 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 337/1592 variables, 139/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1592 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1592 variables, 67/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1592 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 70/1662 variables, 66/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1662 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/1670 variables, 4/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1670 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 6/1676 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1676 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1676 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 880 constraints, problems are : Problem set: 0 solved, 3 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1608ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 154 ms.
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Graph (complete) has 2662 edges and 609 vertex of which 420 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.0 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 420 transition count 1218
Applied a total of 379 rules in 43 ms. Remains 420 /609 variables (removed 189) and now considering 1218/1596 (removed 378) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 420/609 places, 1218/1596 transitions.
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 615312 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 1
Probabilistic random walk after 615312 steps, saw 377297 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
[2024-05-23 16:27:20] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
// Phase 1: matrix 691 rows 420 cols
[2024-05-23 16:27:20] [INFO ] Computed 2 invariants in 8 ms
[2024-05-23 16:27:20] [INFO ] State equation strengthened by 79 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/1068 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 75/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 22/1090 variables, 13/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1090 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/1097 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1105 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1105 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1111 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 420/420 constraints, ReadFeed: 79/79 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/1068 variables, 9/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 75/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1068 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/1090 variables, 13/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1090 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/1097 variables, 3/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1105 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1105 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1111 variables, 4/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1111 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1111 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 420/420 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 660ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 420 /420 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 420/420 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 420 /420 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 16:27:20] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2024-05-23 16:27:20] [INFO ] Invariant cache hit.
[2024-05-23 16:27:21] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-23 16:27:21] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2024-05-23 16:27:21] [INFO ] Invariant cache hit.
[2024-05-23 16:27:21] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-23 16:27:22] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 1599 ms to find 0 implicit places.
[2024-05-23 16:27:22] [INFO ] Redundant transitions in 18 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 16:27:22] [INFO ] Flow matrix only has 691 transitions (discarded 527 similar events)
[2024-05-23 16:27:22] [INFO ] Invariant cache hit.
[2024-05-23 16:27:22] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 691/1111 variables, 420/422 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 33811ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 33822ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35495 ms. Remains : 420/420 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 537 rules applied. Total rules applied 537 place count 420 transition count 681
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 548 place count 410 transition count 680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 549 place count 409 transition count 680
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 549 place count 409 transition count 613
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 683 place count 342 transition count 613
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 937 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1001 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 1065 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 1066 place count 151 transition count 357
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1066 place count 151 transition count 356
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1068 place count 150 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1131 place count 87 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 1194 place count 87 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1257 place count 24 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1320 place count 24 transition count 104
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 4 with 61 rules applied. Total rules applied 1381 place count 24 transition count 43
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 1383 place count 23 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1390 place count 23 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1391 place count 23 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1392 place count 23 transition count 36
Applied a total of 1392 rules in 23 ms. Remains 23 /420 variables (removed 397) and now considering 36/1218 (removed 1182) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 36 rows 23 cols
[2024-05-23 16:27:56] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 16:27:56] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:27:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 16:27:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:27:56] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:27:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:27:56] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:27:56] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:27:56] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 101 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 16 factoid took 334 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 384 ms.
Product exploration explored 100000 steps with 0 reset in 421 ms.
Built C files in :
/tmp/ltsmin8730356077958939203
[2024-05-23 16:27:58] [INFO ] Too many transitions (1596) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:27:58] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8730356077958939203
Running compilation step : cd /tmp/ltsmin8730356077958939203;'/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/ltsmin8730356077958939203;'/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/ltsmin8730356077958939203;'/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 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 68 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2024-05-23 16:28:01] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2024-05-23 16:28:01] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 16:28:01] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-23 16:28:01] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 16:28:01] [INFO ] Invariant cache hit.
[2024-05-23 16:28:01] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 16:28:03] [INFO ] Implicit Places using invariants and state equation in 1875 ms returned []
Implicit Place search using SMT with State Equation took 2283 ms to find 0 implicit places.
[2024-05-23 16:28:03] [INFO ] Redundant transitions in 28 ms returned []
Running 1594 sub problems to find dead transitions.
[2024-05-23 16:28:03] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 16:28:03] [INFO ] Invariant cache hit.
[2024-05-23 16:28:03] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/1676 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 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/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1676 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1676 variables, 266/877 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 2471 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 31425 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
After SMT, in 68626ms problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 68640ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71027 ms. Remains : 609/609 places, 1596/1596 transitions.
Built C files in :
/tmp/ltsmin14011615407899625702
[2024-05-23 16:29:12] [INFO ] Too many transitions (1596) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:29:12] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14011615407899625702
Running compilation step : cd /tmp/ltsmin14011615407899625702;'/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/ltsmin14011615407899625702;'/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/ltsmin14011615407899625702;'/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 16:29:15] [INFO ] Flatten gal took : 46 ms
[2024-05-23 16:29:15] [INFO ] Flatten gal took : 42 ms
[2024-05-23 16:29:15] [INFO ] Time to serialize gal into /tmp/LTL10938010049660481903.gal : 34 ms
[2024-05-23 16:29:15] [INFO ] Time to serialize properties into /tmp/LTL4190924987173440679.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/LTL10938010049660481903.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4839671102360549326.hoa' '-atoms' '/tmp/LTL4190924987173440679.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/LTL4190924987173440679.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4839671102360549326.hoa
Detected timeout of ITS tools.
[2024-05-23 16:29:30] [INFO ] Flatten gal took : 36 ms
[2024-05-23 16:29:30] [INFO ] Flatten gal took : 45 ms
[2024-05-23 16:29:30] [INFO ] Time to serialize gal into /tmp/LTL11361091793190587696.gal : 9 ms
[2024-05-23 16:29:30] [INFO ] Time to serialize properties into /tmp/LTL4458897573915464290.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/LTL11361091793190587696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4458897573915464290.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 : !((F(G((X(F("(p1179>=2)")))U(("(l390>=3)")||(F("(l655<=l1199)")))))))
Formula 0 simplified : GF(XG!"(p1179>=2)" R (!"(l390>=3)" & G!"(l655<=l1199)"))
Detected timeout of ITS tools.
[2024-05-23 16:29:45] [INFO ] Flatten gal took : 38 ms
[2024-05-23 16:29:45] [INFO ] Applying decomposition
[2024-05-23 16:29:45] [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/graph7188878761943094938.txt' '-o' '/tmp/graph7188878761943094938.bin' '-w' '/tmp/graph7188878761943094938.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7188878761943094938.bin' '-l' '-1' '-v' '-w' '/tmp/graph7188878761943094938.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:29:45] [INFO ] Decomposing Gal with order
[2024-05-23 16:29:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:29:45] [INFO ] Removed a total of 533 redundant transitions.
[2024-05-23 16:29:45] [INFO ] Flatten gal took : 108 ms
[2024-05-23 16:29:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 250 labels/synchronizations in 29 ms.
[2024-05-23 16:29:46] [INFO ] Time to serialize gal into /tmp/LTL18332165382553733551.gal : 8 ms
[2024-05-23 16:29:46] [INFO ] Time to serialize properties into /tmp/LTL17970740401042253473.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/LTL18332165382553733551.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17970740401042253473.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 : !((F(G((X(F("(gi0.gu0.p1179>=2)")))U(("(gi0.gu0.l390>=3)")||(F("(gu60.l655<=gu60.l1199)")))))))
Formula 0 simplified : GF(XG!"(gi0.gu0.p1179>=2)" R (!"(gi0.gu0.l390>=3)" & G!"(gu60.l655<=gu60.l1199)"))
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-05 finished in 312268 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(G((p0||X(F(!p0))))))'
Support contains 2 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 42 place count 801 transition count 2068
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 787 transition count 2040
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 787 transition count 2040
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 787 transition count 2036
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 86 place count 775 transition count 2008
Iterating global reduction 2 with 12 rules applied. Total rules applied 98 place count 775 transition count 2008
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 114 place count 759 transition count 1956
Iterating global reduction 2 with 16 rules applied. Total rules applied 130 place count 759 transition count 1956
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 147 place count 742 transition count 1900
Iterating global reduction 2 with 17 rules applied. Total rules applied 164 place count 742 transition count 1900
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 180 place count 726 transition count 1862
Iterating global reduction 2 with 16 rules applied. Total rules applied 196 place count 726 transition count 1862
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 212 place count 710 transition count 1830
Iterating global reduction 2 with 16 rules applied. Total rules applied 228 place count 710 transition count 1830
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 246 place count 692 transition count 1788
Iterating global reduction 2 with 18 rules applied. Total rules applied 264 place count 692 transition count 1788
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 283 place count 673 transition count 1740
Iterating global reduction 2 with 19 rules applied. Total rules applied 302 place count 673 transition count 1740
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 320 place count 655 transition count 1696
Iterating global reduction 2 with 18 rules applied. Total rules applied 338 place count 655 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 348 place count 645 transition count 1672
Iterating global reduction 2 with 10 rules applied. Total rules applied 358 place count 645 transition count 1672
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 365 place count 638 transition count 1658
Iterating global reduction 2 with 7 rules applied. Total rules applied 372 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 379 place count 631 transition count 1644
Iterating global reduction 2 with 7 rules applied. Total rules applied 386 place count 631 transition count 1644
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 393 place count 624 transition count 1630
Iterating global reduction 2 with 7 rules applied. Total rules applied 400 place count 624 transition count 1630
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 404 place count 620 transition count 1622
Iterating global reduction 2 with 4 rules applied. Total rules applied 408 place count 620 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 410 place count 618 transition count 1618
Iterating global reduction 2 with 2 rules applied. Total rules applied 412 place count 618 transition count 1618
Applied a total of 412 rules in 208 ms. Remains 618 /816 variables (removed 198) and now considering 1618/2110 (removed 492) transitions.
[2024-05-23 16:30:01] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2024-05-23 16:30:01] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 16:30:01] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-23 16:30:01] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 16:30:01] [INFO ] Invariant cache hit.
[2024-05-23 16:30:02] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 16:30:03] [INFO ] Implicit Places using invariants and state equation in 1880 ms returned []
Implicit Place search using SMT with State Equation took 2310 ms to find 0 implicit places.
Running 1616 sub problems to find dead transitions.
[2024-05-23 16:30:03] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 16:30:03] [INFO ] Invariant cache hit.
[2024-05-23 16:30:03] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1698 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1698 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1698 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1698/1698 variables, and 2503 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 31407 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
After SMT, in 68643ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 68659ms
Starting structural reductions in LTL mode, iteration 1 : 618/816 places, 1618/2110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71183 ms. Remains : 618/816 places, 1618/2110 transitions.
Stuttering acceptance computed with spot in 108 ms :[false, false, p0]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-07
Product exploration explored 100000 steps with 24935 reset in 421 ms.
Product exploration explored 100000 steps with 24989 reset in 425 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[false, p0]
RANDOM walk for 33663 steps (7 resets) in 95 ms. (350 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 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 63 ms :[false, p0]
Stuttering acceptance computed with spot in 62 ms :[false, p0]
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1618/1618 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 618 transition count 1614
Applied a total of 4 rules in 143 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1618 (removed 4) transitions.
[2024-05-23 16:31:13] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
// Phase 1: matrix 1078 rows 618 cols
[2024-05-23 16:31:13] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 16:31:14] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-23 16:31:14] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 16:31:14] [INFO ] Invariant cache hit.
[2024-05-23 16:31:14] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 16:31:16] [INFO ] Implicit Places using invariants and state equation in 1786 ms returned []
Implicit Place search using SMT with State Equation took 2218 ms to find 0 implicit places.
[2024-05-23 16:31:16] [INFO ] Redundant transitions in 30 ms returned []
Running 1612 sub problems to find dead transitions.
[2024-05-23 16:31:16] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 16:31:16] [INFO ] Invariant cache hit.
[2024-05-23 16:31:16] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 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, 1612 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1696 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2499 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 31417 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
After SMT, in 69100ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 69114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 618/618 places, 1614/1618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71519 ms. Remains : 618/618 places, 1614/1618 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 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 75 ms :[false, p0]
RANDOM walk for 22907 steps (4 resets) in 68 ms. (331 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 85 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 59 ms :[false, p0]
Stuttering acceptance computed with spot in 79 ms :[false, p0]
Stuttering acceptance computed with spot in 73 ms :[false, p0]
Product exploration explored 100000 steps with 33481 reset in 443 ms.
Product exploration explored 100000 steps with 33479 reset in 447 ms.
Built C files in :
/tmp/ltsmin6680445382890924107
[2024-05-23 16:32:26] [INFO ] Too many transitions (1614) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:32:26] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6680445382890924107
Running compilation step : cd /tmp/ltsmin6680445382890924107;'/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/ltsmin6680445382890924107;'/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/ltsmin6680445382890924107;'/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 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1614/1614 transitions.
Applied a total of 0 rules in 68 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2024-05-23 16:32:29] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 16:32:29] [INFO ] Invariant cache hit.
[2024-05-23 16:32:30] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-23 16:32:30] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 16:32:30] [INFO ] Invariant cache hit.
[2024-05-23 16:32:30] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 16:32:31] [INFO ] Implicit Places using invariants and state equation in 1770 ms returned []
Implicit Place search using SMT with State Equation took 2188 ms to find 0 implicit places.
[2024-05-23 16:32:32] [INFO ] Redundant transitions in 30 ms returned []
Running 1612 sub problems to find dead transitions.
[2024-05-23 16:32:32] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 16:32:32] [INFO ] Invariant cache hit.
[2024-05-23 16:32:32] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 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, 1612 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1696 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2499 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 31465 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
After SMT, in 68844ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 68858ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71152 ms. Remains : 618/618 places, 1614/1614 transitions.
Built C files in :
/tmp/ltsmin17082961399219974158
[2024-05-23 16:33:40] [INFO ] Too many transitions (1614) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:33:40] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17082961399219974158
Running compilation step : cd /tmp/ltsmin17082961399219974158;'/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/ltsmin17082961399219974158;'/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/ltsmin17082961399219974158;'/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 16:33:44] [INFO ] Flatten gal took : 88 ms
[2024-05-23 16:33:44] [INFO ] Flatten gal took : 77 ms
[2024-05-23 16:33:44] [INFO ] Time to serialize gal into /tmp/LTL1438031307159256440.gal : 14 ms
[2024-05-23 16:33:44] [INFO ] Time to serialize properties into /tmp/LTL7081593351106385650.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/LTL1438031307159256440.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3558605047434025308.hoa' '-atoms' '/tmp/LTL7081593351106385650.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/LTL7081593351106385650.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3558605047434025308.hoa
Detected timeout of ITS tools.
[2024-05-23 16:33:59] [INFO ] Flatten gal took : 51 ms
[2024-05-23 16:33:59] [INFO ] Flatten gal took : 41 ms
[2024-05-23 16:33:59] [INFO ] Time to serialize gal into /tmp/LTL14263256381243885865.gal : 7 ms
[2024-05-23 16:33:59] [INFO ] Time to serialize properties into /tmp/LTL16566802293007097480.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/LTL14263256381243885865.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16566802293007097480.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(G(("(l2303>l1034)")||(X(F("(l2303<=l1034)")))))))
Formula 0 simplified : XF(!"(l2303>l1034)" & XG!"(l2303<=l1034)")
Detected timeout of ITS tools.
[2024-05-23 16:34:14] [INFO ] Flatten gal took : 42 ms
[2024-05-23 16:34:14] [INFO ] Applying decomposition
[2024-05-23 16:34:14] [INFO ] Flatten gal took : 40 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/graph4200766360987246978.txt' '-o' '/tmp/graph4200766360987246978.bin' '-w' '/tmp/graph4200766360987246978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4200766360987246978.bin' '-l' '-1' '-v' '-w' '/tmp/graph4200766360987246978.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:34:14] [INFO ] Decomposing Gal with order
[2024-05-23 16:34:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:34:14] [INFO ] Removed a total of 514 redundant transitions.
[2024-05-23 16:34:14] [INFO ] Flatten gal took : 97 ms
[2024-05-23 16:34:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 21 ms.
[2024-05-23 16:34:14] [INFO ] Time to serialize gal into /tmp/LTL15990956377780005589.gal : 19 ms
[2024-05-23 16:34:14] [INFO ] Time to serialize properties into /tmp/LTL15453525963668934562.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/LTL15990956377780005589.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15453525963668934562.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(G(("(gu58.l2303>gu58.l1034)")||(X(F("(gu58.l2303<=gu58.l1034)")))))))
Formula 0 simplified : XF(!"(gu58.l2303>gu58.l1034)" & XG!"(gu58.l2303<=gu58.l1034)")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-07 finished in 268777 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' '!((p0 U (p1&&G(F(p2)))))'
Support contains 4 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 44 place count 801 transition count 2066
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 789 transition count 2042
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 789 transition count 2042
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 789 transition count 2038
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 779 transition count 2016
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 779 transition count 2016
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 107 place count 764 transition count 1968
Iterating global reduction 2 with 15 rules applied. Total rules applied 122 place count 764 transition count 1968
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 139 place count 747 transition count 1912
Iterating global reduction 2 with 17 rules applied. Total rules applied 156 place count 747 transition count 1912
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 172 place count 731 transition count 1874
Iterating global reduction 2 with 16 rules applied. Total rules applied 188 place count 731 transition count 1874
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 204 place count 715 transition count 1842
Iterating global reduction 2 with 16 rules applied. Total rules applied 220 place count 715 transition count 1842
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 238 place count 697 transition count 1800
Iterating global reduction 2 with 18 rules applied. Total rules applied 256 place count 697 transition count 1800
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 276 place count 677 transition count 1746
Iterating global reduction 2 with 20 rules applied. Total rules applied 296 place count 677 transition count 1746
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 315 place count 658 transition count 1698
Iterating global reduction 2 with 19 rules applied. Total rules applied 334 place count 658 transition count 1698
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 345 place count 647 transition count 1674
Iterating global reduction 2 with 11 rules applied. Total rules applied 356 place count 647 transition count 1674
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 364 place count 639 transition count 1658
Iterating global reduction 2 with 8 rules applied. Total rules applied 372 place count 639 transition count 1658
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 380 place count 631 transition count 1642
Iterating global reduction 2 with 8 rules applied. Total rules applied 388 place count 631 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 396 place count 623 transition count 1626
Iterating global reduction 2 with 8 rules applied. Total rules applied 404 place count 623 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 409 place count 618 transition count 1616
Iterating global reduction 2 with 5 rules applied. Total rules applied 414 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 415 place count 617 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 416 place count 617 transition count 1614
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 420 place count 617 transition count 1610
Applied a total of 420 rules in 423 ms. Remains 617 /816 variables (removed 199) and now considering 1610/2110 (removed 500) transitions.
[2024-05-23 16:34:30] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
// Phase 1: matrix 1077 rows 617 cols
[2024-05-23 16:34:30] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 16:34:30] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-23 16:34:30] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
[2024-05-23 16:34:30] [INFO ] Invariant cache hit.
[2024-05-23 16:34:31] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 16:34:32] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 2103 ms to find 0 implicit places.
[2024-05-23 16:34:32] [INFO ] Redundant transitions in 29 ms returned []
Running 1608 sub problems to find dead transitions.
[2024-05-23 16:34:32] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
[2024-05-23 16:34:32] [INFO ] Invariant cache hit.
[2024-05-23 16:34:32] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1694 variables, and 2 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 3 (OVERLAPS) 1077/1694 variables, 617/619 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 267/886 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 2494 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 31430 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 0/0 constraints]
After SMT, in 69197ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 69211ms
Starting structural reductions in SI_LTL mode, iteration 1 : 617/816 places, 1610/2110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71779 ms. Remains : 617/816 places, 1610/2110 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 375 ms.
Stack based approach found an accepted trace after 191 steps with 0 reset with depth 192 and stack size 192 in 1 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-09 finished in 72299 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(G(p0)))'
Support contains 2 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 800 transition count 2078
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 800 transition count 2078
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 44 place count 800 transition count 2066
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 788 transition count 2042
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 788 transition count 2042
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 79 place count 777 transition count 2016
Iterating global reduction 1 with 11 rules applied. Total rules applied 90 place count 777 transition count 2016
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 105 place count 762 transition count 1966
Iterating global reduction 1 with 15 rules applied. Total rules applied 120 place count 762 transition count 1966
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 135 place count 747 transition count 1920
Iterating global reduction 1 with 15 rules applied. Total rules applied 150 place count 747 transition count 1920
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 164 place count 733 transition count 1892
Iterating global reduction 1 with 14 rules applied. Total rules applied 178 place count 733 transition count 1892
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 192 place count 719 transition count 1864
Iterating global reduction 1 with 14 rules applied. Total rules applied 206 place count 719 transition count 1864
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 222 place count 703 transition count 1826
Iterating global reduction 1 with 16 rules applied. Total rules applied 238 place count 703 transition count 1826
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 258 place count 683 transition count 1768
Iterating global reduction 1 with 20 rules applied. Total rules applied 278 place count 683 transition count 1768
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 296 place count 665 transition count 1718
Iterating global reduction 1 with 18 rules applied. Total rules applied 314 place count 665 transition count 1718
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 324 place count 655 transition count 1696
Iterating global reduction 1 with 10 rules applied. Total rules applied 334 place count 655 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 344 place count 645 transition count 1676
Iterating global reduction 1 with 10 rules applied. Total rules applied 354 place count 645 transition count 1676
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 364 place count 635 transition count 1656
Iterating global reduction 1 with 10 rules applied. Total rules applied 374 place count 635 transition count 1656
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 384 place count 625 transition count 1636
Iterating global reduction 1 with 10 rules applied. Total rules applied 394 place count 625 transition count 1636
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 401 place count 618 transition count 1622
Iterating global reduction 1 with 7 rules applied. Total rules applied 408 place count 618 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 409 place count 617 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 410 place count 617 transition count 1620
Applied a total of 410 rules in 210 ms. Remains 617 /816 variables (removed 199) and now considering 1620/2110 (removed 490) transitions.
[2024-05-23 16:35:42] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
// Phase 1: matrix 1079 rows 617 cols
[2024-05-23 16:35:42] [INFO ] Computed 2 invariants in 17 ms
[2024-05-23 16:35:42] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-23 16:35:42] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
[2024-05-23 16:35:42] [INFO ] Invariant cache hit.
[2024-05-23 16:35:43] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 16:35:44] [INFO ] Implicit Places using invariants and state equation in 1822 ms returned []
Implicit Place search using SMT with State Equation took 2242 ms to find 0 implicit places.
Running 1618 sub problems to find dead transitions.
[2024-05-23 16:35:44] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
[2024-05-23 16:35:44] [INFO ] Invariant cache hit.
[2024-05-23 16:35:44] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1618/1618 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1696 variables, 617/619 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 265/884 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2502 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 31440 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1618/1618 constraints, Known Traps: 0/0 constraints]
After SMT, in 69388ms problems are : Problem set: 0 solved, 1618 unsolved
Search for dead transitions found 0 dead transitions in 69405ms
Starting structural reductions in LTL mode, iteration 1 : 617/816 places, 1620/2110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71862 ms. Remains : 617/816 places, 1620/2110 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 618 steps with 1 reset in 8 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-10 finished in 72032 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 1 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 799 transition count 2076
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 799 transition count 2076
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 48 place count 799 transition count 2062
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 785 transition count 2034
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 785 transition count 2034
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 785 transition count 2030
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 92 place count 773 transition count 2002
Iterating global reduction 2 with 12 rules applied. Total rules applied 104 place count 773 transition count 2002
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 120 place count 757 transition count 1950
Iterating global reduction 2 with 16 rules applied. Total rules applied 136 place count 757 transition count 1950
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 154 place count 739 transition count 1892
Iterating global reduction 2 with 18 rules applied. Total rules applied 172 place count 739 transition count 1892
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 189 place count 722 transition count 1852
Iterating global reduction 2 with 17 rules applied. Total rules applied 206 place count 722 transition count 1852
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 223 place count 705 transition count 1818
Iterating global reduction 2 with 17 rules applied. Total rules applied 240 place count 705 transition count 1818
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 259 place count 686 transition count 1774
Iterating global reduction 2 with 19 rules applied. Total rules applied 278 place count 686 transition count 1774
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 299 place count 665 transition count 1718
Iterating global reduction 2 with 21 rules applied. Total rules applied 320 place count 665 transition count 1718
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 339 place count 646 transition count 1670
Iterating global reduction 2 with 19 rules applied. Total rules applied 358 place count 646 transition count 1670
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 369 place count 635 transition count 1646
Iterating global reduction 2 with 11 rules applied. Total rules applied 380 place count 635 transition count 1646
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 388 place count 627 transition count 1630
Iterating global reduction 2 with 8 rules applied. Total rules applied 396 place count 627 transition count 1630
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 404 place count 619 transition count 1614
Iterating global reduction 2 with 8 rules applied. Total rules applied 412 place count 619 transition count 1614
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 420 place count 611 transition count 1598
Iterating global reduction 2 with 8 rules applied. Total rules applied 428 place count 611 transition count 1598
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 433 place count 606 transition count 1588
Iterating global reduction 2 with 5 rules applied. Total rules applied 438 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 439 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 440 place count 605 transition count 1586
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 442 place count 605 transition count 1584
Applied a total of 442 rules in 356 ms. Remains 605 /816 variables (removed 211) and now considering 1584/2110 (removed 526) transitions.
[2024-05-23 16:36:54] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-23 16:36:54] [INFO ] Computed 2 invariants in 4 ms
[2024-05-23 16:36:55] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-23 16:36:55] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 16:36:55] [INFO ] Invariant cache hit.
[2024-05-23 16:36:55] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 16:36:56] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2202 ms to find 0 implicit places.
[2024-05-23 16:36:56] [INFO ] Redundant transitions in 29 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 16:36:56] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 16:36:56] [INFO ] Invariant cache hit.
[2024-05-23 16:36:56] [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, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 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 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30027 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: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31407 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: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 68489ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 68503ms
Starting structural reductions in SI_LTL mode, iteration 1 : 605/816 places, 1584/2110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71102 ms. Remains : 605/816 places, 1584/2110 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 380 ms.
Product exploration explored 100000 steps with 0 reset in 429 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/605 stabilizing places and 512/1584 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 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 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40007 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 14536 steps (3 resets) in 21 ms. (660 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 92 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 70 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-23 16:38:06] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 16:38:06] [INFO ] Invariant cache hit.
[2024-05-23 16:38:07] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-23 16:38:07] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 16:38:07] [INFO ] Invariant cache hit.
[2024-05-23 16:38:07] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 16:38:08] [INFO ] Implicit Places using invariants and state equation in 1797 ms returned []
Implicit Place search using SMT with State Equation took 2192 ms to find 0 implicit places.
[2024-05-23 16:38:09] [INFO ] Redundant transitions in 24 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 16:38:09] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 16:38:09] [INFO ] Invariant cache hit.
[2024-05-23 16:38:09] [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, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30022 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: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31413 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: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 69113ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 69127ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71423 ms. Remains : 605/605 places, 1584/1584 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/605 stabilizing places and 512/1584 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33385 steps (7 resets) in 83 ms. (397 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 104 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 412 ms.
Product exploration explored 100000 steps with 0 reset in 487 ms.
Built C files in :
/tmp/ltsmin16120970856313011444
[2024-05-23 16:39:19] [INFO ] Too many transitions (1584) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:39:19] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16120970856313011444
Running compilation step : cd /tmp/ltsmin16120970856313011444;'/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/ltsmin16120970856313011444;'/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/ltsmin16120970856313011444;'/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 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 66 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-23 16:39:22] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 16:39:22] [INFO ] Invariant cache hit.
[2024-05-23 16:39:23] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-23 16:39:23] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 16:39:23] [INFO ] Invariant cache hit.
[2024-05-23 16:39:23] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 16:39:24] [INFO ] Implicit Places using invariants and state equation in 1831 ms returned []
Implicit Place search using SMT with State Equation took 2242 ms to find 0 implicit places.
[2024-05-23 16:39:24] [INFO ] Redundant transitions in 27 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 16:39:24] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 16:39:24] [INFO ] Invariant cache hit.
[2024-05-23 16:39:24] [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, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 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 3.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 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 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30024 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: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31407 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: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 68916ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 68929ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71273 ms. Remains : 605/605 places, 1584/1584 transitions.
Built C files in :
/tmp/ltsmin12594239978283517399
[2024-05-23 16:40:33] [INFO ] Too many transitions (1584) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:40:33] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12594239978283517399
Running compilation step : cd /tmp/ltsmin12594239978283517399;'/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/ltsmin12594239978283517399;'/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/ltsmin12594239978283517399;'/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 16:40:37] [INFO ] Flatten gal took : 35 ms
[2024-05-23 16:40:37] [INFO ] Flatten gal took : 36 ms
[2024-05-23 16:40:37] [INFO ] Time to serialize gal into /tmp/LTL18206165871007715670.gal : 5 ms
[2024-05-23 16:40:37] [INFO ] Time to serialize properties into /tmp/LTL2427895646752700195.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/LTL18206165871007715670.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8880561716804464237.hoa' '-atoms' '/tmp/LTL2427895646752700195.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/LTL2427895646752700195.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8880561716804464237.hoa
Detected timeout of ITS tools.
[2024-05-23 16:40:52] [INFO ] Flatten gal took : 34 ms
[2024-05-23 16:40:52] [INFO ] Flatten gal took : 35 ms
[2024-05-23 16:40:52] [INFO ] Time to serialize gal into /tmp/LTL547070655383493628.gal : 5 ms
[2024-05-23 16:40:52] [INFO ] Time to serialize properties into /tmp/LTL9577570194403817401.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/LTL547070655383493628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9577570194403817401.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("(l426<=0)"))))
Formula 0 simplified : FG!"(l426<=0)"
Detected timeout of ITS tools.
[2024-05-23 16:41:07] [INFO ] Flatten gal took : 39 ms
[2024-05-23 16:41:07] [INFO ] Applying decomposition
[2024-05-23 16:41:07] [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/graph14941449392638398624.txt' '-o' '/tmp/graph14941449392638398624.bin' '-w' '/tmp/graph14941449392638398624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14941449392638398624.bin' '-l' '-1' '-v' '-w' '/tmp/graph14941449392638398624.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:41:07] [INFO ] Decomposing Gal with order
[2024-05-23 16:41:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:41:07] [INFO ] Removed a total of 2627 redundant transitions.
[2024-05-23 16:41:07] [INFO ] Flatten gal took : 70 ms
[2024-05-23 16:41:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 1103 labels/synchronizations in 46 ms.
[2024-05-23 16:41:07] [INFO ] Time to serialize gal into /tmp/LTL6081715616960318659.gal : 18 ms
[2024-05-23 16:41:07] [INFO ] Time to serialize properties into /tmp/LTL4886954838693412319.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/LTL6081715616960318659.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4886954838693412319.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.u24.l426<=0)"))))
Formula 0 simplified : FG!"(i15.u24.l426<=0)"
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-13 finished in 268383 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 (p1||G(p0)))))'
Support contains 3 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 800 transition count 2078
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 800 transition count 2078
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 44 place count 800 transition count 2066
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 57 place count 787 transition count 2040
Iterating global reduction 1 with 13 rules applied. Total rules applied 70 place count 787 transition count 2040
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 787 transition count 2036
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 85 place count 776 transition count 2010
Iterating global reduction 2 with 11 rules applied. Total rules applied 96 place count 776 transition count 2010
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 764 transition count 1974
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 764 transition count 1974
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 135 place count 749 transition count 1928
Iterating global reduction 2 with 15 rules applied. Total rules applied 150 place count 749 transition count 1928
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 164 place count 735 transition count 1892
Iterating global reduction 2 with 14 rules applied. Total rules applied 178 place count 735 transition count 1892
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 192 place count 721 transition count 1864
Iterating global reduction 2 with 14 rules applied. Total rules applied 206 place count 721 transition count 1864
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 223 place count 704 transition count 1822
Iterating global reduction 2 with 17 rules applied. Total rules applied 240 place count 704 transition count 1822
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 259 place count 685 transition count 1768
Iterating global reduction 2 with 19 rules applied. Total rules applied 278 place count 685 transition count 1768
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 296 place count 667 transition count 1720
Iterating global reduction 2 with 18 rules applied. Total rules applied 314 place count 667 transition count 1720
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 328 place count 653 transition count 1688
Iterating global reduction 2 with 14 rules applied. Total rules applied 342 place count 653 transition count 1688
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 352 place count 643 transition count 1668
Iterating global reduction 2 with 10 rules applied. Total rules applied 362 place count 643 transition count 1668
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 372 place count 633 transition count 1648
Iterating global reduction 2 with 10 rules applied. Total rules applied 382 place count 633 transition count 1648
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 392 place count 623 transition count 1628
Iterating global reduction 2 with 10 rules applied. Total rules applied 402 place count 623 transition count 1628
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 408 place count 617 transition count 1616
Iterating global reduction 2 with 6 rules applied. Total rules applied 414 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 416 place count 615 transition count 1612
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 615 transition count 1612
Applied a total of 418 rules in 209 ms. Remains 615 /816 variables (removed 201) and now considering 1612/2110 (removed 498) transitions.
[2024-05-23 16:41:22] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 16:41:22] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 16:41:23] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-23 16:41:23] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 16:41:23] [INFO ] Invariant cache hit.
[2024-05-23 16:41:23] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 16:41:24] [INFO ] Implicit Places using invariants and state equation in 1624 ms returned []
Implicit Place search using SMT with State Equation took 2046 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 16:41:24] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 16:41:24] [INFO ] Invariant cache hit.
[2024-05-23 16:41:24] [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: (timeout
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 30026 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 31464 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 68983ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 68997ms
Starting structural reductions in LTL mode, iteration 1 : 615/816 places, 1612/2110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71256 ms. Remains : 615/816 places, 1612/2110 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-15 finished in 71370 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' '!(F((G(F(p0))||G(p1))))'
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' '!(F(G((X(F(p0)) U (p1||F(p2))))))'
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(G((p0||X(F(!p0))))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c008-LTLCardinality-07
Stuttering acceptance computed with spot in 111 ms :[false, false, p0]
Support contains 2 out of 816 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 816/816 places, 2110/2110 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 801 transition count 2080
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 801 transition count 2080
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 42 place count 801 transition count 2068
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 787 transition count 2040
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 787 transition count 2040
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 787 transition count 2036
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 86 place count 775 transition count 2008
Iterating global reduction 2 with 12 rules applied. Total rules applied 98 place count 775 transition count 2008
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 114 place count 759 transition count 1956
Iterating global reduction 2 with 16 rules applied. Total rules applied 130 place count 759 transition count 1956
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 147 place count 742 transition count 1900
Iterating global reduction 2 with 17 rules applied. Total rules applied 164 place count 742 transition count 1900
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 180 place count 726 transition count 1862
Iterating global reduction 2 with 16 rules applied. Total rules applied 196 place count 726 transition count 1862
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 212 place count 710 transition count 1830
Iterating global reduction 2 with 16 rules applied. Total rules applied 228 place count 710 transition count 1830
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 246 place count 692 transition count 1788
Iterating global reduction 2 with 18 rules applied. Total rules applied 264 place count 692 transition count 1788
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 283 place count 673 transition count 1740
Iterating global reduction 2 with 19 rules applied. Total rules applied 302 place count 673 transition count 1740
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 320 place count 655 transition count 1696
Iterating global reduction 2 with 18 rules applied. Total rules applied 338 place count 655 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 348 place count 645 transition count 1672
Iterating global reduction 2 with 10 rules applied. Total rules applied 358 place count 645 transition count 1672
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 365 place count 638 transition count 1658
Iterating global reduction 2 with 7 rules applied. Total rules applied 372 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 379 place count 631 transition count 1644
Iterating global reduction 2 with 7 rules applied. Total rules applied 386 place count 631 transition count 1644
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 393 place count 624 transition count 1630
Iterating global reduction 2 with 7 rules applied. Total rules applied 400 place count 624 transition count 1630
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 404 place count 620 transition count 1622
Iterating global reduction 2 with 4 rules applied. Total rules applied 408 place count 620 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 410 place count 618 transition count 1618
Iterating global reduction 2 with 2 rules applied. Total rules applied 412 place count 618 transition count 1618
Applied a total of 412 rules in 261 ms. Remains 618 /816 variables (removed 198) and now considering 1618/2110 (removed 492) transitions.
[2024-05-23 16:42:34] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2024-05-23 16:42:34] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 16:42:35] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-23 16:42:35] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 16:42:35] [INFO ] Invariant cache hit.
[2024-05-23 16:42:35] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 16:42:37] [INFO ] Implicit Places using invariants and state equation in 1860 ms returned []
Implicit Place search using SMT with State Equation took 2299 ms to find 0 implicit places.
Running 1616 sub problems to find dead transitions.
[2024-05-23 16:42:37] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-23 16:42:37] [INFO ] Invariant cache hit.
[2024-05-23 16:42:37] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1698 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1698 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1698 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1698/1698 variables, and 2503 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 31455 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
After SMT, in 69354ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 69371ms
Starting structural reductions in LI_LTL mode, iteration 1 : 618/816 places, 1618/2110 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 71936 ms. Remains : 618/816 places, 1618/2110 transitions.
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-07
Product exploration explored 100000 steps with 24985 reset in 418 ms.
Product exploration explored 100000 steps with 25089 reset in 429 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[false, p0]
RANDOM walk for 18993 steps (4 resets) in 58 ms. (321 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
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 63 ms :[false, p0]
Stuttering acceptance computed with spot in 60 ms :[false, p0]
Support contains 2 out of 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1618/1618 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 618 transition count 1614
Applied a total of 4 rules in 140 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1618 (removed 4) transitions.
[2024-05-23 16:43:47] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
// Phase 1: matrix 1078 rows 618 cols
[2024-05-23 16:43:47] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 16:43:48] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-23 16:43:48] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 16:43:48] [INFO ] Invariant cache hit.
[2024-05-23 16:43:48] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 16:43:49] [INFO ] Implicit Places using invariants and state equation in 1726 ms returned []
Implicit Place search using SMT with State Equation took 2154 ms to find 0 implicit places.
[2024-05-23 16:43:50] [INFO ] Redundant transitions in 30 ms returned []
Running 1612 sub problems to find dead transitions.
[2024-05-23 16:43:50] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 16:43:50] [INFO ] Invariant cache hit.
[2024-05-23 16:43:50] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 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, 1612 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/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1696 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2499 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 31450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
After SMT, in 69409ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 69425ms
Starting structural reductions in SI_LTL mode, iteration 1 : 618/618 places, 1614/1618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71762 ms. Remains : 618/618 places, 1614/1618 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 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 77 ms :[false, p0]
RANDOM walk for 40001 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 119 steps, run visited all 1 properties in 3 ms. (steps per millisecond=39 )
Probabilistic random walk after 119 steps, saw 97 distinct states, run finished after 7 ms. (steps per millisecond=17 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 87 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 59 ms :[false, p0]
Stuttering acceptance computed with spot in 73 ms :[false, p0]
Stuttering acceptance computed with spot in 70 ms :[false, p0]
Product exploration explored 100000 steps with 33259 reset in 445 ms.
Product exploration explored 100000 steps with 33322 reset in 450 ms.
Built C files in :
/tmp/ltsmin7171962198776897756
[2024-05-23 16:45:00] [INFO ] Too many transitions (1614) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:45:00] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7171962198776897756
Running compilation step : cd /tmp/ltsmin7171962198776897756;'/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/ltsmin7171962198776897756;'/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/ltsmin7171962198776897756;'/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 618 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 618/618 places, 1614/1614 transitions.
Applied a total of 0 rules in 75 ms. Remains 618 /618 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2024-05-23 16:45:04] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 16:45:04] [INFO ] Invariant cache hit.
[2024-05-23 16:45:04] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-23 16:45:04] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 16:45:04] [INFO ] Invariant cache hit.
[2024-05-23 16:45:04] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 16:45:06] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 2153 ms to find 0 implicit places.
[2024-05-23 16:45:06] [INFO ] Redundant transitions in 26 ms returned []
Running 1612 sub problems to find dead transitions.
[2024-05-23 16:45:06] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 16:45:06] [INFO ] Invariant cache hit.
[2024-05-23 16:45:06] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 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, 1612 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1696 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 267/887 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2499 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 31349 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
After SMT, in 68902ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 68917ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71179 ms. Remains : 618/618 places, 1614/1614 transitions.
Built C files in :
/tmp/ltsmin15311797439210588270
[2024-05-23 16:46:15] [INFO ] Too many transitions (1614) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:46:15] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15311797439210588270
Running compilation step : cd /tmp/ltsmin15311797439210588270;'/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/ltsmin15311797439210588270;'/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/ltsmin15311797439210588270;'/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 16:46:18] [INFO ] Flatten gal took : 32 ms
[2024-05-23 16:46:18] [INFO ] Flatten gal took : 42 ms
[2024-05-23 16:46:18] [INFO ] Time to serialize gal into /tmp/LTL7723681432697574212.gal : 5 ms
[2024-05-23 16:46:18] [INFO ] Time to serialize properties into /tmp/LTL7822648943786093269.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/LTL7723681432697574212.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10885227131553226311.hoa' '-atoms' '/tmp/LTL7822648943786093269.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/LTL7822648943786093269.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10885227131553226311.hoa
Detected timeout of ITS tools.
[2024-05-23 16:46:33] [INFO ] Flatten gal took : 31 ms
[2024-05-23 16:46:33] [INFO ] Flatten gal took : 32 ms
[2024-05-23 16:46:33] [INFO ] Time to serialize gal into /tmp/LTL14852957174740100566.gal : 4 ms
[2024-05-23 16:46:33] [INFO ] Time to serialize properties into /tmp/LTL12595632595254506563.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/LTL14852957174740100566.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12595632595254506563.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(G(("(l2303>l1034)")||(X(F("(l2303<=l1034)")))))))
Formula 0 simplified : XF(!"(l2303>l1034)" & XG!"(l2303<=l1034)")
Detected timeout of ITS tools.
[2024-05-23 16:46:48] [INFO ] Flatten gal took : 34 ms
[2024-05-23 16:46:48] [INFO ] Applying decomposition
[2024-05-23 16:46:48] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17370857060373497371.txt' '-o' '/tmp/graph17370857060373497371.bin' '-w' '/tmp/graph17370857060373497371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17370857060373497371.bin' '-l' '-1' '-v' '-w' '/tmp/graph17370857060373497371.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:46:48] [INFO ] Decomposing Gal with order
[2024-05-23 16:46:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:46:48] [INFO ] Removed a total of 469 redundant transitions.
[2024-05-23 16:46:48] [INFO ] Flatten gal took : 66 ms
[2024-05-23 16:46:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 5 ms.
[2024-05-23 16:46:48] [INFO ] Time to serialize gal into /tmp/LTL15993521233906474686.gal : 6 ms
[2024-05-23 16:46:48] [INFO ] Time to serialize properties into /tmp/LTL10657162993314654023.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/LTL15993521233906474686.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10657162993314654023.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(G(("(gu53.l2303>gu53.l1034)")||(X(F("(gu53.l2303<=gu53.l1034)")))))))
Formula 0 simplified : XF(!"(gu53.l2303>gu53.l1034)" & XG!"(gu53.l2303<=gu53.l1034)")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-07 finished in 269525 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)))'
[2024-05-23 16:47:03] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3287914001264179091
[2024-05-23 16:47:03] [INFO ] Too many transitions (2110) to apply POR reductions. Disabling POR matrices.
[2024-05-23 16:47:03] [INFO ] Applying decomposition
[2024-05-23 16:47:03] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3287914001264179091
Running compilation step : cd /tmp/ltsmin3287914001264179091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' '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 16:47:04] [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/graph14796256127736617615.txt' '-o' '/tmp/graph14796256127736617615.bin' '-w' '/tmp/graph14796256127736617615.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14796256127736617615.bin' '-l' '-1' '-v' '-w' '/tmp/graph14796256127736617615.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:47:04] [INFO ] Decomposing Gal with order
[2024-05-23 16:47:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:47:04] [INFO ] Removed a total of 2006 redundant transitions.
[2024-05-23 16:47:04] [INFO ] Flatten gal took : 201 ms
[2024-05-23 16:47:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 727 labels/synchronizations in 23 ms.
[2024-05-23 16:47:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality16780010359808618274.gal : 8 ms
[2024-05-23 16:47:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality14404655939183059977.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/LTLCardinality16780010359808618274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14404655939183059977.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...299
Read 4 LTL properties
Checking formula 0 : !((F((G(F("(gi0.gu0.l1024<=0)")))||(G("(gi0.gu2.l1978>=3)")))))
Formula 0 simplified : G(FG!"(gi0.gu0.l1024<=0)" & F!"(gi0.gu2.l1978>=3)")
Compilation finished in 5090 ms.
Running link step : cd /tmp/ltsmin3287914001264179091;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin3287914001264179091;'/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' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin3287914001264179091;'/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' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3287914001264179091;'/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(<>((LTLAPp2==true))) U ((LTLAPp3==true)||<>((LTLAPp4==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin3287914001264179091;'/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(<>((LTLAPp2==true))) U ((LTLAPp3==true)||<>((LTLAPp4==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3287914001264179091;'/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([](((LTLAPp5==true)||X(<>(!(LTLAPp5==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin3287914001264179091;'/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([](((LTLAPp5==true)||X(<>(!(LTLAPp5==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3287914001264179091;'/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' '[](<>((LTLAPp6==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin3287914001264179091;'/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' '[](<>((LTLAPp6==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin3287914001264179091;'/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' '<>(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 289203 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin3287914001264179091;'/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(<>((LTLAPp2==true))) U ((LTLAPp3==true)||<>((LTLAPp4==true))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-23 17:11:48] [INFO ] Flatten gal took : 156 ms
[2024-05-23 17:11:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality8247153044728931313.gal : 9 ms
[2024-05-23 17:11:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality14845734199660703004.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/LTLCardinality8247153044728931313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14845734199660703004.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...298
Read 3 LTL properties
Checking formula 0 : !((F(G((X(F("(p1179>=2)")))U(("(l390>=3)")||(F("(l655<=l1199)")))))))
Formula 0 simplified : GF(XG!"(p1179>=2)" R (!"(l390>=3)" & G!"(l655<=l1199)"))
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.265: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.265: LTL layer: formula: <>([]((X(<>((LTLAPp2==true))) U ((LTLAPp3==true)||<>((LTLAPp4==true))))))
pins2lts-mc-linux64( 4/ 8), 0.265: "<>([]((X(<>((LTLAPp2==true))) U ((LTLAPp3==true)||<>((LTLAPp4==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.265: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.278: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.285: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.290: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.292: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.293: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.296: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.298: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.671: There are 2118 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.671: State length is 817, there are 2119 groups
pins2lts-mc-linux64( 0/ 8), 0.671: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.671: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.671: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.671: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.785: [Blue] ~120 levels ~960 states ~4680 transitions
pins2lts-mc-linux64( 1/ 8), 0.885: [Blue] ~240 levels ~1920 states ~9320 transitions
pins2lts-mc-linux64( 1/ 8), 1.013: [Blue] ~480 levels ~3840 states ~18600 transitions
pins2lts-mc-linux64( 1/ 8), 1.288: [Blue] ~960 levels ~7680 states ~37160 transitions
pins2lts-mc-linux64( 1/ 8), 2.034: [Blue] ~1920 levels ~15360 states ~74280 transitions
pins2lts-mc-linux64( 1/ 8), 3.383: [Blue] ~3840 levels ~30720 states ~148520 transitions
pins2lts-mc-linux64( 1/ 8), 5.891: [Blue] ~7680 levels ~61440 states ~297000 transitions
pins2lts-mc-linux64( 7/ 8), 10.494: [Blue] ~15360 levels ~122880 states ~634712 transitions
pins2lts-mc-linux64( 7/ 8), 19.013: [Blue] ~30720 levels ~245760 states ~1257864 transitions
pins2lts-mc-linux64( 7/ 8), 35.702: [Blue] ~61440 levels ~491520 states ~2504144 transitions
pins2lts-mc-linux64( 7/ 8), 69.311: [Blue] ~122880 levels ~983040 states ~4996880 transitions
pins2lts-mc-linux64( 7/ 8), 136.064: [Blue] ~245760 levels ~1966080 states ~9982264 transitions
pins2lts-mc-linux64( 7/ 8), 298.189: [Blue] ~491520 levels ~3932160 states ~19953184 transitions
pins2lts-mc-linux64( 0/ 8), 478.464: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 478.570:
pins2lts-mc-linux64( 0/ 8), 478.570: Explored 6188788 states 42681967 transitions, fanout: 6.897
pins2lts-mc-linux64( 0/ 8), 478.570: Total exploration time 477.890 sec (477.770 sec minimum, 477.810 sec on average)
pins2lts-mc-linux64( 0/ 8), 478.571: States per second: 12950, Transitions per second: 89313
pins2lts-mc-linux64( 0/ 8), 478.571:
pins2lts-mc-linux64( 0/ 8), 478.571: State space has 35667529 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 478.571: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 478.571: blue states: 6188788 (17.35%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 478.571: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 478.571: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 478.571:
pins2lts-mc-linux64( 0/ 8), 478.571: Total memory used for local state coloring: 93.0MB
pins2lts-mc-linux64( 0/ 8), 478.571:
pins2lts-mc-linux64( 0/ 8), 478.571: Queue width: 8B, total height: 6093107, memory: 46.49MB
pins2lts-mc-linux64( 0/ 8), 478.571: Tree memory: 528.1MB, 15.5 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 478.571: Tree fill ratio (roots/leafs): 26.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 478.571: Stored 2256 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 478.571: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 478.571: Est. total memory use: 574.6MB (~1070.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3287914001264179091;'/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(<>((LTLAPp2==true))) U ((LTLAPp3==true)||<>((LTLAPp4==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3287914001264179091;'/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(<>((LTLAPp2==true))) U ((LTLAPp3==true)||<>((LTLAPp4==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:840)
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -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-c008"
export BK_EXAMINATION="LTLCardinality"
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-c008, examination is LTLCardinality"
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-171640603100291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c008.tgz
mv FunctionPointer-PT-c008 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;