About the Execution of ITS-Tools for QuasiCertifProtocol-COL-28
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16198.676 | 3600000.00 | 5374993.00 | 10167.60 | TFFFFTTFTFFFF??? | 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.r312-tall-171662337700043.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 QuasiCertifProtocol-COL-28, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337700043
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.5K Apr 13 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 03:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 120K May 18 16:43 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 QuasiCertifProtocol-COL-28-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716660147235
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-28
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-25 18:02:28] [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-25 18:02:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 18:02:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 18:02:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 18:02:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 630 ms
[2024-05-25 18:02:29] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 18:02:29] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-05-25 18:02:29] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40023 steps (1022 resets) in 664 ms. (60 steps per ms) remains 17/31 properties
BEST_FIRST walk for 4003 steps (33 resets) in 59 ms. (66 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4013 steps (32 resets) in 43 ms. (91 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (56 resets) in 92 ms. (43 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (33 resets) in 79 ms. (50 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (33 resets) in 91 ms. (43 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (29 resets) in 62 ms. (63 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (56 resets) in 46 ms. (85 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (31 resets) in 80 ms. (49 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (32 resets) in 62 ms. (63 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (34 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (33 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (33 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (44 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (56 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (32 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 18:02:29] [INFO ] Computed 5 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 9/28 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 26/54 variables, 28/33 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/56 variables, 2/35 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 3 solved, 14 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 10/27 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 14 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 3 (OVERLAPS) 26/53 variables, 27/32 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 7/39 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/39 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 3/56 variables, 3/42 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 6/48 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/48 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/48 constraints. Problems are: Problem set: 4 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 48 constraints, problems are : Problem set: 4 solved, 13 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 13/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 673ms problems are : Problem set: 4 solved, 13 unsolved
Fused 13 Parikh solutions to 10 different solutions.
Finished Parikh walk after 17082 steps, including 110 resets, run visited all 13 properties in 57 ms. (steps per millisecond=299 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 62 ms.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 18:02:30] [INFO ] Flatten gal took : 16 ms
[2024-05-25 18:02:30] [INFO ] Flatten gal took : 3 ms
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2024-05-25 18:02:30] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 33 ms.
[2024-05-25 18:02:30] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 2038 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Applied a total of 0 rules in 102 ms. Remains 2998 /2998 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2998 cols
[2024-05-25 18:02:30] [INFO ] Computed 2553 invariants in 122 ms
[2024-05-25 18:02:32] [INFO ] Implicit Places using invariants in 1753 ms returned []
[2024-05-25 18:02:32] [INFO ] Invariant cache hit.
[2024-05-25 18:02:37] [INFO ] Implicit Places using invariants and state equation in 4947 ms returned []
Implicit Place search using SMT with State Equation took 6710 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:02:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 1708/1708 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2935/3444 variables, and 1708 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 1708/2549 constraints, State Equation: 0/2998 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 1708/1708 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2935 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 63/2998 variables, 4/1712 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2998 variables, 841/2553 constraints. Problems are: Problem set: 0 solved, 416 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 Int declared 2998/3444 variables, and 2553 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2549/2549 constraints, State Equation: 0/2998 constraints, PredecessorRefiner: 0/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60879ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60895ms
Finished structural reductions in LTL mode , in 1 iterations and 67724 ms. Remains : 2998/2998 places, 446/446 transitions.
Support contains 2038 out of 2998 places after structural reductions.
[2024-05-25 18:03:38] [INFO ] Flatten gal took : 186 ms
[2024-05-25 18:03:38] [INFO ] Flatten gal took : 119 ms
[2024-05-25 18:03:39] [INFO ] Input system was already deterministic with 446 transitions.
Support contains 2037 out of 2998 places (down from 2038) after GAL structural reductions.
RANDOM walk for 40000 steps (1209 resets) in 3229 ms. (12 steps per ms) remains 15/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
[2024-05-25 18:03:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1624/1624 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 2 (OVERLAPS) 92/2069 variables, 3/1627 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2069 variables, 0/1627 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/2070 variables, 1/1628 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2070 variables, 0/1628 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 928/2998 variables, 925/2553 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2998 variables, 0/2553 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 446/3444 variables, 2998/5551 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3444/3444 variables, and 5551 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2549/2549 constraints, State Equation: 2998/2998 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1624/1624 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1624 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 92/2069 variables, 3/1627 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-25 18:03:48] [INFO ] Deduced a trap composed of 5 places in 1076 ms of which 107 ms to minimize.
[2024-05-25 18:03:50] [INFO ] Deduced a trap composed of 5 places in 1076 ms of which 13 ms to minimize.
SMT process timed out in 10722ms, After SMT, problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1977 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2967 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.14 ms
Discarding 31 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 2967 transition count 388
Applied a total of 59 rules in 89 ms. Remains 2967 /2998 variables (removed 31) and now considering 388/446 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 2967/2998 places, 388/446 transitions.
RANDOM walk for 40000 steps (1206 resets) in 2609 ms. (15 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (59 resets) in 196 ms. (203 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (63 resets) in 281 ms. (141 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (56 resets) in 769 ms. (51 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (57 resets) in 216 ms. (184 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (61 resets) in 223 ms. (178 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (58 resets) in 223 ms. (178 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (56 resets) in 223 ms. (178 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (60 resets) in 217 ms. (183 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (53 resets) in 149 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (56 resets) in 191 ms. (208 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (80 resets) in 228 ms. (174 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (58 resets) in 622 ms. (64 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (65 resets) in 654 ms. (61 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (80 resets) in 249 ms. (160 steps per ms) remains 14/14 properties
Finished probabilistic random walk after 5151 steps, run visited all 14 properties in 313 ms. (steps per millisecond=16 )
Probabilistic random walk after 5151 steps, saw 5002 distinct states, run finished after 318 ms. (steps per millisecond=16 ) properties seen :14
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 2998 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2998 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 29 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2906 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.27 ms
Discarding 92 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2903 transition count 441
Applied a total of 5 rules in 598 ms. Remains 2903 /2998 variables (removed 95) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2024-05-25 18:03:54] [INFO ] Computed 2464 invariants in 164 ms
[2024-05-25 18:03:58] [INFO ] Implicit Places using invariants in 4043 ms returned []
[2024-05-25 18:03:58] [INFO ] Invariant cache hit.
[2024-05-25 18:04:21] [INFO ] Implicit Places using invariants and state equation in 23155 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 27207 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2845/2998 places, 441/446 transitions.
Applied a total of 0 rules in 176 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27982 ms. Remains : 2845/2998 places, 441/446 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-00
Product exploration explored 100000 steps with 2816 reset in 521 ms.
Product exploration explored 100000 steps with 2810 reset in 446 ms.
Computed a total of 2845 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2845 transition count 441
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-00 finished in 29606 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(G(p0))&&F(p1))))'
Support contains 61 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2937 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.10 ms
Discarding 61 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2936 transition count 445
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2936 transition count 445
Applied a total of 4 rules in 482 ms. Remains 2936 /2998 variables (removed 62) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 2936 cols
[2024-05-25 18:04:23] [INFO ] Computed 2492 invariants in 37 ms
[2024-05-25 18:04:27] [INFO ] Implicit Places using invariants in 4133 ms returned []
[2024-05-25 18:04:27] [INFO ] Invariant cache hit.
[2024-05-25 18:04:37] [INFO ] Implicit Places using invariants and state equation in 9642 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 13778 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2907/2998 places, 445/446 transitions.
Applied a total of 0 rules in 162 ms. Remains 2907 /2907 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14422 ms. Remains : 2907/2998 places, 445/446 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-01
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-01 finished in 14564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1||G(!p0))))'
Support contains 843 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2938 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.12 ms
Discarding 60 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2935 transition count 443
Applied a total of 5 rules in 187 ms. Remains 2935 /2998 variables (removed 63) and now considering 443/446 (removed 3) transitions.
// Phase 1: matrix 443 rows 2935 cols
[2024-05-25 18:04:38] [INFO ] Computed 2493 invariants in 84 ms
[2024-05-25 18:04:40] [INFO ] Implicit Places using invariants in 2780 ms returned []
[2024-05-25 18:04:40] [INFO ] Invariant cache hit.
[2024-05-25 18:04:54] [INFO ] Implicit Places using invariants and state equation in 13679 ms returned [2670, 2671, 2672, 2673, 2674, 2675, 2676, 2677, 2678, 2679, 2680, 2681, 2682, 2683, 2684, 2685, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2693, 2694, 2695, 2696, 2697, 2698, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755, 2756]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 16464 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2877/2998 places, 443/446 transitions.
Applied a total of 0 rules in 90 ms. Remains 2877 /2877 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16741 ms. Remains : 2877/2998 places, 443/446 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) p0), (NOT p0), p0, true]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-02
Product exploration explored 100000 steps with 3099 reset in 2283 ms.
Product exploration explored 100000 steps with 3126 reset in 2207 ms.
Computed a total of 2877 stabilizing places and 443 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2877 transition count 443
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 409 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND p0 (NOT p1)), (NOT p0), p0, true]
RANDOM walk for 40000 steps (1123 resets) in 1277 ms. (31 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 538 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (32 resets) in 452 ms. (88 steps per ms) remains 2/2 properties
// Phase 1: matrix 443 rows 2877 cols
[2024-05-25 18:05:01] [INFO ] Computed 2436 invariants in 53 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/843 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/872 variables, 812/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/872 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 812/1684 variables, 784/1596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1684 variables, 0/1596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 262/1946 variables, 1684/3280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1946 variables, 0/3280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 410/2356 variables, 234/3514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2356 variables, 0/3514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 29/2385 variables, 28/3542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2385 variables, 29/3571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2385 variables, 0/3571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 933/3318 variables, 929/4500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3318 variables, 812/5312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3318 variables, 0/5312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3320 variables, 1/5313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3320 variables, 0/5313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/3320 variables, 0/5313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3320/3320 variables, and 5313 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1859 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2877/2877 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/843 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/872 variables, 812/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/872 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 812/1684 variables, 784/1596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1684 variables, 0/1596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 262/1946 variables, 1684/3280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1946 variables, 0/3280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 410/2356 variables, 234/3514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2356 variables, 2/3516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2356/3320 variables, and 3516 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3508 ms.
Refiners :[Generalized P Invariants (flows): 1596/2436 constraints, State Equation: 1918/2877 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 5493ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 843 out of 2877 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2877/2877 places, 443/443 transitions.
Graph (complete) has 30106 edges and 2877 vertex of which 2007 are kept as prefixes of interest. Removing 870 places using SCC suffix rule.7 ms
Discarding 870 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Drop transitions (Empty/Sink Transition effects.) removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 2007 transition count 351
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 92 place count 1979 transition count 323
Iterating global reduction 1 with 28 rules applied. Total rules applied 120 place count 1979 transition count 323
Applied a total of 120 rules in 97 ms. Remains 1979 /2877 variables (removed 898) and now considering 323/443 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 1979/2877 places, 323/443 transitions.
RANDOM walk for 40000 steps (1158 resets) in 1395 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (23 resets) in 478 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (34 resets) in 436 ms. (91 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 5281 steps, run visited all 2 properties in 203 ms. (steps per millisecond=26 )
Probabilistic random walk after 5281 steps, saw 5166 distinct states, run finished after 205 ms. (steps per millisecond=25 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 9 factoid took 493 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-02 finished in 30076 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)||F(p1))))'
Support contains 58 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 149 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 18:05:08] [INFO ] Computed 2492 invariants in 57 ms
[2024-05-25 18:05:12] [INFO ] Implicit Places using invariants in 4211 ms returned []
[2024-05-25 18:05:12] [INFO ] Invariant cache hit.
[2024-05-25 18:05:23] [INFO ] Implicit Places using invariants and state equation in 11573 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 15789 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2998 places, 446/446 transitions.
Applied a total of 0 rules in 141 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16081 ms. Remains : 2907/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 665 ms.
Product exploration explored 100000 steps with 50000 reset in 675 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 21 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-05 finished in 18054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 871 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 83 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:05:26] [INFO ] Invariant cache hit.
[2024-05-25 18:05:28] [INFO ] Implicit Places using invariants in 2394 ms returned []
[2024-05-25 18:05:28] [INFO ] Invariant cache hit.
[2024-05-25 18:05:32] [INFO ] Implicit Places using invariants and state equation in 3765 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 6162 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2998 places, 446/446 transitions.
Applied a total of 0 rules in 70 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6315 ms. Remains : 2907/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-07 finished in 6485 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(p0))'
Support contains 31 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2906 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.6 ms
Discarding 92 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2905 transition count 443
Applied a total of 3 rules in 303 ms. Remains 2905 /2998 variables (removed 93) and now considering 443/446 (removed 3) transitions.
// Phase 1: matrix 443 rows 2905 cols
[2024-05-25 18:05:32] [INFO ] Computed 2464 invariants in 58 ms
[2024-05-25 18:05:36] [INFO ] Implicit Places using invariants in 4193 ms returned []
[2024-05-25 18:05:36] [INFO ] Invariant cache hit.
[2024-05-25 18:05:53] [INFO ] Implicit Places using invariants and state equation in 16904 ms returned [2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 21101 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2876/2998 places, 443/446 transitions.
Applied a total of 0 rules in 158 ms. Remains 2876 /2876 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21562 ms. Remains : 2876/2998 places, 443/446 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-10
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-10 finished in 21619 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 30 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 269 are kept as prefixes of interest. Removing 2729 places using SCC suffix rule.8 ms
Discarding 2729 places :
Also discarding 145 output transitions
Drop transitions (Output transitions of discarded places.) removed 145 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 268 transition count 185
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 268 transition count 185
Applied a total of 117 rules in 23 ms. Remains 268 /2998 variables (removed 2730) and now considering 185/446 (removed 261) transitions.
// Phase 1: matrix 185 rows 268 cols
[2024-05-25 18:05:54] [INFO ] Computed 84 invariants in 1 ms
[2024-05-25 18:05:54] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-25 18:05:54] [INFO ] Invariant cache hit.
[2024-05-25 18:05:54] [INFO ] Implicit Places using invariants and state equation in 214 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 350 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/2998 places, 185/446 transitions.
Applied a total of 0 rules in 4 ms. Remains 239 /239 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 377 ms. Remains : 239/2998 places, 185/446 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-11
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-11 finished in 455 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((X(G(p1))||p0))))'
Support contains 59 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 2937 transition count 446
Applied a total of 61 rules in 147 ms. Remains 2937 /2998 variables (removed 61) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2937 cols
[2024-05-25 18:05:54] [INFO ] Computed 2492 invariants in 35 ms
[2024-05-25 18:05:58] [INFO ] Implicit Places using invariants in 4092 ms returned []
[2024-05-25 18:05:58] [INFO ] Invariant cache hit.
[2024-05-25 18:06:09] [INFO ] Implicit Places using invariants and state equation in 11159 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 15253 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2998 places, 446/446 transitions.
Applied a total of 0 rules in 137 ms. Remains 2908 /2908 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15537 ms. Remains : 2908/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-12 finished in 15709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((G(F(p0))||G(p1)))) U G(p2))))'
Support contains 88 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 136 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 18:06:10] [INFO ] Computed 2492 invariants in 58 ms
[2024-05-25 18:06:14] [INFO ] Implicit Places using invariants in 4091 ms returned []
[2024-05-25 18:06:14] [INFO ] Invariant cache hit.
[2024-05-25 18:06:20] [INFO ] Implicit Places using invariants and state equation in 6413 ms returned []
Implicit Place search using SMT with State Equation took 10511 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:06:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2935/3382 variables, and 2492 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2935 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3381 variables, 2935/5427 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3381 variables, 416/5843 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3381/3382 variables, and 5843 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2935/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60672ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60677ms
Starting structural reductions in LTL mode, iteration 1 : 2936/2998 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71329 ms. Remains : 2936/2998 places, 446/446 transitions.
Stuttering acceptance computed with spot in 367 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-13
Product exploration explored 100000 steps with 3030 reset in 383 ms.
Product exploration explored 100000 steps with 3025 reset in 396 ms.
Computed a total of 2936 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2936 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 282 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (1209 resets) in 423 ms. (94 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (45 resets) in 155 ms. (256 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (59 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (62 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (55 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
[2024-05-25 18:07:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1711/1799 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1799 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 350/2149 variables, 1799/3451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2149 variables, 0/3451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1108/3257 variables, 1018/4469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 0/5253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 121/3378 variables, 117/5370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3378 variables, 56/5426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3378 variables, 0/5426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/3382 variables, 2/5428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3382 variables, 0/5428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/3382 variables, 0/5428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 3382/3382 variables, and 5428 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3010 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2936/2936 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1711/1799 variables, 1652/1652 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1799 variables, 0/1652 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 350/2149 variables, 1799/3451 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2149 variables, 0/3451 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1108/3257 variables, 1018/4469 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5253 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 3/5256 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3257/3382 variables, and 5256 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4112 ms.
Refiners :[Generalized P Invariants (flows): 2436/2492 constraints, State Equation: 2817/2936 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 7161ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 317 ms.
Support contains 88 out of 2936 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2065 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.3 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 2065 transition count 410
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 2064 transition count 409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 2063 transition count 409
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 66 place count 2035 transition count 381
Iterating global reduction 3 with 28 rules applied. Total rules applied 94 place count 2035 transition count 381
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 3 with 29 rules applied. Total rules applied 123 place count 2035 transition count 352
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 152 place count 2006 transition count 352
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 2005 transition count 351
Applied a total of 153 rules in 323 ms. Remains 2005 /2936 variables (removed 931) and now considering 351/446 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 2005/2936 places, 351/446 transitions.
RANDOM walk for 40000 steps (1154 resets) in 602 ms. (66 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (44 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (44 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (33 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 5743 steps, run visited all 3 properties in 93 ms. (steps per millisecond=61 )
Probabilistic random walk after 5743 steps, saw 5628 distinct states, run finished after 94 ms. (steps per millisecond=61 ) properties seen :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) p2 p0))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (OR p1 p2 p0))), (F (NOT p0)), (F (NOT (OR p1 (NOT p2)))), (F p1)]
Knowledge based reduction with 7 factoid took 1064 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 381 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 340 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
[2024-05-25 18:07:34] [INFO ] Invariant cache hit.
[2024-05-25 18:07:42] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 7289 ms returned sat
[2024-05-25 18:07:49] [INFO ] [Real]Absence check using state equation in 6764 ms returned unknown
Could not prove EG (NOT p2)
Support contains 88 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 137 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:07:49] [INFO ] Invariant cache hit.
[2024-05-25 18:07:53] [INFO ] Implicit Places using invariants in 3892 ms returned []
[2024-05-25 18:07:53] [INFO ] Invariant cache hit.
[2024-05-25 18:07:59] [INFO ] Implicit Places using invariants and state equation in 6656 ms returned []
Implicit Place search using SMT with State Equation took 10554 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:07:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2935/3382 variables, and 2492 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2935 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3381 variables, 2935/5427 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3381 variables, 416/5843 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3381/3382 variables, and 5843 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2935/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60711ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60716ms
Finished structural reductions in LTL mode , in 1 iterations and 71409 ms. Remains : 2936/2936 places, 446/446 transitions.
Computed a total of 2936 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2936 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 274 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (1208 resets) in 252 ms. (158 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (63 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (55 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
[2024-05-25 18:09:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1711/1799 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1799 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 350/2149 variables, 1799/3451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2149 variables, 0/3451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1108/3257 variables, 1018/4469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 0/5253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 121/3378 variables, 117/5370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3378 variables, 56/5426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3378 variables, 0/5426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/3382 variables, 2/5428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3382 variables, 0/5428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/3382 variables, 0/5428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3382/3382 variables, and 5428 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2154 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2936/2936 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/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1711/1799 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1799 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 350/2149 variables, 1799/3451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2149 variables, 0/3451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1108/3257 variables, 1018/4469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 3/5256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3257 variables, 0/5256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 121/3378 variables, 117/5373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3378 variables, 56/5429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3378 variables, 0/5429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/3382 variables, 2/5431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3382 variables, 0/5431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3382 variables, 0/5431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3382/3382 variables, and 5431 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5007 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2936/2936 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 7198ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 88 out of 2936 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2065 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.4 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 2065 transition count 410
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 2064 transition count 409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 2063 transition count 409
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 66 place count 2035 transition count 381
Iterating global reduction 3 with 28 rules applied. Total rules applied 94 place count 2035 transition count 381
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 3 with 29 rules applied. Total rules applied 123 place count 2035 transition count 352
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 152 place count 2006 transition count 352
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 2005 transition count 351
Applied a total of 153 rules in 331 ms. Remains 2005 /2936 variables (removed 931) and now considering 351/446 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 332 ms. Remains : 2005/2936 places, 351/446 transitions.
RANDOM walk for 40000 steps (1159 resets) in 608 ms. (65 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (32 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (44 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (33 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 5743 steps, run visited all 3 properties in 134 ms. (steps per millisecond=42 )
Probabilistic random walk after 5743 steps, saw 5628 distinct states, run finished after 135 ms. (steps per millisecond=42 ) properties seen :3
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p2 p0))), (F p1), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 960 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 495 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 384 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
[2024-05-25 18:09:11] [INFO ] Invariant cache hit.
[2024-05-25 18:09:19] [INFO ] [Real]Absence check using 0 positive and 2492 generalized place invariants in 7191 ms returned sat
[2024-05-25 18:09:26] [INFO ] [Real]Absence check using state equation in 6900 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 400 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 3026 reset in 357 ms.
Product exploration explored 100000 steps with 3030 reset in 377 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 380 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Support contains 88 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.10 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2906 transition count 446
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 591 ms. Remains 2906 /2936 variables (removed 30) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:09:29] [INFO ] Redundant transitions in 55 ms returned []
Running 416 sub problems to find dead transitions.
// Phase 1: matrix 446 rows 2906 cols
[2024-05-25 18:09:29] [INFO ] Computed 2464 invariants in 53 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2905 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2905/3352 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2906 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2905 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2905 variables, 0/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 2 (OVERLAPS) 446/3351 variables, 2905/5369 constraints. Problems are: Problem set: 4 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3351 variables, 412/5781 constraints. Problems are: Problem set: 4 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3351/3352 variables, and 5781 constraints, problems are : Problem set: 4 solved, 412 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2905/2906 constraints, PredecessorRefiner: 412/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60677ms problems are : Problem set: 4 solved, 412 unsolved
Search for dead transitions found 4 dead transitions in 60681ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 2906/2936 places, 442/446 transitions.
Graph (complete) has 30771 edges and 2906 vertex of which 2904 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 179 ms. Remains 2904 /2906 variables (removed 2) and now considering 442/442 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 2904/2936 places, 442/446 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61515 ms. Remains : 2904/2936 places, 442/446 transitions.
Built C files in :
/tmp/ltsmin8167173955677071127
[2024-05-25 18:10:30] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8167173955677071127
Running compilation step : cd /tmp/ltsmin8167173955677071127;'/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'
Compilation finished in 2381 ms.
Running link step : cd /tmp/ltsmin8167173955677071127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin8167173955677071127;'/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' '--hoa' '/tmp/stateBased5488703281391186244.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 88 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 159 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 18:10:45] [INFO ] Computed 2492 invariants in 57 ms
[2024-05-25 18:10:49] [INFO ] Implicit Places using invariants in 4055 ms returned []
[2024-05-25 18:10:49] [INFO ] Invariant cache hit.
[2024-05-25 18:10:56] [INFO ] Implicit Places using invariants and state equation in 6806 ms returned []
Implicit Place search using SMT with State Equation took 10863 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:10:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2935/3382 variables, and 2492 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2935 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3381 variables, 2935/5427 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3381 variables, 416/5843 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3381/3382 variables, and 5843 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2935/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60660ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60667ms
Finished structural reductions in LTL mode , in 1 iterations and 71691 ms. Remains : 2936/2936 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin1407860400630120965
[2024-05-25 18:11:56] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1407860400630120965
Running compilation step : cd /tmp/ltsmin1407860400630120965;'/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'
Compilation finished in 2152 ms.
Running link step : cd /tmp/ltsmin1407860400630120965;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1407860400630120965;'/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' '--hoa' '/tmp/stateBased8027072504795811280.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 18:12:12] [INFO ] Flatten gal took : 87 ms
[2024-05-25 18:12:12] [INFO ] Flatten gal took : 84 ms
[2024-05-25 18:12:12] [INFO ] Time to serialize gal into /tmp/LTL8228002011851362151.gal : 27 ms
[2024-05-25 18:12:12] [INFO ] Time to serialize properties into /tmp/LTL9324207409394409033.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/LTL8228002011851362151.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6659495631240823051.hoa' '-atoms' '/tmp/LTL9324207409394409033.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/LTL9324207409394409033.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6659495631240823051.hoa
Detected timeout of ITS tools.
[2024-05-25 18:12:27] [INFO ] Flatten gal took : 69 ms
[2024-05-25 18:12:27] [INFO ] Flatten gal took : 73 ms
[2024-05-25 18:12:27] [INFO ] Time to serialize gal into /tmp/LTL14744206004416107584.gal : 10 ms
[2024-05-25 18:12:27] [INFO ] Time to serialize properties into /tmp/LTL678266578535063065.ltl : 3 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/LTL14744206004416107584.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL678266578535063065.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 : !((X((X(X((G(F("((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart...870
Formula 0 simplified : X(XX(FG!"((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+C...855
Detected timeout of ITS tools.
[2024-05-25 18:12:42] [INFO ] Flatten gal took : 66 ms
[2024-05-25 18:12:42] [INFO ] Applying decomposition
[2024-05-25 18:12:42] [INFO ] Flatten gal took : 64 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/graph520535731540133893.txt' '-o' '/tmp/graph520535731540133893.bin' '-w' '/tmp/graph520535731540133893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph520535731540133893.bin' '-l' '-1' '-v' '-w' '/tmp/graph520535731540133893.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:12:43] [INFO ] Decomposing Gal with order
[2024-05-25 18:12:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:12:43] [INFO ] Removed a total of 260 redundant transitions.
[2024-05-25 18:12:43] [INFO ] Flatten gal took : 205 ms
[2024-05-25 18:12:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 310 labels/synchronizations in 85 ms.
[2024-05-25 18:12:43] [INFO ] Time to serialize gal into /tmp/LTL3171332775563833422.gal : 19 ms
[2024-05-25 18:12:43] [INFO ] Time to serialize properties into /tmp/LTL5495092592859107722.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/LTL3171332775563833422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5495092592859107722.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 : !((X((X(X((G(F("((((((gu63.Cstart_0+gu63.Cstart_1)+(gu63.Cstart_2+gu63.Cstart_3))+((gu63.Cstart_4+gu63.Cstart_5)+(gu63.Cstart_6+gu63.C...1280
Formula 0 simplified : X(XX(FG!"((((((gu63.Cstart_0+gu63.Cstart_1)+(gu63.Cstart_2+gu63.Cstart_3))+((gu63.Cstart_4+gu63.Cstart_5)+(gu63.Cstart_6+gu63.Cstart...1265
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-13 finished in 408692 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((p0 U (G(p0)||(p0&&(p1||F(!p2)))))) U (!p0&&G(p3))))'
Support contains 1016 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2965 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.10 ms
Discarding 33 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2964 transition count 445
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2964 transition count 445
Applied a total of 4 rules in 307 ms. Remains 2964 /2998 variables (removed 34) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 2964 cols
[2024-05-25 18:12:59] [INFO ] Computed 2521 invariants in 19 ms
[2024-05-25 18:13:05] [INFO ] Implicit Places using invariants in 6082 ms returned []
[2024-05-25 18:13:05] [INFO ] Invariant cache hit.
[2024-05-25 18:13:20] [INFO ] Implicit Places using invariants and state equation in 14860 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 20949 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2935/2998 places, 445/446 transitions.
Applied a total of 0 rules in 100 ms. Remains 2935 /2935 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21356 ms. Remains : 2935/2998 places, 445/446 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-14
Product exploration explored 100000 steps with 3019 reset in 614 ms.
Product exploration explored 100000 steps with 3024 reset in 586 ms.
Computed a total of 2935 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2935 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X p2), (X p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p3)), (X (NOT (OR p0 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p3) (NOT p1) p2))), (X (X p2)), (X (X p3)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p3))), (X (X (NOT (OR p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) p2)))), (F (G (NOT p0))), (F (G p3)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 160 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter insensitive) to 4 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (1208 resets) in 2219 ms. (18 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (65 resets) in 663 ms. (60 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 215 ms. (185 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (65 resets) in 774 ms. (51 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 278 ms. (143 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 1210 ms. (33 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 277 ms. (143 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 212 ms. (187 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (55 resets) in 658 ms. (60 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 1129 ms. (35 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 549520 steps, run timeout after 6001 ms. (steps per millisecond=91 ) properties seen :0 out of 9
Probabilistic random walk after 549520 steps, saw 92300 distinct states, run finished after 6005 ms. (steps per millisecond=91 ) properties seen :0
// Phase 1: matrix 445 rows 2935 cols
[2024-05-25 18:13:30] [INFO ] Computed 2492 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1016 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 899/1915 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1915 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 812/2727 variables, 784/2436 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2727 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 354/3081 variables, 2727/5163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3081 variables, 0/5163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 299/3380 variables, 208/5371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 5467ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1016 out of 2935 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2935/2935 places, 445/445 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 2906 transition count 354
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 120 place count 2906 transition count 353
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 2905 transition count 353
Applied a total of 122 rules in 143 ms. Remains 2905 /2935 variables (removed 30) and now considering 353/445 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 2905/2935 places, 353/445 transitions.
RANDOM walk for 40000 steps (1248 resets) in 2582 ms. (15 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (71 resets) in 635 ms. (62 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 194 ms. (205 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (65 resets) in 795 ms. (50 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 255 ms. (156 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 1079 ms. (37 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 261 ms. (152 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 237 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (59 resets) in 623 ms. (64 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 1116 ms. (35 steps per ms) remains 9/9 properties
Finished probabilistic random walk after 3751 steps, run visited all 9 properties in 207 ms. (steps per millisecond=18 )
Probabilistic random walk after 3751 steps, saw 3604 distinct states, run finished after 207 ms. (steps per millisecond=18 ) properties seen :9
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X p2), (X p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p3)), (X (NOT (OR p0 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p3) (NOT p1) p2))), (X (X p2)), (X (X p3)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p3))), (X (X (NOT (OR p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) p2)))), (F (G (NOT p0))), (F (G p3)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR p0 p3))), (F (NOT (AND (NOT p0) p3))), (F (NOT (AND (NOT p0) p3))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT p3)), (F p1), (F p0), (F (NOT (OR (NOT p0) p3 p1 (NOT p2))))]
Knowledge based reduction with 25 factoid took 600 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter insensitive) to 4 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Support contains 1016 out of 2935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2935/2935 places, 445/445 transitions.
Applied a total of 0 rules in 86 ms. Remains 2935 /2935 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2024-05-25 18:13:39] [INFO ] Invariant cache hit.
[2024-05-25 18:13:43] [INFO ] Implicit Places using invariants in 3203 ms returned []
[2024-05-25 18:13:43] [INFO ] Invariant cache hit.
[2024-05-25 18:14:02] [INFO ] Implicit Places using invariants and state equation in 19553 ms returned []
Implicit Place search using SMT with State Equation took 22758 ms to find 0 implicit places.
[2024-05-25 18:14:02] [INFO ] Redundant transitions in 27 ms returned []
Running 415 sub problems to find dead transitions.
[2024-05-25 18:14:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2905 variables, 1680/1680 constraints. Problems are: Problem set: 0 solved, 415 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 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2905/3380 variables, and 1680 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 1680/2492 constraints, State Equation: 0/2935 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2905 variables, 1680/1680 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2905 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 29/2934 variables, 812/2492 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2934/3380 variables, and 2492 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2935 constraints, PredecessorRefiner: 0/415 constraints, Known Traps: 0/0 constraints]
After SMT, in 60674ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60679ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 83556 ms. Remains : 2935/2935 places, 445/445 transitions.
Computed a total of 2935 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2935 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X p2), (X p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p3)), (X (NOT (OR p0 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p3) (NOT p1) p2))), (X (X p2)), (X (X p3)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p3))), (X (X (NOT (OR p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) p2)))), (F (G (NOT p0))), (F (G p3)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 143 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter insensitive) to 4 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (1208 resets) in 2309 ms. (17 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (65 resets) in 657 ms. (60 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 206 ms. (193 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (64 resets) in 679 ms. (58 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 240 ms. (165 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 1116 ms. (35 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 259 ms. (153 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 238 ms. (167 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (57 resets) in 628 ms. (63 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 1116 ms. (35 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 493669 steps, run timeout after 6001 ms. (steps per millisecond=82 ) properties seen :0 out of 9
Probabilistic random walk after 493669 steps, saw 84369 distinct states, run finished after 6001 ms. (steps per millisecond=82 ) properties seen :0
[2024-05-25 18:15:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1016 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 899/1915 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1915 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 812/2727 variables, 784/2436 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2727 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 354/3081 variables, 2727/5163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3081 variables, 0/5163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 299/3380 variables, 208/5371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 5400ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1016 out of 2935 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2935/2935 places, 445/445 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 2906 transition count 354
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 120 place count 2906 transition count 353
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 2905 transition count 353
Applied a total of 122 rules in 128 ms. Remains 2905 /2935 variables (removed 30) and now considering 353/445 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 2905/2935 places, 353/445 transitions.
RANDOM walk for 40000 steps (1243 resets) in 2556 ms. (15 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (69 resets) in 653 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 209 ms. (190 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (66 resets) in 736 ms. (54 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 267 ms. (149 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 1125 ms. (35 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 303 ms. (131 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 218 ms. (182 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (61 resets) in 679 ms. (58 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 1114 ms. (35 steps per ms) remains 9/9 properties
Finished probabilistic random walk after 3751 steps, run visited all 9 properties in 208 ms. (steps per millisecond=18 )
Probabilistic random walk after 3751 steps, saw 3604 distinct states, run finished after 209 ms. (steps per millisecond=17 ) properties seen :9
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) p2), (X p2), (X p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p3)), (X (NOT (OR p0 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p3) (NOT p1) p2))), (X (X p2)), (X (X p3)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p3))), (X (X (NOT (OR p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) p2)))), (F (G (NOT p0))), (F (G p3)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR p0 p3))), (F (NOT (AND (NOT p0) p3))), (F (NOT (AND (NOT p0) p3))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT p3)), (F p1), (F p0), (F (NOT (OR (NOT p0) p3 p1 (NOT p2))))]
Knowledge based reduction with 25 factoid took 606 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter insensitive) to 4 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p3) p0), (NOT p0), (NOT p3), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 3029 reset in 635 ms.
Product exploration explored 100000 steps with 3026 reset in 659 ms.
Built C files in :
/tmp/ltsmin13245181778081106886
[2024-05-25 18:15:22] [INFO ] Computing symmetric may disable matrix : 445 transitions.
[2024-05-25 18:15:22] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:15:22] [INFO ] Computing symmetric may enable matrix : 445 transitions.
[2024-05-25 18:15:22] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:15:22] [INFO ] Computing Do-Not-Accords matrix : 445 transitions.
[2024-05-25 18:15:22] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:15:22] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13245181778081106886
Running compilation step : cd /tmp/ltsmin13245181778081106886;'/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'
Compilation finished in 2740 ms.
Running link step : cd /tmp/ltsmin13245181778081106886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13245181778081106886;'/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' '--hoa' '/tmp/stateBased1895334170661168151.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1016 out of 2935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2935/2935 places, 445/445 transitions.
Applied a total of 0 rules in 108 ms. Remains 2935 /2935 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2024-05-25 18:15:37] [INFO ] Invariant cache hit.
[2024-05-25 18:15:41] [INFO ] Implicit Places using invariants in 3456 ms returned []
[2024-05-25 18:15:41] [INFO ] Invariant cache hit.
[2024-05-25 18:16:00] [INFO ] Implicit Places using invariants and state equation in 19471 ms returned []
Implicit Place search using SMT with State Equation took 22932 ms to find 0 implicit places.
[2024-05-25 18:16:00] [INFO ] Redundant transitions in 27 ms returned []
Running 415 sub problems to find dead transitions.
[2024-05-25 18:16:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2905 variables, 1680/1680 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2905/3380 variables, and 1680 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1680/2492 constraints, State Equation: 0/2935 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2905 variables, 1680/1680 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2905 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 29/2934 variables, 812/2492 constraints. Problems are: Problem set: 0 solved, 415 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 Int declared 2934/3380 variables, and 2492 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2935 constraints, PredecessorRefiner: 0/415 constraints, Known Traps: 0/0 constraints]
After SMT, in 60639ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60647ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 83726 ms. Remains : 2935/2935 places, 445/445 transitions.
Built C files in :
/tmp/ltsmin9035465757878917605
[2024-05-25 18:17:01] [INFO ] Computing symmetric may disable matrix : 445 transitions.
[2024-05-25 18:17:01] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:17:01] [INFO ] Computing symmetric may enable matrix : 445 transitions.
[2024-05-25 18:17:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:17:01] [INFO ] Computing Do-Not-Accords matrix : 445 transitions.
[2024-05-25 18:17:01] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:17:01] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9035465757878917605
Running compilation step : cd /tmp/ltsmin9035465757878917605;'/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'
Compilation finished in 2719 ms.
Running link step : cd /tmp/ltsmin9035465757878917605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin9035465757878917605;'/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' '--hoa' '/tmp/stateBased12821059103448978923.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 18:17:16] [INFO ] Flatten gal took : 87 ms
[2024-05-25 18:17:16] [INFO ] Flatten gal took : 68 ms
[2024-05-25 18:17:16] [INFO ] Time to serialize gal into /tmp/LTL7755261725372628583.gal : 7 ms
[2024-05-25 18:17:16] [INFO ] Time to serialize properties into /tmp/LTL7450096362676714134.prop : 3 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/LTL7755261725372628583.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4920181139169441207.hoa' '-atoms' '/tmp/LTL7450096362676714134.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/LTL7450096362676714134.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4920181139169441207.hoa
Detected timeout of ITS tools.
[2024-05-25 18:17:31] [INFO ] Flatten gal took : 64 ms
[2024-05-25 18:17:31] [INFO ] Flatten gal took : 81 ms
[2024-05-25 18:17:31] [INFO ] Time to serialize gal into /tmp/LTL546437077055556620.gal : 7 ms
[2024-05-25 18:17:31] [INFO ] Time to serialize properties into /tmp/LTL7825405719698998520.ltl : 3 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/LTL546437077055556620.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7825405719698998520.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 : !(((F(("((((((s4_0+s4_1)+(s4_2+s4_3))+((s4_4+s4_5)+(s4_6+s4_7)))+(((s4_8+s4_9)+(s4_10+s4_11))+((s4_12+s4_13)+(s4_14+s4_15))))+((((s4_1...18273
Formula 0 simplified : G((!"((((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7)))+(((s6_8+s6_9)+(s6_10+s6_11))+((s6_12+s6_13)+(s6_14+s6_15))))+((((s6_16...17128
Detected timeout of ITS tools.
[2024-05-25 18:17:47] [INFO ] Flatten gal took : 66 ms
[2024-05-25 18:17:47] [INFO ] Applying decomposition
[2024-05-25 18:17:47] [INFO ] Flatten gal took : 65 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/graph5443822146151670534.txt' '-o' '/tmp/graph5443822146151670534.bin' '-w' '/tmp/graph5443822146151670534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5443822146151670534.bin' '-l' '-1' '-v' '-w' '/tmp/graph5443822146151670534.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:17:48] [INFO ] Decomposing Gal with order
[2024-05-25 18:17:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:17:48] [INFO ] Removed a total of 318 redundant transitions.
[2024-05-25 18:17:48] [INFO ] Flatten gal took : 103 ms
[2024-05-25 18:17:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 207 labels/synchronizations in 15 ms.
[2024-05-25 18:17:49] [INFO ] Time to serialize gal into /tmp/LTL15937120127571086988.gal : 9 ms
[2024-05-25 18:17:49] [INFO ] Time to serialize properties into /tmp/LTL5410191050990256214.ltl : 3 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/LTL15937120127571086988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5410191050990256214.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(("((((((gi2.gi15.gu60.s4_0+gi2.gi15.gu60.s4_1)+(gi2.gi15.gu60.s4_2+gi2.gi15.gu60.s4_3))+((gi2.gi15.gu60.s4_4+gi2.gi15.gu60.s4_5)...28805
Formula 0 simplified : G((!"((((((gu61.s6_0+gu61.s6_1)+(gu61.s6_2+gu61.s6_3))+((gu61.s6_4+gu61.s6_5)+(gu61.s6_6+gu61.s6_7)))+(((gu61.s6_8+gu61.s6_9)+(gu61....26036
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-14 finished in 305195 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 30 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2096 are kept as prefixes of interest. Removing 902 places using SCC suffix rule.11 ms
Discarding 902 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 2095 transition count 388
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 2095 transition count 388
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 2094 transition count 387
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 2094 transition count 387
Applied a total of 33 rules in 288 ms. Remains 2094 /2998 variables (removed 904) and now considering 387/446 (removed 59) transitions.
// Phase 1: matrix 387 rows 2094 cols
[2024-05-25 18:18:04] [INFO ] Computed 1708 invariants in 5 ms
[2024-05-25 18:18:07] [INFO ] Implicit Places using invariants in 2934 ms returned []
[2024-05-25 18:18:07] [INFO ] Invariant cache hit.
[2024-05-25 18:18:11] [INFO ] Implicit Places using invariants and state equation in 4227 ms returned [1829, 1830, 1831, 1832, 1833, 1834, 1835, 1836, 1837, 1838, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1846, 1847, 1848, 1849, 1850, 1851, 1852, 1853, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1865, 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1873, 1874, 1875, 1876, 1877, 1878, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1886]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 7164 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2036/2998 places, 387/446 transitions.
Applied a total of 0 rules in 119 ms. Remains 2036 /2036 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7572 ms. Remains : 2036/2998 places, 387/446 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-15
Product exploration explored 100000 steps with 4124 reset in 391 ms.
Product exploration explored 100000 steps with 4120 reset in 406 ms.
Computed a total of 2036 stabilizing places and 387 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2036 transition count 387
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 127 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 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 129 steps (0 resets) in 4 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 162 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 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 387 rows 2036 cols
[2024-05-25 18:18:13] [INFO ] Computed 1652 invariants in 14 ms
[2024-05-25 18:18:17] [INFO ] [Real]Absence check using 0 positive and 1652 generalized place invariants in 3091 ms returned sat
[2024-05-25 18:18:26] [INFO ] [Real]Absence check using state equation in 9447 ms returned sat
[2024-05-25 18:18:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:18:30] [INFO ] [Nat]Absence check using 0 positive and 1652 generalized place invariants in 3146 ms returned sat
[2024-05-25 18:18:38] [INFO ] [Nat]Absence check using state equation in 7956 ms returned sat
[2024-05-25 18:18:38] [INFO ] Computed and/alt/rep : 264/323/264 causal constraints (skipped 63 transitions) in 33 ms.
[2024-05-25 18:18:38] [INFO ] Added : 30 causal constraints over 6 iterations in 625 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 30 out of 2036 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2036/2036 places, 387/387 transitions.
Applied a total of 0 rules in 87 ms. Remains 2036 /2036 variables (removed 0) and now considering 387/387 (removed 0) transitions.
[2024-05-25 18:18:38] [INFO ] Invariant cache hit.
[2024-05-25 18:18:41] [INFO ] Implicit Places using invariants in 2812 ms returned []
[2024-05-25 18:18:41] [INFO ] Invariant cache hit.
[2024-05-25 18:18:46] [INFO ] Implicit Places using invariants and state equation in 4408 ms returned []
Implicit Place search using SMT with State Equation took 7220 ms to find 0 implicit places.
[2024-05-25 18:18:46] [INFO ] Redundant transitions in 2 ms returned []
Running 327 sub problems to find dead transitions.
[2024-05-25 18:18:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 387/2364 variables, 1977/3629 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2364/2423 variables, and 3629 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1977/2036 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 387/2364 variables, 1977/3629 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2364 variables, 261/3890 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 0)
(s1096 0)
(s1097 0)
(s1098 0)
(s1099 0)
(s1100 0)
(s1101 0)
(s1102 0)
(s1103 0)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2364/2423 variables, and 3890 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1977/2036 constraints, PredecessorRefiner: 261/327 constraints, Known Traps: 0/0 constraints]
After SMT, in 60474ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 60478ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67793 ms. Remains : 2036/2036 places, 387/387 transitions.
Computed a total of 2036 stabilizing places and 387 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2036 transition count 387
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 186 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 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 134 steps (0 resets) in 7 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 275 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2024-05-25 18:19:47] [INFO ] Invariant cache hit.
[2024-05-25 18:19:51] [INFO ] [Real]Absence check using 0 positive and 1652 generalized place invariants in 3194 ms returned sat
[2024-05-25 18:20:00] [INFO ] [Real]Absence check using state equation in 9650 ms returned sat
[2024-05-25 18:20:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:20:04] [INFO ] [Nat]Absence check using 0 positive and 1652 generalized place invariants in 3355 ms returned sat
[2024-05-25 18:20:13] [INFO ] [Nat]Absence check using state equation in 8227 ms returned sat
[2024-05-25 18:20:13] [INFO ] Computed and/alt/rep : 264/323/264 causal constraints (skipped 63 transitions) in 28 ms.
[2024-05-25 18:20:13] [INFO ] Added : 30 causal constraints over 6 iterations in 615 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4109 reset in 398 ms.
Product exploration explored 100000 steps with 4084 reset in 433 ms.
Built C files in :
/tmp/ltsmin16664348849616846976
[2024-05-25 18:20:14] [INFO ] Computing symmetric may disable matrix : 387 transitions.
[2024-05-25 18:20:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:20:14] [INFO ] Computing symmetric may enable matrix : 387 transitions.
[2024-05-25 18:20:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:20:14] [INFO ] Computing Do-Not-Accords matrix : 387 transitions.
[2024-05-25 18:20:14] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:20:14] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16664348849616846976
Running compilation step : cd /tmp/ltsmin16664348849616846976;'/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'
Compilation finished in 1888 ms.
Running link step : cd /tmp/ltsmin16664348849616846976;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin16664348849616846976;'/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' '--hoa' '/tmp/stateBased10359859792499884283.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 30 out of 2036 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2036/2036 places, 387/387 transitions.
Applied a total of 0 rules in 88 ms. Remains 2036 /2036 variables (removed 0) and now considering 387/387 (removed 0) transitions.
[2024-05-25 18:20:29] [INFO ] Invariant cache hit.
[2024-05-25 18:20:32] [INFO ] Implicit Places using invariants in 2730 ms returned []
[2024-05-25 18:20:32] [INFO ] Invariant cache hit.
[2024-05-25 18:20:37] [INFO ] Implicit Places using invariants and state equation in 4515 ms returned []
Implicit Place search using SMT with State Equation took 7248 ms to find 0 implicit places.
[2024-05-25 18:20:37] [INFO ] Redundant transitions in 2 ms returned []
Running 327 sub problems to find dead transitions.
[2024-05-25 18:20:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 387/2364 variables, 1977/3629 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2364/2423 variables, and 3629 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1977/2036 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 387/2364 variables, 1977/3629 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2364 variables, 261/3890 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2364/2423 variables, and 3890 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1977/2036 constraints, PredecessorRefiner: 261/327 constraints, Known Traps: 0/0 constraints]
After SMT, in 60466ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 60470ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67816 ms. Remains : 2036/2036 places, 387/387 transitions.
Built C files in :
/tmp/ltsmin10196422985248926642
[2024-05-25 18:21:37] [INFO ] Computing symmetric may disable matrix : 387 transitions.
[2024-05-25 18:21:37] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:21:37] [INFO ] Computing symmetric may enable matrix : 387 transitions.
[2024-05-25 18:21:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:21:37] [INFO ] Computing Do-Not-Accords matrix : 387 transitions.
[2024-05-25 18:21:37] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:21:37] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10196422985248926642
Running compilation step : cd /tmp/ltsmin10196422985248926642;'/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'
Compilation finished in 1857 ms.
Running link step : cd /tmp/ltsmin10196422985248926642;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10196422985248926642;'/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' '--hoa' '/tmp/stateBased2272883541332871041.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 18:21:52] [INFO ] Flatten gal took : 47 ms
[2024-05-25 18:21:52] [INFO ] Flatten gal took : 41 ms
[2024-05-25 18:21:52] [INFO ] Time to serialize gal into /tmp/LTL6165565923573726387.gal : 6 ms
[2024-05-25 18:21:52] [INFO ] Time to serialize properties into /tmp/LTL11011416638307205494.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/LTL6165565923573726387.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14684167695997866972.hoa' '-atoms' '/tmp/LTL11011416638307205494.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11011416638307205494.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14684167695997866972.hoa
Detected timeout of ITS tools.
[2024-05-25 18:22:07] [INFO ] Flatten gal took : 57 ms
[2024-05-25 18:22:07] [INFO ] Flatten gal took : 42 ms
[2024-05-25 18:22:07] [INFO ] Time to serialize gal into /tmp/LTL13408368175887597289.gal : 6 ms
[2024-05-25 18:22:07] [INFO ] Time to serialize properties into /tmp/LTL11044913378694022295.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/LTL13408368175887597289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11044913378694022295.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(AstopAbort>(((((SstopOK_0+SstopOK_1)+(SstopOK_2+SstopOK_3))+((SstopOK_4+SstopOK_5)+(SstopOK_6+SstopOK_7)))+(((SstopOK_8+Sstop...411
Formula 0 simplified : FG!"(AstopAbort>(((((SstopOK_0+SstopOK_1)+(SstopOK_2+SstopOK_3))+((SstopOK_4+SstopOK_5)+(SstopOK_6+SstopOK_7)))+(((SstopOK_8+SstopOK...405
Detected timeout of ITS tools.
[2024-05-25 18:22:23] [INFO ] Flatten gal took : 42 ms
[2024-05-25 18:22:23] [INFO ] Applying decomposition
[2024-05-25 18:22:23] [INFO ] Flatten gal took : 58 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/graph8116167898866245309.txt' '-o' '/tmp/graph8116167898866245309.bin' '-w' '/tmp/graph8116167898866245309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8116167898866245309.bin' '-l' '-1' '-v' '-w' '/tmp/graph8116167898866245309.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:22:23] [INFO ] Decomposing Gal with order
[2024-05-25 18:22:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:22:23] [INFO ] Removed a total of 318 redundant transitions.
[2024-05-25 18:22:23] [INFO ] Flatten gal took : 94 ms
[2024-05-25 18:22:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 395 labels/synchronizations in 85 ms.
[2024-05-25 18:22:23] [INFO ] Time to serialize gal into /tmp/LTL13076294736600321289.gal : 17 ms
[2024-05-25 18:22:23] [INFO ] Time to serialize properties into /tmp/LTL15841916032645751307.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/LTL13076294736600321289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15841916032645751307.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu143.AstopAbort>(((((gu143.SstopOK_0+gu143.SstopOK_1)+(gu143.SstopOK_2+gu143.SstopOK_3))+((gu143.SstopOK_4+gu143.SstopOK_5)+...591
Formula 0 simplified : FG!"(gu143.AstopAbort>(((((gu143.SstopOK_0+gu143.SstopOK_1)+(gu143.SstopOK_2+gu143.SstopOK_3))+((gu143.SstopOK_4+gu143.SstopOK_5)+(g...585
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-15 finished in 274632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((G(F(p0))||G(p1)))) U G(p2))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-28-LTLCardinality-13
Stuttering acceptance computed with spot in 357 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Support contains 88 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2906 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.15 ms
Discarding 92 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2903 transition count 441
Applied a total of 5 rules in 287 ms. Remains 2903 /2998 variables (removed 95) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2024-05-25 18:22:39] [INFO ] Computed 2464 invariants in 57 ms
[2024-05-25 18:22:43] [INFO ] Implicit Places using invariants in 3836 ms returned []
[2024-05-25 18:22:43] [INFO ] Invariant cache hit.
[2024-05-25 18:22:49] [INFO ] Implicit Places using invariants and state equation in 6173 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10014 ms to find 29 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2874/2998 places, 441/446 transitions.
Applied a total of 0 rules in 159 ms. Remains 2874 /2874 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 10462 ms. Remains : 2874/2998 places, 441/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLCardinality-13
Product exploration explored 100000 steps with 2817 reset in 444 ms.
Product exploration explored 100000 steps with 2811 reset in 487 ms.
Computed a total of 2874 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2874 transition count 441
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 353 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (1122 resets) in 360 ms. (110 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40003 steps (28 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (44 resets) in 166 ms. (239 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (44 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
// Phase 1: matrix 441 rows 2874 cols
[2024-05-25 18:22:52] [INFO ] Computed 2436 invariants in 53 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1682/1770 variables, 1624/1624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1770 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 350/2120 variables, 1770/3394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2120 variables, 0/3394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1137/3257 variables, 1046/4440 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 0/5224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 29/3286 variables, 28/5252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3286 variables, 29/5281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3286 variables, 0/5281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 29/3315 variables, 29/5310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3315 variables, 0/5310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/3315 variables, 0/5310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 3315/3315 variables, and 5310 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2656 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2874/2874 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1682/1770 variables, 1624/1624 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1770 variables, 0/1624 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 350/2120 variables, 1770/3394 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2120 variables, 0/3394 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1137/3257 variables, 1046/4440 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5224 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 3/5227 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3257 variables, 0/5227 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 29/3286 variables, 28/5255 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3286 variables, 29/5284 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3286 variables, 0/5284 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 29/3315 variables, 29/5313 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3315 variables, 0/5313 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3315 variables, 0/5313 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3315/3315 variables, and 5313 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3542 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2874/2874 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 6292ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 147 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=13 )
Parikh walk visited 3 properties in 12 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) p2 p0))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (OR p1 p2 p0))), (F (NOT p0)), (F (NOT (OR p1 (NOT p2)))), (F p1)]
Knowledge based reduction with 7 factoid took 1071 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 356 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
[2024-05-25 18:23:00] [INFO ] Invariant cache hit.
[2024-05-25 18:23:07] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 6728 ms returned sat
[2024-05-25 18:23:15] [INFO ] [Real]Absence check using state equation in 7400 ms returned unknown
Could not prove EG (NOT p2)
Support contains 88 out of 2874 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2874/2874 places, 441/441 transitions.
Applied a total of 0 rules in 126 ms. Remains 2874 /2874 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-25 18:23:15] [INFO ] Invariant cache hit.
[2024-05-25 18:23:19] [INFO ] Implicit Places using invariants in 3870 ms returned []
[2024-05-25 18:23:19] [INFO ] Invariant cache hit.
[2024-05-25 18:23:25] [INFO ] Implicit Places using invariants and state equation in 6444 ms returned []
Implicit Place search using SMT with State Equation took 10316 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-25 18:23:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2845 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 382 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 2845/3315 variables, and 2436 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 0/2874 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2845 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2845 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 441/3286 variables, 2845/5281 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3286 variables, 382/5663 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3286/3315 variables, and 5663 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2845/2874 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60645ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60651ms
Finished structural reductions in LTL mode , in 1 iterations and 71096 ms. Remains : 2874/2874 places, 441/441 transitions.
Computed a total of 2874 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2874 transition count 441
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 262 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 390 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (1121 resets) in 871 ms. (45 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (28 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (44 resets) in 110 ms. (360 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
[2024-05-25 18:24:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1682/1770 variables, 1624/1624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1770 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 350/2120 variables, 1770/3394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2120 variables, 0/3394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1137/3257 variables, 1046/4440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 0/5224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 29/3286 variables, 28/5252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3286 variables, 29/5281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3286 variables, 0/5281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 29/3315 variables, 29/5310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3315 variables, 0/5310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/3315 variables, 0/5310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3315/3315 variables, and 5310 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2252 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2874/2874 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/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1682/1770 variables, 1624/1624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1770 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 350/2120 variables, 1770/3394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2120 variables, 0/3394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1137/3257 variables, 1046/4440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3257 variables, 784/5224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3257 variables, 3/5227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3257 variables, 0/5227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 29/3286 variables, 28/5255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3286 variables, 29/5284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3286 variables, 0/5284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 29/3315 variables, 29/5313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3315 variables, 0/5313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3315 variables, 0/5313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3315/3315 variables, and 5313 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4722 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2874/2874 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 6993ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 147 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=21 )
Parikh walk visited 3 properties in 8 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p2 p0))), (F p1), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 844 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 363 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
[2024-05-25 18:24:36] [INFO ] Invariant cache hit.
[2024-05-25 18:24:44] [INFO ] [Real]Absence check using 0 positive and 2436 generalized place invariants in 6712 ms returned sat
[2024-05-25 18:24:51] [INFO ] [Real]Absence check using state equation in 7410 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 361 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 2815 reset in 458 ms.
Product exploration explored 100000 steps with 2815 reset in 478 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 358 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Support contains 88 out of 2874 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2874/2874 places, 441/441 transitions.
Applied a total of 0 rules in 159 ms. Remains 2874 /2874 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-25 18:24:53] [INFO ] Redundant transitions in 31 ms returned []
Running 382 sub problems to find dead transitions.
[2024-05-25 18:24:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2845 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2845/3315 variables, and 2436 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 0/2874 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2845 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2845 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 441/3286 variables, 2845/5281 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3286 variables, 382/5663 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3286/3315 variables, and 5663 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2845/2874 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60633ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60637ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60838 ms. Remains : 2874/2874 places, 441/441 transitions.
Built C files in :
/tmp/ltsmin16248743917749862736
[2024-05-25 18:25:54] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16248743917749862736
Running compilation step : cd /tmp/ltsmin16248743917749862736;'/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'
Compilation finished in 2170 ms.
Running link step : cd /tmp/ltsmin16248743917749862736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16248743917749862736;'/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' '--hoa' '/tmp/stateBased13749312796342122312.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 88 out of 2874 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2874/2874 places, 441/441 transitions.
Applied a total of 0 rules in 122 ms. Remains 2874 /2874 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-25 18:26:09] [INFO ] Invariant cache hit.
[2024-05-25 18:26:13] [INFO ] Implicit Places using invariants in 3844 ms returned []
[2024-05-25 18:26:13] [INFO ] Invariant cache hit.
[2024-05-25 18:26:19] [INFO ] Implicit Places using invariants and state equation in 6031 ms returned []
Implicit Place search using SMT with State Equation took 9879 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-25 18:26:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2845 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2845/3315 variables, and 2436 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 0/2874 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2845 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2845 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 441/3286 variables, 2845/5281 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3286 variables, 382/5663 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3286/3315 variables, and 5663 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2845/2874 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60648ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60652ms
Finished structural reductions in LTL mode , in 1 iterations and 70655 ms. Remains : 2874/2874 places, 441/441 transitions.
Built C files in :
/tmp/ltsmin8167531198204438093
[2024-05-25 18:27:19] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8167531198204438093
Running compilation step : cd /tmp/ltsmin8167531198204438093;'/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'
Compilation finished in 2102 ms.
Running link step : cd /tmp/ltsmin8167531198204438093;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8167531198204438093;'/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' '--hoa' '/tmp/stateBased2004152633633335668.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 18:27:35] [INFO ] Flatten gal took : 57 ms
[2024-05-25 18:27:35] [INFO ] Flatten gal took : 51 ms
[2024-05-25 18:27:35] [INFO ] Time to serialize gal into /tmp/LTL14773597552106588953.gal : 7 ms
[2024-05-25 18:27:35] [INFO ] Time to serialize properties into /tmp/LTL16646492405357832713.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/LTL14773597552106588953.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5584706915573290761.hoa' '-atoms' '/tmp/LTL16646492405357832713.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16646492405357832713.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5584706915573290761.hoa
Detected timeout of ITS tools.
[2024-05-25 18:27:50] [INFO ] Flatten gal took : 51 ms
[2024-05-25 18:27:50] [INFO ] Flatten gal took : 51 ms
[2024-05-25 18:27:50] [INFO ] Time to serialize gal into /tmp/LTL10403503288604648454.gal : 7 ms
[2024-05-25 18:27:50] [INFO ] Time to serialize properties into /tmp/LTL14068822516978578567.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/LTL10403503288604648454.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14068822516978578567.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((X(X((G(F("((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart...870
Formula 0 simplified : X(XX(FG!"((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+C...855
Detected timeout of ITS tools.
[2024-05-25 18:28:05] [INFO ] Flatten gal took : 51 ms
[2024-05-25 18:28:05] [INFO ] Applying decomposition
[2024-05-25 18:28:05] [INFO ] Flatten gal took : 63 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/graph2556468846426213282.txt' '-o' '/tmp/graph2556468846426213282.bin' '-w' '/tmp/graph2556468846426213282.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2556468846426213282.bin' '-l' '-1' '-v' '-w' '/tmp/graph2556468846426213282.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:28:05] [INFO ] Decomposing Gal with order
[2024-05-25 18:28:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:28:05] [INFO ] Removed a total of 290 redundant transitions.
[2024-05-25 18:28:05] [INFO ] Flatten gal took : 94 ms
[2024-05-25 18:28:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 390 labels/synchronizations in 47 ms.
[2024-05-25 18:28:05] [INFO ] Time to serialize gal into /tmp/LTL10989412189540442879.gal : 15 ms
[2024-05-25 18:28:05] [INFO ] Time to serialize properties into /tmp/LTL14948756440937233340.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/LTL10989412189540442879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14948756440937233340.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((X(X((G(F("((((((gu44.Cstart_0+gu44.Cstart_1)+(gu44.Cstart_2+gu44.Cstart_3))+((gu44.Cstart_4+gu44.Cstart_5)+(gu44.Cstart_6+gu44.C...1280
Formula 0 simplified : X(XX(FG!"((((((gu44.Cstart_0+gu44.Cstart_1)+(gu44.Cstart_2+gu44.Cstart_3))+((gu44.Cstart_4+gu44.Cstart_5)+(gu44.Cstart_6+gu44.Cstart...1265
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-28-LTLCardinality-13 finished in 342259 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((p0 U (G(p0)||(p0&&(p1||F(!p2)))))) U (!p0&&G(p3))))'
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-25 18:28:21] [INFO ] Flatten gal took : 59 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1794129719756018906
[2024-05-25 18:28:21] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2024-05-25 18:28:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:28:21] [INFO ] Applying decomposition
[2024-05-25 18:28:21] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2024-05-25 18:28:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:28:21] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2024-05-25 18:28:21] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:28:21] [INFO ] Flatten gal took : 58 ms
[2024-05-25 18:28:21] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1794129719756018906
Running compilation step : cd /tmp/ltsmin1794129719756018906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph5582754752277973278.txt' '-o' '/tmp/graph5582754752277973278.bin' '-w' '/tmp/graph5582754752277973278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5582754752277973278.bin' '-l' '-1' '-v' '-w' '/tmp/graph5582754752277973278.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:28:23] [INFO ] Decomposing Gal with order
[2024-05-25 18:28:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:28:23] [INFO ] Removed a total of 174 redundant transitions.
[2024-05-25 18:28:23] [INFO ] Flatten gal took : 106 ms
[2024-05-25 18:28:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-25 18:28:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality1554802160168237694.gal : 9 ms
[2024-05-25 18:28:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality15007423034494433005.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1554802160168237694.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15007423034494433005.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 : !((X((X(X((G(F("((((((gu61.Cstart_0+gu61.Cstart_1)+(gu61.Cstart_2+gu61.Cstart_3))+((gu61.Cstart_4+gu61.Cstart_5)+(gu61.Cstart_6+gu61.C...1430
Formula 0 simplified : X(XX(FG!"((((((gu61.Cstart_0+gu61.Cstart_1)+(gu61.Cstart_2+gu61.Cstart_3))+((gu61.Cstart_4+gu61.Cstart_5)+(gu61.Cstart_6+gu61.Cstart...1415
Compilation finished in 2837 ms.
Running link step : cd /tmp/ltsmin1794129719756018906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1794129719756018906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: 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.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: 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( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.043: LTL layer: formula: X((X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))) U []((LTLAPp2==true))))
pins2lts-mc-linux64( 1/ 8), 0.043: "X((X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))) U []((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.080: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.472: There are 455 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.472: State length is 2999, there are 467 groups
pins2lts-mc-linux64( 0/ 8), 0.472: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.472: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.472: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.472: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.599: [Blue] ~32 levels ~960 states ~6192 transitions
pins2lts-mc-linux64( 2/ 8), 0.659: [Blue] ~32 levels ~1920 states ~10192 transitions
pins2lts-mc-linux64( 4/ 8), 0.773: [Blue] ~32 levels ~3840 states ~19408 transitions
pins2lts-mc-linux64( 6/ 8), 1.000: [Blue] ~32 levels ~7680 states ~39808 transitions
pins2lts-mc-linux64( 7/ 8), 1.431: [Blue] ~32 levels ~15360 states ~84672 transitions
pins2lts-mc-linux64( 5/ 8), 2.214: [Blue] ~32 levels ~30720 states ~182272 transitions
pins2lts-mc-linux64( 7/ 8), 3.741: [Blue] ~32 levels ~61440 states ~393024 transitions
pins2lts-mc-linux64( 7/ 8), 6.836: [Blue] ~32 levels ~122880 states ~845456 transitions
pins2lts-mc-linux64( 7/ 8), 12.875: [Blue] ~32 levels ~245760 states ~1697360 transitions
pins2lts-mc-linux64( 1/ 8), 24.690: [Blue] ~33 levels ~491520 states ~3178256 transitions
pins2lts-mc-linux64( 2/ 8), 47.644: [Blue] ~32 levels ~983040 states ~6849752 transitions
pins2lts-mc-linux64( 4/ 8), 93.270: [Blue] ~33 levels ~1966080 states ~14186064 transitions
pins2lts-mc-linux64( 1/ 8), 186.430: [Blue] ~34 levels ~3932160 states ~30447296 transitions
pins2lts-mc-linux64( 1/ 8), 372.156: [Blue] ~34 levels ~7864320 states ~59841208 transitions
pins2lts-mc-linux64( 5/ 8), 398.729: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 398.764:
pins2lts-mc-linux64( 0/ 8), 398.764: Explored 8169247 states 63884426 transitions, fanout: 7.820
pins2lts-mc-linux64( 0/ 8), 398.764: Total exploration time 398.280 sec (398.250 sec minimum, 398.259 sec on average)
pins2lts-mc-linux64( 0/ 8), 398.764: States per second: 20511, Transitions per second: 160401
pins2lts-mc-linux64( 0/ 8), 398.764:
pins2lts-mc-linux64( 0/ 8), 398.764: State space has 8171769 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 398.764: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 398.764: blue states: 8169247 (99.97%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 398.764: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 398.764: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 398.764:
pins2lts-mc-linux64( 0/ 8), 398.764: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 398.764:
pins2lts-mc-linux64( 0/ 8), 398.764: Queue width: 8B, total height: 267, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 398.764: Tree memory: 318.3MB, 40.8 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 398.764: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 398.764: Stored 448 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 398.764: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 398.764: Est. total memory use: 318.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1794129719756018906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1794129719756018906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))) U []((LTLAPp2==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:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-25 18:42:21] [INFO ] Applying decomposition
[2024-05-25 18:42:21] [INFO ] Flatten gal took : 61 ms
[2024-05-25 18:42:21] [INFO ] Decomposing Gal with order
[2024-05-25 18:42:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:42:21] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to malicious_reservoir in partition [n6_0, n5_0, n4_0, n3_0, n2_0, n1_0, c1_0, Cstart_0, Sstart_0, s2_0, s3_0, s4_0, s5_0, s6_0, SstopOK_0, CstopOK_0],[n6_1, n5_1, n4_1, n3_1, n2_1, n1_1, c1_1, Cstart_1, Sstart_1, s2_1, s3_1, s4_1, s5_1, s6_1, SstopOK_1, CstopOK_1],[n6_2, n5_2, n4_2, n3_2, n2_2, n1_2, c1_2, Cstart_2, Sstart_2, s2_2, s3_2, s4_2, s5_2, s6_2, SstopOK_2, CstopOK_2],[n6_3, n5_3, n4_3, n3_3, n2_3, n1_3, c1_3, Cstart_3, Sstart_3, s2_3, s3_3, s4_3, s5_3, s6_3, SstopOK_3, CstopOK_3],[n6_4, n5_4, n4_4, n3_4, n2_4, n1_4, c1_4, Cstart_4, Sstart_4, s2_4, s3_4, s4_4, s5_4, s6_4, SstopOK_4, CstopOK_4],[n6_5, n5_5, n4_5, n3_5, n2_5, n1_5, c1_5, Cstart_5, Sstart_5, s2_5, s3_5, s4_5, s5_5, s6_5, SstopOK_5, CstopOK_5],[n6_6, n5_6, n4_6, n3_6, n2_6, n1_6, c1_6, Cstart_6, Sstart_6, s2_6, s3_6, s4_6, s5_6, s6_6, SstopOK_6, CstopOK_6],[n6_7, n5_7, n4_7, n3_7, n2_7, n1_7, c1_7, Cstart_7, Sstart_7, s2_7, s3_7, s4_7, s5_7, s6_7, SstopOK_7, CstopOK_7],[n6_8, n5_8, n4_8, n3_8, n2_8, n1_8, c1_8, Cstart_8, Sstart_8, s2_8, s3_8, s4_8, s5_8, s6_8, SstopOK_8, CstopOK_8],[n6_9, n5_9, n4_9, n3_9, n2_9, n1_9, c1_9, Cstart_9, Sstart_9, s2_9, s3_9, s4_9, s5_9, s6_9, SstopOK_9, CstopOK_9],[n6_10, n5_10, n4_10, n3_10, n2_10, n1_10, c1_10, Cstart_10, Sstart_10, s2_10, s3_10, s4_10, s5_10, s6_10, SstopOK_10, CstopOK_10],[n6_11, n5_11, n4_11, n3_11, n2_11, n1_11, c1_11, Cstart_11, Sstart_11, s2_11, s3_11, s4_11, s5_11, s6_11, SstopOK_11, CstopOK_11],[n6_12, n5_12, n4_12, n3_12, n2_12, n1_12, c1_12, Cstart_12, Sstart_12, s2_12, s3_12, s4_12, s5_12, s6_12, SstopOK_12, CstopOK_12],[n6_13, n5_13, n4_13, n3_13, n2_13, n1_13, c1_13, Cstart_13, Sstart_13, s2_13, s3_13, s4_13, s5_13, s6_13, SstopOK_13, CstopOK_13],[n6_14, n5_14, n4_14, n3_14, n2_14, n1_14, c1_14, Cstart_14, Sstart_14, s2_14, s3_14, s4_14, s5_14, s6_14, SstopOK_14, CstopOK_14],[n6_15, n5_15, n4_15, n3_15, n2_15, n1_15, c1_15, Cstart_15, Sstart_15, s2_15, s3_15, s4_15, s5_15, s6_15, SstopOK_15, CstopOK_15],[n6_16, n5_16, n4_16, n3_16, n2_16, n1_16, c1_16, Cstart_16, Sstart_16, s2_16, s3_16, s4_16, s5_16, s6_16, SstopOK_16, CstopOK_16],[n6_17, n5_17, n4_17, n3_17, n2_17, n1_17, c1_17, Cstart_17, Sstart_17, s2_17, s3_17, s4_17, s5_17, s6_17, SstopOK_17, CstopOK_17],[n6_18, n5_18, n4_18, n3_18, n2_18, n1_18, c1_18, Cstart_18, Sstart_18, s2_18, s3_18, s4_18, s5_18, s6_18, SstopOK_18, CstopOK_18],[n6_19, n5_19, n4_19, n3_19, n2_19, n1_19, c1_19, Cstart_19, Sstart_19, s2_19, s3_19, s4_19, s5_19, s6_19, SstopOK_19, CstopOK_19],[n6_20, n5_20, n4_20, n3_20, n2_20, n1_20, c1_20, Cstart_20, Sstart_20, s2_20, s3_20, s4_20, s5_20, s6_20, SstopOK_20, CstopOK_20],[n6_21, n5_21, n4_21, n3_21, n2_21, n1_21, c1_21, Cstart_21, Sstart_21, s2_21, s3_21, s4_21, s5_21, s6_21, SstopOK_21, CstopOK_21],[n6_22, n5_22, n4_22, n3_22, n2_22, n1_22, c1_22, Cstart_22, Sstart_22, s2_22, s3_22, s4_22, s5_22, s6_22, SstopOK_22, CstopOK_22],[n6_23, n5_23, n4_23, n3_23, n2_23, n1_23, c1_23, Cstart_23, Sstart_23, s2_23, s3_23, s4_23, s5_23, s6_23, SstopOK_23, CstopOK_23],[n6_24, n5_24, n4_24, n3_24, n2_24, n1_24, c1_24, Cstart_24, Sstart_24, s2_24, s3_24, s4_24, s5_24, s6_24, SstopOK_24, CstopOK_24],[n6_25, n5_25, n4_25, n3_25, n2_25, n1_25, c1_25, Cstart_25, Sstart_25, s2_25, s3_25, s4_25, s5_25, s6_25, SstopOK_25, CstopOK_25],[n6_26, n5_26, n4_26, n3_26, n2_26, n1_26, c1_26, Cstart_26, Sstart_26, s2_26, s3_26, s4_26, s5_26, s6_26, SstopOK_26, CstopOK_26],[n6_27, n5_27, n4_27, n3_27, n2_27, n1_27, c1_27, Cstart_27, Sstart_27, s2_27, s3_27, s4_27, s5_27, s6_27, SstopOK_27, CstopOK_27],[n6_28, n5_28, n4_28, n3_28, n2_28, n1_28, c1_28, Cstart_28, Sstart_28, s2_28, s3_28, s4_28, s5_28, s6_28, SstopOK_28, CstopOK_28],[n9_0, n8_0, n7_0],[n9_1, n8_1, n7_1],[n9_2, n8_2, n7_2],[n9_3, n8_3, n7_3],[n9_4, n8_4, n7_4],[n9_5, n8_5, n7_5],[n9_6, n8_6, n7_6],[n9_7, n8_7, n7_7],[n9_8, n8_8, n7_8],[n9_9, n8_9, n7_9],[n9_10, n8_10, n7_10],[n9_11, n8_11, n7_11],[n9_12, n8_12, n7_12],[n9_13, n8_13, n7_13],[n9_14, n8_14, n7_14],[n9_15, n8_15, n7_15],[n9_16, n8_16, n7_16],[n9_17, n8_17, n7_17],[n9_18, n8_18, n7_18],[n9_19, n8_19, n7_19],[n9_20, n8_20, n7_20],[n9_21, n8_21, n7_21],[n9_22, n8_22, n7_22],[n9_23, n8_23, n7_23],[n9_24, n8_24, n7_24],[n9_25, n8_25, n7_25],[n9_26, n8_26, n7_26],[n9_27, n8_27, n7_27],[n9_28, n8_28, n7_28],[n9_29, n8_29, n7_29],[n9_30, n8_30, n7_30],[n9_31, n8_31, n7_31],[n9_32, n8_32, n7_32],[n9_33, n8_33, n7_33],[n9_34, n8_34, n7_34],[n9_35, n8_35, n7_35],[n9_36, n8_36, n7_36],[n9_37, n8_37, n7_37],[n9_38, n8_38, n7_38],[n9_39, n8_39, n7_39],[n9_40, n8_40, n7_40],[n9_41, n8_41, n7_41],[n9_42, n8_42, n7_42],[n9_43, n8_43, n7_43],[n9_44, n8_44, n7_44],[n9_45, n8_45, n7_45],[n9_46, n8_46, n7_46],[n9_47, n8_47, n7_47],[n9_48, n8_48, n7_48],[n9_49, n8_49, n7_49],[n9_50, n8_50, n7_50],[n9_51, n8_51, n7_51],[n9_52, n8_52, n7_52],[n9_53, n8_53, n7_53],[n9_54, n8_54, n7_54],[n9_55, n8_55, n7_55],[n9_56, n8_56, n7_56],[n9_57, n8_57, n7_57],[n9_58, n8_58, n7_58],[n9_59, n8_59, n7_59],[n9_60, n8_60, n7_60],[n9_61, n8_61, n7_61],[n9_62, n8_62, n7_62],[n9_63, n8_63, n7_63],[n9_64, n8_64, n7_64],[n9_65, n8_65, n7_65],[n9_66, n8_66, n7_66],[n9_67, n8_67, n7_67],[n9_68, n8_68, n7_68],[n9_69, n8_69, n7_69],[n9_70, n8_70, n7_70],[n9_71, n8_71, n7_71],[n9_72, n8_72, n7_72],[n9_73, n8_73, n7_73],[n9_74, n8_74, n7_74],[n9_75, n8_75, n7_75],[n9_76, n8_76, n7_76],[n9_77, n8_77, n7_77],[n9_78, n8_78, n7_78],[n9_79, n8_79, n7_79],[n9_80, n8_80, n7_80],[n9_81, n8_81, n7_81],[n9_82, n8_82, n7_82],[n9_83, n8_83, n7_83],[n9_84, n8_84, n7_84],[n9_85, n8_85, n7_85],[n9_86, n8_86, n7_86],[n9_87, n8_87, n7_87],[n9_88, n8_88, n7_88],[n9_89, n8_89, n7_89],[n9_90, n8_90, n7_90],[n9_91, n8_91, n7_91],[n9_92, n8_92, n7_92],[n9_93, n8_93, n7_93],[n9_94, n8_94, n7_94],[n9_95, n8_95, n7_95],[n9_96, n8_96, n7_96],[n9_97, n8_97, n7_97],[n9_98, n8_98, n7_98],[n9_99, n8_99, n7_99],[n9_100, n8_100, n7_100],[n9_101, n8_101, n7_101],[n9_102, n8_102, n7_102],[n9_103, n8_103, n7_103],[n9_104, n8_104, n7_104],[n9_105, n8_105, n7_105],[n9_106, n8_106, n7_106],[n9_107, n8_107, n7_107],[n9_108, n8_108, n7_108],[n9_109, n8_109, n7_109],[n9_110, n8_110, n7_110],[n9_111, n8_111, n7_111],[n9_112, n8_112, n7_112],[n9_113, n8_113, n7_113],[n9_114, n8_114, n7_114],[n9_115, n8_115, n7_115],[n9_116, n8_116, n7_116],[n9_117, n8_117, n7_117],[n9_118, n8_118, n7_118],[n9_119, n8_119, n7_119],[n9_120, n8_120, n7_120],[n9_121, n8_121, n7_121],[n9_122, n8_122, n7_122],[n9_123, n8_123, n7_123],[n9_124, n8_124, n7_124],[n9_125, n8_125, n7_125],[n9_126, n8_126, n7_126],[n9_127, n8_127, n7_127],[n9_128, n8_128, n7_128],[n9_129, n8_129, n7_129],[n9_130, n8_130, n7_130],[n9_131, n8_131, n7_131],[n9_132, n8_132, n7_132],[n9_133, n8_133, n7_133],[n9_134, n8_134, n7_134],[n9_135, n8_135, n7_135],[n9_136, n8_136, n7_136],[n9_137, n8_137, n7_137],[n9_138, n8_138, n7_138],[n9_139, n8_139, n7_139],[n9_140, n8_140, n7_140],[n9_141, n8_141, n7_141],[n9_142, n8_142, n7_142],[n9_143, n8_143, n7_143],[n9_144, n8_144, n7_144],[n9_145, n8_145, n7_145],[n9_146, n8_146, n7_146],[n9_147, n8_147, n7_147],[n9_148, n8_148, n7_148],[n9_149, n8_149, n7_149],[n9_150, n8_150, n7_150],[n9_151, n8_151, n7_151],[n9_152, n8_152, n7_152],[n9_153, n8_153, n7_153],[n9_154, n8_154, n7_154],[n9_155, n8_155, n7_155],[n9_156, n8_156, n7_156],[n9_157, n8_157, n7_157],[n9_158, n8_158, n7_158],[n9_159, n8_159, n7_159],[n9_160, n8_160, n7_160],[n9_161, n8_161, n7_161],[n9_162, n8_162, n7_162],[n9_163, n8_163, n7_163],[n9_164, n8_164, n7_164],[n9_165, n8_165, n7_165],[n9_166, n8_166, n7_166],[n9_167, n8_167, n7_167],[n9_168, n8_168, n7_168],[n9_169, n8_169, n7_169],[n9_170, n8_170, n7_170],[n9_171, n8_171, n7_171],[n9_172, n8_172, n7_172],[n9_173, n8_173, n7_173],[n9_174, n8_174, n7_174],[n9_175, n8_175, n7_175],[n9_176, n8_176, n7_176],[n9_177, n8_177, n7_177],[n9_178, n8_178, n7_178],[n9_179, n8_179, n7_179],[n9_180, n8_180, n7_180],[n9_181, n8_181, n7_181],[n9_182, n8_182, n7_182],[n9_183, n8_183, n7_183],[n9_184, n8_184, n7_184],[n9_185, n8_185, n7_185],[n9_186, n8_186, n7_186],[n9_187, n8_187, n7_187],[n9_188, n8_188, n7_188],[n9_189, n8_189, n7_189],[n9_190, n8_190, n7_190],[n9_191, n8_191, n7_191],[n9_192, n8_192, n7_192],[n9_193, n8_193, n7_193],[n9_194, n8_194, n7_194],[n9_195, n8_195, n7_195],[n9_196, n8_196, n7_196],[n9_197, n8_197, n7_197],[n9_198, n8_198, n7_198],[n9_199, n8_199, n7_199],[n9_200, n8_200, n7_200],[n9_201, n8_201, n7_201],[n9_202, n8_202, n7_202],[n9_203, n8_203, n7_203],[n9_204, n8_204, n7_204],[n9_205, n8_205, n7_205],[n9_206, n8_206, n7_206],[n9_207, n8_207, n7_207],[n9_208, n8_208, n7_208],[n9_209, n8_209, n7_209],[n9_210, n8_210, n7_210],[n9_211, n8_211, n7_211],[n9_212, n8_212, n7_212],[n9_213, n8_213, n7_213],[n9_214, n8_214, n7_214],[n9_215, n8_215, n7_215],[n9_216, n8_216, n7_216],[n9_217, n8_217, n7_217],[n9_218, n8_218, n7_218],[n9_219, n8_219, n7_219],[n9_220, n8_220, n7_220],[n9_221, n8_221, n7_221],[n9_222, n8_222, n7_222],[n9_223, n8_223, n7_223],[n9_224, n8_224, n7_224],[n9_225, n8_225, n7_225],[n9_226, n8_226, n7_226],[n9_227, n8_227, n7_227],[n9_228, n8_228, n7_228],[n9_229, n8_229, n7_229],[n9_230, n8_230, n7_230],[n9_231, n8_231, n7_231],[n9_232, n8_232, n7_232],[n9_233, n8_233, n7_233],[n9_234, n8_234, n7_234],[n9_235, n8_235, n7_235],[n9_236, n8_236, n7_236],[n9_237, n8_237, n7_237],[n9_238, n8_238, n7_238],[n9_239, n8_239, n7_239],[n9_240, n8_240, n7_240],[n9_241, n8_241, n7_241],[n9_242, n8_242, n7_242],[n9_243, n8_243, n7_243],[n9_244, n8_244, n7_244],[n9_245, n8_245, n7_245],[n9_246, n8_246, n7_246],[n9_247, n8_247, n7_247],[n9_248, n8_248, n7_248],[n9_249, n8_249, n7_249],[n9_250, n8_250, n7_250],[n9_251, n8_251, n7_251],[n9_252, n8_252, n7_252],[n9_253, n8_253, n7_253],[n9_254, n8_254, n7_254],[n9_255, n8_255, n7_255],[n9_256, n8_256, n7_256],[n9_257, n8_257, n7_257],[n9_258, n8_258, n7_258],[n9_259, n8_259, n7_259],[n9_260, n8_260, n7_260],[n9_261, n8_261, n7_261],[n9_262, n8_262, n7_262],[n9_263, n8_263, n7_263],[n9_264, n8_264, n7_264],[n9_265, n8_265, n7_265],[n9_266, n8_266, n7_266],[n9_267, n8_267, n7_267],[n9_268, n8_268, n7_268],[n9_269, n8_269, n7_269],[n9_270, n8_270, n7_270],[n9_271, n8_271, n7_271],[n9_272, n8_272, n7_272],[n9_273, n8_273, n7_273],[n9_274, n8_274, n7_274],[n9_275, n8_275, n7_275],[n9_276, n8_276, n7_276],[n9_277, n8_277, n7_277],[n9_278, n8_278, n7_278],[n9_279, n8_279, n7_279],[n9_280, n8_280, n7_280],[n9_281, n8_281, n7_281],[n9_282, n8_282, n7_282],[n9_283, n8_283, n7_283],[n9_284, n8_284, n7_284],[n9_285, n8_285, n7_285],[n9_286, n8_286, n7_286],[n9_287, n8_287, n7_287],[n9_288, n8_288, n7_288],[n9_289, n8_289, n7_289],[n9_290, n8_290, n7_290],[n9_291, n8_291, n7_291],[n9_292, n8_292, n7_292],[n9_293, n8_293, n7_293],[n9_294, n8_294, n7_294],[n9_295, n8_295, n7_295],[n9_296, n8_296, n7_296],[n9_297, n8_297, n7_297],[n9_298, n8_298, n7_298],[n9_299, n8_299, n7_299],[n9_300, n8_300, n7_300],[n9_301, n8_301, n7_301],[n9_302, n8_302, n7_302],[n9_303, n8_303, n7_303],[n9_304, n8_304, n7_304],[n9_305, n8_305, n7_305],[n9_306, n8_306, n7_306],[n9_307, n8_307, n7_307],[n9_308, n8_308, n7_308],[n9_309, n8_309, n7_309],[n9_310, n8_310, n7_310],[n9_311, n8_311, n7_311],[n9_312, n8_312, n7_312],[n9_313, n8_313, n7_313],[n9_314, n8_314, n7_314],[n9_315, n8_315, n7_315],[n9_316, n8_316, n7_316],[n9_317, n8_317, n7_317],[n9_318, n8_318, n7_318],[n9_319, n8_319, n7_319],[n9_320, n8_320, n7_320],[n9_321, n8_321, n7_321],[n9_322, n8_322, n7_322],[n9_323, n8_323, n7_323],[n9_324, n8_324, n7_324],[n9_325, n8_325, n7_325],[n9_326, n8_326, n7_326],[n9_327, n8_327, n7_327],[n9_328, n8_328, n7_328],[n9_329, n8_329, n7_329],[n9_330, n8_330, n7_330],[n9_331, n8_331, n7_331],[n9_332, n8_332, n7_332],[n9_333, n8_333, n7_333],[n9_334, n8_334, n7_334],[n9_335, n8_335, n7_335],[n9_336, n8_336, n7_336],[n9_337, n8_337, n7_337],[n9_338, n8_338, n7_338],[n9_339, n8_339, n7_339],[n9_340, n8_340, n7_340],[n9_341, n8_341, n7_341],[n9_342, n8_342, n7_342],[n9_343, n8_343, n7_343],[n9_344, n8_344, n7_344],[n9_345, n8_345, n7_345],[n9_346, n8_346, n7_346],[n9_347, n8_347, n7_347],[n9_348, n8_348, n7_348],[n9_349, n8_349, n7_349],[n9_350, n8_350, n7_350],[n9_351, n8_351, n7_351],[n9_352, n8_352, n7_352],[n9_353, n8_353, n7_353],[n9_354, n8_354, n7_354],[n9_355, n8_355, n7_355],[n9_356, n8_356, n7_356],[n9_357, n8_357, n7_357],[n9_358, n8_358, n7_358],[n9_359, n8_359, n7_359],[n9_360, n8_360, n7_360],[n9_361, n8_361, n7_361],[n9_362, n8_362, n7_362],[n9_363, n8_363, n7_363],[n9_364, n8_364, n7_364],[n9_365, n8_365, n7_365],[n9_366, n8_366, n7_366],[n9_367, n8_367, n7_367],[n9_368, n8_368, n7_368],[n9_369, n8_369, n7_369],[n9_370, n8_370, n7_370],[n9_371, n8_371, n7_371],[n9_372, n8_372, n7_372],[n9_373, n8_373, n7_373],[n9_374, n8_374, n7_374],[n9_375, n8_375, n7_375],[n9_376, n8_376, n7_376],[n9_377, n8_377, n7_377],[n9_378, n8_378, n7_378],[n9_379, n8_379, n7_379],[n9_380, n8_380, n7_380],[n9_381, n8_381, n7_381],[n9_382, n8_382, n7_382],[n9_383, n8_383, n7_383],[n9_384, n8_384, n7_384],[n9_385, n8_385, n7_385],[n9_386, n8_386, n7_386],[n9_387, n8_387, n7_387],[n9_388, n8_388, n7_388],[n9_389, n8_389, n7_389],[n9_390, n8_390, n7_390],[n9_391, n8_391, n7_391],[n9_392, n8_392, n7_392],[n9_393, n8_393, n7_393],[n9_394, n8_394, n7_394],[n9_395, n8_395, n7_395],[n9_396, n8_396, n7_396],[n9_397, n8_397, n7_397],[n9_398, n8_398, n7_398],[n9_399, n8_399, n7_399],[n9_400, n8_400, n7_400],[n9_401, n8_401, n7_401],[n9_402, n8_402, n7_402],[n9_403, n8_403, n7_403],[n9_404, n8_404, n7_404],[n9_405, n8_405, n7_405],[n9_406, n8_406, n7_406],[n9_407, n8_407, n7_407],[n9_408, n8_408, n7_408],[n9_409, n8_409, n7_409],[n9_410, n8_410, n7_410],[n9_411, n8_411, n7_411],[n9_412, n8_412, n7_412],[n9_413, n8_413, n7_413],[n9_414, n8_414, n7_414],[n9_415, n8_415, n7_415],[n9_416, n8_416, n7_416],[n9_417, n8_417, n7_417],[n9_418, n8_418, n7_418],[n9_419, n8_419, n7_419],[n9_420, n8_420, n7_420],[n9_421, n8_421, n7_421],[n9_422, n8_422, n7_422],[n9_423, n8_423, n7_423],[n9_424, n8_424, n7_424],[n9_425, n8_425, n7_425],[n9_426, n8_426, n7_426],[n9_427, n8_427, n7_427],[n9_428, n8_428, n7_428],[n9_429, n8_429, n7_429],[n9_430, n8_430, n7_430],[n9_431, n8_431, n7_431],[n9_432, n8_432, n7_432],[n9_433, n8_433, n7_433],[n9_434, n8_434, n7_434],[n9_435, n8_435, n7_435],[n9_436, n8_436, n7_436],[n9_437, n8_437, n7_437],[n9_438, n8_438, n7_438],[n9_439, n8_439, n7_439],[n9_440, n8_440, n7_440],[n9_441, n8_441, n7_441],[n9_442, n8_442, n7_442],[n9_443, n8_443, n7_443],[n9_444, n8_444, n7_444],[n9_445, n8_445, n7_445],[n9_446, n8_446, n7_446],[n9_447, n8_447, n7_447],[n9_448, n8_448, n7_448],[n9_449, n8_449, n7_449],[n9_450, n8_450, n7_450],[n9_451, n8_451, n7_451],[n9_452, n8_452, n7_452],[n9_453, n8_453, n7_453],[n9_454, n8_454, n7_454],[n9_455, n8_455, n7_455],[n9_456, n8_456, n7_456],[n9_457, n8_457, n7_457],[n9_458, n8_458, n7_458],[n9_459, n8_459, n7_459],[n9_460, n8_460, n7_460],[n9_461, n8_461, n7_461],[n9_462, n8_462, n7_462],[n9_463, n8_463, n7_463],[n9_464, n8_464, n7_464],[n9_465, n8_465, n7_465],[n9_466, n8_466, n7_466],[n9_467, n8_467, n7_467],[n9_468, n8_468, n7_468],[n9_469, n8_469, n7_469],[n9_470, n8_470, n7_470],[n9_471, n8_471, n7_471],[n9_472, n8_472, n7_472],[n9_473, n8_473, n7_473],[n9_474, n8_474, n7_474],[n9_475, n8_475, n7_475],[n9_476, n8_476, n7_476],[n9_477, n8_477, n7_477],[n9_478, n8_478, n7_478],[n9_479, n8_479, n7_479],[n9_480, n8_480, n7_480],[n9_481, n8_481, n7_481],[n9_482, n8_482, n7_482],[n9_483, n8_483, n7_483],[n9_484, n8_484, n7_484],[n9_485, n8_485, n7_485],[n9_486, n8_486, n7_486],[n9_487, n8_487, n7_487],[n9_488, n8_488, n7_488],[n9_489, n8_489, n7_489],[n9_490, n8_490, n7_490],[n9_491, n8_491, n7_491],[n9_492, n8_492, n7_492],[n9_493, n8_493, n7_493],[n9_494, n8_494, n7_494],[n9_495, n8_495, n7_495],[n9_496, n8_496, n7_496],[n9_497, n8_497, n7_497],[n9_498, n8_498, n7_498],[n9_499, n8_499, n7_499],[n9_500, n8_500, n7_500],[n9_501, n8_501, n7_501],[n9_502, n8_502, n7_502],[n9_503, n8_503, n7_503],[n9_504, n8_504, n7_504],[n9_505, n8_505, n7_505],[n9_506, n8_506, n7_506],[n9_507, n8_507, n7_507],[n9_508, n8_508, n7_508],[n9_509, n8_509, n7_509],[n9_510, n8_510, n7_510],[n9_511, n8_511, n7_511],[n9_512, n8_512, n7_512],[n9_513, n8_513, n7_513],[n9_514, n8_514, n7_514],[n9_515, n8_515, n7_515],[n9_516, n8_516, n7_516],[n9_517, n8_517, n7_517],[n9_518, n8_518, n7_518],[n9_519, n8_519, n7_519],[n9_520, n8_520, n7_520],[n9_521, n8_521, n7_521],[n9_522, n8_522, n7_522],[n9_523, n8_523, n7_523],[n9_524, n8_524, n7_524],[n9_525, n8_525, n7_525],[n9_526, n8_526, n7_526],[n9_527, n8_527, n7_527],[n9_528, n8_528, n7_528],[n9_529, n8_529, n7_529],[n9_530, n8_530, n7_530],[n9_531, n8_531, n7_531],[n9_532, n8_532, n7_532],[n9_533, n8_533, n7_533],[n9_534, n8_534, n7_534],[n9_535, n8_535, n7_535],[n9_536, n8_536, n7_536],[n9_537, n8_537, n7_537],[n9_538, n8_538, n7_538],[n9_539, n8_539, n7_539],[n9_540, n8_540, n7_540],[n9_541, n8_541, n7_541],[n9_542, n8_542, n7_542],[n9_543, n8_543, n7_543],[n9_544, n8_544, n7_544],[n9_545, n8_545, n7_545],[n9_546, n8_546, n7_546],[n9_547, n8_547, n7_547],[n9_548, n8_548, n7_548],[n9_549, n8_549, n7_549],[n9_550, n8_550, n7_550],[n9_551, n8_551, n7_551],[n9_552, n8_552, n7_552],[n9_553, n8_553, n7_553],[n9_554, n8_554, n7_554],[n9_555, n8_555, n7_555],[n9_556, n8_556, n7_556],[n9_557, n8_557, n7_557],[n9_558, n8_558, n7_558],[n9_559, n8_559, n7_559],[n9_560, n8_560, n7_560],[n9_561, n8_561, n7_561],[n9_562, n8_562, n7_562],[n9_563, n8_563, n7_563],[n9_564, n8_564, n7_564],[n9_565, n8_565, n7_565],[n9_566, n8_566, n7_566],[n9_567, n8_567, n7_567],[n9_568, n8_568, n7_568],[n9_569, n8_569, n7_569],[n9_570, n8_570, n7_570],[n9_571, n8_571, n7_571],[n9_572, n8_572, n7_572],[n9_573, n8_573, n7_573],[n9_574, n8_574, n7_574],[n9_575, n8_575, n7_575],[n9_576, n8_576, n7_576],[n9_577, n8_577, n7_577],[n9_578, n8_578, n7_578],[n9_579, n8_579, n7_579],[n9_580, n8_580, n7_580],[n9_581, n8_581, n7_581],[n9_582, n8_582, n7_582],[n9_583, n8_583, n7_583],[n9_584, n8_584, n7_584],[n9_585, n8_585, n7_585],[n9_586, n8_586, n7_586],[n9_587, n8_587, n7_587],[n9_588, n8_588, n7_588],[n9_589, n8_589, n7_589],[n9_590, n8_590, n7_590],[n9_591, n8_591, n7_591],[n9_592, n8_592, n7_592],[n9_593, n8_593, n7_593],[n9_594, n8_594, n7_594],[n9_595, n8_595, n7_595],[n9_596, n8_596, n7_596],[n9_597, n8_597, n7_597],[n9_598, n8_598, n7_598],[n9_599, n8_599, n7_599],[n9_600, n8_600, n7_600],[n9_601, n8_601, n7_601],[n9_602, n8_602, n7_602],[n9_603, n8_603, n7_603],[n9_604, n8_604, n7_604],[n9_605, n8_605, n7_605],[n9_606, n8_606, n7_606],[n9_607, n8_607, n7_607],[n9_608, n8_608, n7_608],[n9_609, n8_609, n7_609],[n9_610, n8_610, n7_610],[n9_611, n8_611, n7_611],[n9_612, n8_612, n7_612],[n9_613, n8_613, n7_613],[n9_614, n8_614, n7_614],[n9_615, n8_615, n7_615],[n9_616, n8_616, n7_616],[n9_617, n8_617, n7_617],[n9_618, n8_618, n7_618],[n9_619, n8_619, n7_619],[n9_620, n8_620, n7_620],[n9_621, n8_621, n7_621],[n9_622, n8_622, n7_622],[n9_623, n8_623, n7_623],[n9_624, n8_624, n7_624],[n9_625, n8_625, n7_625],[n9_626, n8_626, n7_626],[n9_627, n8_627, n7_627],[n9_628, n8_628, n7_628],[n9_629, n8_629, n7_629],[n9_630, n8_630, n7_630],[n9_631, n8_631, n7_631],[n9_632, n8_632, n7_632],[n9_633, n8_633, n7_633],[n9_634, n8_634, n7_634],[n9_635, n8_635, n7_635],[n9_636, n8_636, n7_636],[n9_637, n8_637, n7_637],[n9_638, n8_638, n7_638],[n9_639, n8_639, n7_639],[n9_640, n8_640, n7_640],[n9_641, n8_641, n7_641],[n9_642, n8_642, n7_642],[n9_643, n8_643, n7_643],[n9_644, n8_644, n7_644],[n9_645, n8_645, n7_645],[n9_646, n8_646, n7_646],[n9_647, n8_647, n7_647],[n9_648, n8_648, n7_648],[n9_649, n8_649, n7_649],[n9_650, n8_650, n7_650],[n9_651, n8_651, n7_651],[n9_652, n8_652, n7_652],[n9_653, n8_653, n7_653],[n9_654, n8_654, n7_654],[n9_655, n8_655, n7_655],[n9_656, n8_656, n7_656],[n9_657, n8_657, n7_657],[n9_658, n8_658, n7_658],[n9_659, n8_659, n7_659],[n9_660, n8_660, n7_660],[n9_661, n8_661, n7_661],[n9_662, n8_662, n7_662],[n9_663, n8_663, n7_663],[n9_664, n8_664, n7_664],[n9_665, n8_665, n7_665],[n9_666, n8_666, n7_666],[n9_667, n8_667, n7_667],[n9_668, n8_668, n7_668],[n9_669, n8_669, n7_669],[n9_670, n8_670, n7_670],[n9_671, n8_671, n7_671],[n9_672, n8_672, n7_672],[n9_673, n8_673, n7_673],[n9_674, n8_674, n7_674],[n9_675, n8_675, n7_675],[n9_676, n8_676, n7_676],[n9_677, n8_677, n7_677],[n9_678, n8_678, n7_678],[n9_679, n8_679, n7_679],[n9_680, n8_680, n7_680],[n9_681, n8_681, n7_681],[n9_682, n8_682, n7_682],[n9_683, n8_683, n7_683],[n9_684, n8_684, n7_684],[n9_685, n8_685, n7_685],[n9_686, n8_686, n7_686],[n9_687, n8_687, n7_687],[n9_688, n8_688, n7_688],[n9_689, n8_689, n7_689],[n9_690, n8_690, n7_690],[n9_691, n8_691, n7_691],[n9_692, n8_692, n7_692],[n9_693, n8_693, n7_693],[n9_694, n8_694, n7_694],[n9_695, n8_695, n7_695],[n9_696, n8_696, n7_696],[n9_697, n8_697, n7_697],[n9_698, n8_698, n7_698],[n9_699, n8_699, n7_699],[n9_700, n8_700, n7_700],[n9_701, n8_701, n7_701],[n9_702, n8_702, n7_702],[n9_703, n8_703, n7_703],[n9_704, n8_704, n7_704],[n9_705, n8_705, n7_705],[n9_706, n8_706, n7_706],[n9_707, n8_707, n7_707],[n9_708, n8_708, n7_708],[n9_709, n8_709, n7_709],[n9_710, n8_710, n7_710],[n9_711, n8_711, n7_711],[n9_712, n8_712, n7_712],[n9_713, n8_713, n7_713],[n9_714, n8_714, n7_714],[n9_715, n8_715, n7_715],[n9_716, n8_716, n7_716],[n9_717, n8_717, n7_717],[n9_718, n8_718, n7_718],[n9_719, n8_719, n7_719],[n9_720, n8_720, n7_720],[n9_721, n8_721, n7_721],[n9_722, n8_722, n7_722],[n9_723, n8_723, n7_723],[n9_724, n8_724, n7_724],[n9_725, n8_725, n7_725],[n9_726, n8_726, n7_726],[n9_727, n8_727, n7_727],[n9_728, n8_728, n7_728],[n9_729, n8_729, n7_729],[n9_730, n8_730, n7_730],[n9_731, n8_731, n7_731],[n9_732, n8_732, n7_732],[n9_733, n8_733, n7_733],[n9_734, n8_734, n7_734],[n9_735, n8_735, n7_735],[n9_736, n8_736, n7_736],[n9_737, n8_737, n7_737],[n9_738, n8_738, n7_738],[n9_739, n8_739, n7_739],[n9_740, n8_740, n7_740],[n9_741, n8_741, n7_741],[n9_742, n8_742, n7_742],[n9_743, n8_743, n7_743],[n9_744, n8_744, n7_744],[n9_745, n8_745, n7_745],[n9_746, n8_746, n7_746],[n9_747, n8_747, n7_747],[n9_748, n8_748, n7_748],[n9_749, n8_749, n7_749],[n9_750, n8_750, n7_750],[n9_751, n8_751, n7_751],[n9_752, n8_752, n7_752],[n9_753, n8_753, n7_753],[n9_754, n8_754, n7_754],[n9_755, n8_755, n7_755],[n9_756, n8_756, n7_756],[n9_757, n8_757, n7_757],[n9_758, n8_758, n7_758],[n9_759, n8_759, n7_759],[n9_760, n8_760, n7_760],[n9_761, n8_761, n7_761],[n9_762, n8_762, n7_762],[n9_763, n8_763, n7_763],[n9_764, n8_764, n7_764],[n9_765, n8_765, n7_765],[n9_766, n8_766, n7_766],[n9_767, n8_767, n7_767],[n9_768, n8_768, n7_768],[n9_769, n8_769, n7_769],[n9_770, n8_770, n7_770],[n9_771, n8_771, n7_771],[n9_772, n8_772, n7_772],[n9_773, n8_773, n7_773],[n9_774, n8_774, n7_774],[n9_775, n8_775, n7_775],[n9_776, n8_776, n7_776],[n9_777, n8_777, n7_777],[n9_778, n8_778, n7_778],[n9_779, n8_779, n7_779],[n9_780, n8_780, n7_780],[n9_781, n8_781, n7_781],[n9_782, n8_782, n7_782],[n9_783, n8_783, n7_783],[n9_784, n8_784, n7_784],[n9_785, n8_785, n7_785],[n9_786, n8_786, n7_786],[n9_787, n8_787, n7_787],[n9_788, n8_788, n7_788],[n9_789, n8_789, n7_789],[n9_790, n8_790, n7_790],[n9_791, n8_791, n7_791],[n9_792, n8_792, n7_792],[n9_793, n8_793, n7_793],[n9_794, n8_794, n7_794],[n9_795, n8_795, n7_795],[n9_796, n8_796, n7_796],[n9_797, n8_797, n7_797],[n9_798, n8_798, n7_798],[n9_799, n8_799, n7_799],[n9_800, n8_800, n7_800],[n9_801, n8_801, n7_801],[n9_802, n8_802, n7_802],[n9_803, n8_803, n7_803],[n9_804, n8_804, n7_804],[n9_805, n8_805, n7_805],[n9_806, n8_806, n7_806],[n9_807, n8_807, n7_807],[n9_808, n8_808, n7_808],[n9_809, n8_809, n7_809],[n9_810, n8_810, n7_810],[n9_811, n8_811, n7_811],[n9_812, n8_812, n7_812],[n9_813, n8_813, n7_813],[n9_814, n8_814, n7_814],[n9_815, n8_815, n7_815],[n9_816, n8_816, n7_816],[n9_817, n8_817, n7_817],[n9_818, n8_818, n7_818],[n9_819, n8_819, n7_819],[n9_820, n8_820, n7_820],[n9_821, n8_821, n7_821],[n9_822, n8_822, n7_822],[n9_823, n8_823, n7_823],[n9_824, n8_824, n7_824],[n9_825, n8_825, n7_825],[n9_826, n8_826, n7_826],[n9_827, n8_827, n7_827],[n9_828, n8_828, n7_828],[n9_829, n8_829, n7_829],[n9_830, n8_830, n7_830],[n9_831, n8_831, n7_831],[n9_832, n8_832, n7_832],[n9_833, n8_833, n7_833],[n9_834, n8_834, n7_834],[n9_835, n8_835, n7_835],[n9_836, n8_836, n7_836],[n9_837, n8_837, n7_837],[n9_838, n8_838, n7_838],[n9_839, n8_839, n7_839],[n9_840, n8_840, n7_840],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-25 18:42:21] [INFO ] Flatten gal took : 61 ms
[2024-05-25 18:42:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality7208762806294049148.gal : 8 ms
[2024-05-25 18:42:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality15071805051146670494.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7208762806294049148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15071805051146670494.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 : !((X((X(X((G(F("((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart...870
Formula 0 simplified : X(XX(FG!"((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+C...855
ITS-tools command line returned an error code 137
[2024-05-25 18:53:54] [INFO ] Flatten gal took : 63 ms
[2024-05-25 18:53:54] [INFO ] Input system was already deterministic with 446 transitions.
[2024-05-25 18:53:54] [INFO ] Transformed 2998 places.
[2024-05-25 18:53:54] [INFO ] Transformed 446 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 18:54:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality14718643888658917545.gal : 15 ms
[2024-05-25 18:54:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality8196677878953011178.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14718643888658917545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8196677878953011178.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((X(X((G(F("((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart...870
Formula 0 simplified : X(XX(FG!"((((((Cstart_0+Cstart_1)+(Cstart_2+Cstart_3))+((Cstart_4+Cstart_5)+(Cstart_6+Cstart_7)))+(((Cstart_8+Cstart_9)+(Cstart_10+C...855
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="QuasiCertifProtocol-COL-28"
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 QuasiCertifProtocol-COL-28, 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 r312-tall-171662337700043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-28.tgz
mv QuasiCertifProtocol-COL-28 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 ;