About the Execution of GreatSPN+red for QuasiCertifProtocol-PT-28
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12862.951 | 3600000.00 | 7333727.00 | 6079.70 | TF?FF?TTFFFFFT?F | 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.r311-tall-171662335900100.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 greatspnxred
Input is QuasiCertifProtocol-PT-28, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335900100
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 107K Apr 13 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 666K Apr 13 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 13 03:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 117K Apr 13 03:38 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 76K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 313K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 121K Apr 13 04:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 795K Apr 13 04:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 31K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 13 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 749K 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-PT-28-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-28-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716661610150
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 18:26:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 18:26:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 18:26:51] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-05-25 18:26:51] [INFO ] Transformed 2998 places.
[2024-05-25 18:26:51] [INFO ] Transformed 446 transitions.
[2024-05-25 18:26:51] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2738 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 62 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:26:52] [INFO ] Computed 2492 invariants in 133 ms
[2024-05-25 18:26:53] [INFO ] Implicit Places using invariants in 1275 ms returned []
[2024-05-25 18:26:53] [INFO ] Invariant cache hit.
[2024-05-25 18:26:55] [INFO ] Implicit Places using invariants and state equation in 1834 ms returned []
Implicit Place search using SMT with State Equation took 3141 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:26:55] [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 30031 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 60927ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60949ms
Starting structural reductions in LTL mode, iteration 1 : 2936/2998 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64178 ms. Remains : 2936/2998 places, 446/446 transitions.
Support contains 2738 out of 2936 places after structural reductions.
[2024-05-25 18:27:56] [INFO ] Flatten gal took : 228 ms
[2024-05-25 18:27:56] [INFO ] Flatten gal took : 127 ms
[2024-05-25 18:27:57] [INFO ] Input system was already deterministic with 446 transitions.
RANDOM walk for 40000 steps (1208 resets) in 2460 ms. (16 steps per ms) remains 19/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 311 ms. (12 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 181 ms. (22 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
[2024-05-25 18:27:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2706 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2706 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 27/2733 variables, 28/2436 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2733 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 415/3148 variables, 2733/5169 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3148/3382 variables, and 5169 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5023 ms.
Refiners :[Generalized P Invariants (flows): 2436/2492 constraints, State Equation: 2733/2936 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2706 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2706 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 19 unsolved
SMT process timed out in 10446ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2706 out of 2936 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2936 transition count 444
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 2936 transition count 443
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 4 place count 2935 transition count 443
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 2934 transition count 442
Applied a total of 5 rules in 129 ms. Remains 2934 /2936 variables (removed 2) and now considering 442/446 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 2934/2936 places, 442/446 transitions.
RANDOM walk for 40000 steps (1156 resets) in 1265 ms. (31 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 169 ms. (23 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 528337 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 19
Probabilistic random walk after 528337 steps, saw 72808 distinct states, run finished after 3010 ms. (steps per millisecond=175 ) properties seen :0
// Phase 1: matrix 442 rows 2934 cols
[2024-05-25 18:28:12] [INFO ] Computed 2493 invariants in 70 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2706 variables, 2409/2409 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2706 variables, 0/2409 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 27/2733 variables, 27/2436 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2733 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 415/3148 variables, 2733/5169 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3148 variables, 0/5169 constraints. Problems are: Problem set: 0 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 201/3349 variables, 174/5343 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3349 variables, 28/5371 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3349 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 27/3376 variables, 29/5400 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3376 variables, 27/5427 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3376 variables, 0/5427 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3376/3376 variables, and 5427 constraints, problems are : Problem set: 0 solved, 19 unsolved in 45030 ms.
Refiners :[Generalized P Invariants (flows): 2493/2493 constraints, State Equation: 2934/2934 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2706 variables, 2409/2409 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2706 variables, 0/2409 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 27/2733 variables, 27/2436 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2733 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 415/3148 variables, 2733/5169 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3148 variables, 12/5181 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3148/3376 variables, and 5181 constraints, problems are : Problem set: 0 solved, 19 unsolved in 45027 ms.
Refiners :[Generalized P Invariants (flows): 2436/2493 constraints, State Equation: 2733/2934 constraints, PredecessorRefiner: 12/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 90652ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2706 out of 2934 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2934/2934 places, 442/442 transitions.
Applied a total of 0 rules in 35 ms. Remains 2934 /2934 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 2934/2934 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2934/2934 places, 442/442 transitions.
Applied a total of 0 rules in 29 ms. Remains 2934 /2934 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-05-25 18:29:43] [INFO ] Invariant cache hit.
[2024-05-25 18:29:44] [INFO ] Implicit Places using invariants in 902 ms returned [212]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 907 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2933/2934 places, 442/442 transitions.
Applied a total of 0 rules in 26 ms. Remains 2933 /2933 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 962 ms. Remains : 2933/2934 places, 442/442 transitions.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 30 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 432 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:29:44] [INFO ] Computed 2492 invariants in 50 ms
[2024-05-25 18:29:48] [INFO ] Implicit Places using invariants in 4172 ms returned []
[2024-05-25 18:29:48] [INFO ] Invariant cache hit.
[2024-05-25 18:29:56] [INFO ] Implicit Places using invariants and state equation in 7849 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 12024 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 147 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 12603 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 717 ms.
Product exploration explored 100000 steps with 50000 reset in 664 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 : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-00 finished in 14661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||G(p1)))))'
Support contains 1740 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 31 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:29:58] [INFO ] Invariant cache hit.
[2024-05-25 18:30:01] [INFO ] Implicit Places using invariants in 2146 ms returned []
[2024-05-25 18:30:01] [INFO ] Invariant cache hit.
[2024-05-25 18:30:05] [INFO ] Implicit Places using invariants and state equation in 4748 ms returned []
Implicit Place search using SMT with State Equation took 6897 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:30:05] [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 30028 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 60585ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60591ms
Finished structural reductions in LTL mode , in 1 iterations and 67525 ms. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-01
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-01 finished in 67758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 2 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 147 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:31:06] [INFO ] Invariant cache hit.
[2024-05-25 18:31:11] [INFO ] Implicit Places using invariants in 4514 ms returned []
[2024-05-25 18:31:11] [INFO ] Invariant cache hit.
[2024-05-25 18:31:20] [INFO ] Implicit Places using invariants and state equation in 9157 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 13674 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 146 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 13968 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-02
Product exploration explored 100000 steps with 7395 reset in 451 ms.
Product exploration explored 100000 steps with 7387 reset in 314 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 (NOT p1) (NOT p0)), (X (NOT p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 267 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 49 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 4 factoid took 233 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 446 rows 2907 cols
[2024-05-25 18:31:22] [INFO ] Computed 2464 invariants in 252 ms
[2024-05-25 18:31:28] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 4804 ms returned sat
[2024-05-25 18:31:38] [INFO ] [Real]Absence check using state equation in 9220 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 2907 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 2036 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.18 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 1979 transition count 330
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 1979 transition count 330
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 117 place count 1978 transition count 329
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 118 place count 1978 transition count 329
Applied a total of 118 rules in 634 ms. Remains 1978 /2907 variables (removed 929) and now considering 329/446 (removed 117) transitions.
// Phase 1: matrix 329 rows 1978 cols
[2024-05-25 18:31:38] [INFO ] Computed 1652 invariants in 25 ms
[2024-05-25 18:31:41] [INFO ] Implicit Places using invariants in 2791 ms returned []
[2024-05-25 18:31:41] [INFO ] Invariant cache hit.
[2024-05-25 18:32:02] [INFO ] Implicit Places using invariants and state equation in 21101 ms returned []
Implicit Place search using SMT with State Equation took 23896 ms to find 0 implicit places.
[2024-05-25 18:32:02] [INFO ] Redundant transitions in 44 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-25 18:32:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 329/2306 variables, 1977/3629 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 16.0)
(s1 52.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 1.0)
(s996 1.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 1.0)
(s1030 0.0)
(s1031 0.0)
(s1032 1.0)
(s1033 0.0)
(s1034 0.0)
(s1035 1.0)
(s1036 1.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 1.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 1.0)
(s1067 0.0)
(s1068 0.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 0.0)
(s1101 0.0)
(s1102 1.0)
(s1103 0.0)
(s1104 0.0)
(s1105 1.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 1.0)
(s1125 1.0)
(s1126 0.0)
(s1127 1.0)
(s1128 0.0)
(s1129 0.0)
(s1130 1.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 1.0)
(s1135 1.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 1.0)
(s1161 1.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 1.0)
(s1167 1.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 1.0)
(s1173 0.0)
(s1174 0.0)
(s1175 1.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 1.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 1.0)
(s1209 1.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 1.0)
(s1219 0.0)
(s1220 0.0)
(s1221 1.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 1.0)
(s1251 1.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 0.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 1.0)
(s1281 0.0)
(s1282 0.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 1.0)
(s1291 1.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 1.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 1.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 1.0)
(s1333 1.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 1.0)
(s1357 1.0)
(s1358 0.0)
(s1359 1.0)
(s1360 0.0)
(s1361 0.0)
(s1362 1.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 1.0)
(s1367 1.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 1.0)
(s1377 0.0)
(s1378 0.0)
(s1379 1.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 1.0)
(s1389 1.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 1.0)
(s1403 1.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 1.0)
(s1409 1.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 1.0)
(s1429 0.0)
(s1430 1.0)
(s1431 1.0)
(s1432 0.0)
(s1433 1.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 1.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 1.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 0.0)
(s1469 0.0)
(s1470 1.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 1.0)
(s1499 1.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 1.0)
(s1525 0.0)
(s1526 0.0)
(s1527 1.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 1.0)
(s1549 1.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 1.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 1.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 1.0)
(s1587 0.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 1.0)
(s1597 0.0)
(s1598 1.0)
(s1599 1.0)
(s1600 0.0)
(s1601 1.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 1.0)
(s1609 1.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 1.0)
(s1627 1.0)
(s1628 0.0)
(s1629 0.0)
(s1630 1.0)
(s1631 1.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 1.0)
(s1638 1.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 1.0)
(s1654 0.0)
(s1655 0.0)
(s1656 1.0)
(s1657 0.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 0.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 0.0)
(s1685 0.0)
(s1686 0.0)
(s1687 0.0)
(s1688 0.0)
(s1689 0.0)
(s1690 0.0)
(s1691 0.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 0.0)
(s1697 0.0)
(s1698 0.0)
(s1699 0.0)
(s1700 1.0)
(s1701 0.0)
(s1702 0.0)
(s1703 0.0)
(s1704 0.0)
(s1705 0.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 0.0)
(s1711 0.0)
(s1712 0.0)
(s1713 0.0)
(s1714 1.0)
(s1715 0.0)
(s1716 0.0)
(s1717 0.0)
(s1718 0.0)
(s1719 0.0)
(s1720 0.0)
(s1721 0.0)
(s1722 0.0)
(s1723 0.0)
(s1724 0.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 1.0)
(s1733 1.0)
(s1734 0.0)
(s1735 0.0)
(s1736 0.0)
(s1737 0.0)
(s1738 0.0)
(s1739 0.0)
(s1740 0.0)
(s1741 0.0)
(s1742 0.0)
(s1743 0.0)
(s1744 1.0)
(s1745 0.0)
(s1746 0.0)
(s1747 1.0)
(s1748 0.0)
(s1749 0.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 0.0)
(s1755 0.0)
(s1756 0.0)
(s1757 0.0)
(s1758 0.0)
(s1759 0.0)
(s1760 0.0)
(s1761 1.0)
(s1762 0.0)
(s1763 0.0)
(s1764 0.0)
(s1765 0.0)
(s1766 0.0)
(s1767 0.0)
(s1768 0.0)
(s1769 0.0)
(s1770 0.0)
(s1771 0.0)
(s1772 1.0)
(s1773 1.0)
(s1774 0.0)
(s1775 0.0)
(s1776 0.0)
(s1777 0.0)
(s1778 0.0)
(s1779 0.0)
(s1780 0.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 0.0)
(s1785 0.0)
(s1786 0.0)
(s1787 0.0)
(s1788 0.0)
(s1789 0.0)
(s1790 0.0)
(s1791 0.0)
(s1792 0.0)
(s1793 0.0)
(s1794 0.0)
(s1795 0.0)
(s1796 0.0)
(s1797 0.0)
(s1798 1.0)
(s1799 1.0)
(s1800 0.0)
(s1801 0.0)
(s1802 0.0)
(s1803 0.0)
(s1804 0.0)
(s1805 0.0)
(s1806 0.0)
(s1807 0.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 0.0)
(s1813 0.0)
(s1814 0.0)
(s1815 0.0)
(s1816 0.0)
(s1817 0.0)
(s1818 0.0)
(s1819 0.0)
(s1820 0.0)
(s1821 0.0)
(s1822 0.0)
(s1823 0.0)
(s1824 0.0)
(s1825 0.0)
(s1826 0.0)
(s1827 0.0)
(s1828 0.0)
(s1829 0.0)
(s1830 1.0)
(s1831 0.0)
(s1832 0.0)
(s1833 1.0)
(s1834 0.0)
(s1835 0.0)
(s1836 0.0)
(s1837 0.0)
(s1838 0.0)
(s1839 0.0)
(s1840 0.0)
(s1841 0.0)
(s1842 0.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 0.0)
(s1848 0.0)
(s1849 0.0)
(s1850 0.0)
(s1851 0.0)
(s1853 0.0)
(s1854 0.0)
(s1855 0.0)
(s1856 0.0)
(s1857 0.0)
(s1858 0.0)
(s1859 0.0)
(s1860 0.0)
(s1861 0.0)
(s1862 0.0)
(s1863 0.0)
(s1864 0.0)
(s1865 0.0)
(s1866 0.0)
(s1867 0.0)
(s1868 0.0)
(s1869 0.0)
(s1870 0.0)
(s1871 0.0)
(s1872 0.0)
(s1873 0.0)
(s1874 0.0)
(s1875 0.0)
(s1876 0.0)
(s1877 0.0)
(s1878 0.0)
(s1879 0.0)
(s1880 0.0)
(s1881 0.0)
(s1882 0.0)
(s1883 0.0)
(s1884 0.0)
(s1885 1.0)
(s1886 1.0)
(s1887 1.0)
(s1888 1.0)
(s1889 1.0)
(s1890 1.0)
(s1891 1.0)
(s1892 1.0)
(s1893 0.0)
(s1894 0.0)
(s1895 0.0)
(s1896 0.0)
(s1897 0.0)
(s1898 0.0)
(s1899 timeout
1.0)
(s1900 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2306/2307 variables, and 3629 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1977/1978 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 329/2306 variables, 1977/3629 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2306 variables, 299/3928 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2306/2307 variables, and 3928 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1977/1978 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 60358ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 60362ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1978/2907 places, 329/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84950 ms. Remains : 1978/2907 places, 329/446 transitions.
Computed a total of 1978 stabilizing places and 329 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1978 transition count 329
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 p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 49 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
[2024-05-25 18:33:03] [INFO ] Invariant cache hit.
[2024-05-25 18:33:06] [INFO ] [Real]Absence check using 0 positive and 1652 generalized place invariants in 2272 ms returned sat
[2024-05-25 18:33:18] [INFO ] [Real]Absence check using state equation in 12206 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7365 reset in 277 ms.
Product exploration explored 100000 steps with 7454 reset in 341 ms.
Support contains 1 out of 1978 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1978/1978 places, 329/329 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1978 transition count 328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1977 transition count 328
Applied a total of 2 rules in 116 ms. Remains 1977 /1978 variables (removed 1) and now considering 328/329 (removed 1) transitions.
// Phase 1: matrix 328 rows 1977 cols
[2024-05-25 18:33:19] [INFO ] Computed 1652 invariants in 31 ms
[2024-05-25 18:33:22] [INFO ] Implicit Places using invariants in 2742 ms returned []
[2024-05-25 18:33:22] [INFO ] Invariant cache hit.
[2024-05-25 18:33:44] [INFO ] Implicit Places using invariants and state equation in 21542 ms returned []
Implicit Place search using SMT with State Equation took 24288 ms to find 0 implicit places.
[2024-05-25 18:33:44] [INFO ] Redundant transitions in 34 ms returned []
Running 298 sub problems to find dead transitions.
[2024-05-25 18:33:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1976 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1976 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 328/2304 variables, 1976/3628 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 16.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 0.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 1.0)
(s324 0.0)
(s325 1.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 0.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 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 1.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 0.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 1.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 1.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2304/2305 variables, and 3628 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1976/1977 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1976 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1976 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 328/2304 variables, 1976/3628 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2304 variables, 298/3926 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2304/2305 variables, and 3926 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1976/1977 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints]
After SMT, in 60336ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1977/1978 places, 328/329 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84784 ms. Remains : 1977/1978 places, 328/329 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-02 finished in 217954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 871 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 79 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:34:44] [INFO ] Computed 2492 invariants in 27 ms
[2024-05-25 18:34:48] [INFO ] Implicit Places using invariants in 3290 ms returned []
[2024-05-25 18:34:48] [INFO ] Invariant cache hit.
[2024-05-25 18:34:55] [INFO ] Implicit Places using invariants and state equation in 7286 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10581 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 84 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 10745 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-03 finished in 10867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p1||G(F(p2))))))'
Support contains 1741 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 30 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:34:55] [INFO ] Invariant cache hit.
[2024-05-25 18:34:57] [INFO ] Implicit Places using invariants in 1748 ms returned []
[2024-05-25 18:34:57] [INFO ] Invariant cache hit.
[2024-05-25 18:35:01] [INFO ] Implicit Places using invariants and state equation in 4683 ms returned []
Implicit Place search using SMT with State Equation took 6434 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:35:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 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 Real declared 2935/3382 variables, and 2492 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30018 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 30019 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 60700ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60707ms
Finished structural reductions in LTL mode , in 1 iterations and 67172 ms. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-04
Stuttering criterion allowed to conclude after 427 steps with 12 reset in 6 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-04 finished in 67431 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 U G(!p1))))))'
Support contains 59 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 142 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:36:03] [INFO ] Invariant cache hit.
[2024-05-25 18:36:07] [INFO ] Implicit Places using invariants in 4464 ms returned []
[2024-05-25 18:36:07] [INFO ] Invariant cache hit.
[2024-05-25 18:36:15] [INFO ] Implicit Places using invariants and state equation in 8147 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 12617 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 137 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 12898 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, p1, (AND p1 (NOT p0)), p1]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-05
Product exploration explored 100000 steps with 3024 reset in 505 ms.
Product exploration explored 100000 steps with 3028 reset in 499 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 (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 99 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, p1, (AND p1 (NOT p0)), p1]
RANDOM walk for 40000 steps (1209 resets) in 398 ms. (100 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (64 resets) in 283 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (43 resets) in 472 ms. (84 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 890990 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :0 out of 2
Probabilistic random walk after 890990 steps, saw 113147 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :0
// Phase 1: matrix 446 rows 2907 cols
[2024-05-25 18:36:21] [INFO ] Computed 2464 invariants in 241 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 319/378 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2063/2441 variables, 1943/2002 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2441 variables, 1624/3626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2441 variables, 0/3626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 841/3282 variables, 812/4438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3282 variables, 841/5279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3282 variables, 0/5279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 68/3350 variables, 62/5341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3350 variables, 28/5369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3350 variables, 0/5369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/3353 variables, 2/5371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3353/3353 variables, and 5371 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1632 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 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/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 319/378 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2063/2441 variables, 1943/2002 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2441 variables, 1624/3626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2441 variables, 2/3628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2441 variables, 0/3628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 841/3282 variables, 812/4440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3282 variables, 841/5281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3282 variables, 0/5281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 68/3350 variables, 62/5343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3350 variables, 28/5371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3350 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/3353 variables, 2/5373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3353 variables, 0/5373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3353 variables, 0/5373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3353/3353 variables, and 5373 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3975 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 5872ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 167 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=23 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 15 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 171 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 111 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 135 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:36:27] [INFO ] Invariant cache hit.
[2024-05-25 18:36:31] [INFO ] Implicit Places using invariants in 4382 ms returned []
[2024-05-25 18:36:31] [INFO ] Invariant cache hit.
[2024-05-25 18:36:39] [INFO ] Implicit Places using invariants and state equation in 7969 ms returned []
Implicit Place search using SMT with State Equation took 12355 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:36:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 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/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2906 variables, 0/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3352 variables, 2906/5370 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3352 variables, 416/5786 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3352/3353 variables, and 5786 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2906/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60605ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60612ms
Finished structural reductions in LTL mode , in 1 iterations and 73105 ms. Remains : 2907/2907 places, 446/446 transitions.
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 (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, p1, (AND p1 (NOT p0)), p1]
RANDOM walk for 40000 steps (1209 resets) in 877 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (62 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (45 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 867685 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :0 out of 2
Probabilistic random walk after 867685 steps, saw 110355 distinct states, run finished after 3001 ms. (steps per millisecond=289 ) properties seen :0
[2024-05-25 18:37:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 319/378 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2063/2441 variables, 1943/2002 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2441 variables, 1624/3626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2441 variables, 0/3626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 841/3282 variables, 812/4438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3282 variables, 841/5279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3282 variables, 0/5279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 68/3350 variables, 62/5341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3350 variables, 28/5369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3350 variables, 0/5369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/3353 variables, 2/5371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3353/3353 variables, and 5371 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1683 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 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/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 319/378 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2063/2441 variables, 1943/2002 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2441 variables, 1624/3626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2441 variables, 2/3628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2441 variables, 0/3628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 841/3282 variables, 812/4440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3282 variables, 841/5281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3282 variables, 0/5281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 68/3350 variables, 62/5343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3350 variables, 28/5371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3350 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/3353 variables, 2/5373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3353 variables, 0/5373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3353 variables, 0/5373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3353/3353 variables, and 5373 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3693 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 5407ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 22 ms.
Support contains 29 out of 2907 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 2007 are kept as prefixes of interest. Removing 900 places using SCC suffix rule.3 ms
Discarding 900 places :
Also discarding 31 output transitions
Drop transitions (Output transitions of discarded places.) removed 31 transitions
Drop transitions (Empty/Sink Transition effects.) removed 178 transitions
Reduce isomorphic transitions removed 178 transitions.
Discarding 58 places :
Implicit places reduction removed 58 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 267 rules applied. Total rules applied 268 place count 1949 transition count 206
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 299 place count 1918 transition count 206
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 299 place count 1918 transition count 148
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 86 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 501 place count 1774 transition count 148
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 2 with 1 rules applied. Total rules applied 502 place count 1774 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 503 place count 1773 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 503 place count 1773 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 506 place count 1771 transition count 146
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 812 places
Reduce places removed 841 places and 0 transitions.
Iterating global reduction 4 with 870 rules applied. Total rules applied 1376 place count 930 transition count 117
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 841 places
Reduce places removed 870 places and 0 transitions.
Iterating global reduction 4 with 899 rules applied. Total rules applied 2275 place count 60 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2276 place count 59 transition count 87
Applied a total of 2276 rules in 169 ms. Remains 59 /2907 variables (removed 2848) and now considering 87/446 (removed 359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 59/2907 places, 87/446 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 156 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 123 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 144 ms :[true, p1, (AND p1 (NOT p0)), p1]
Product exploration explored 100000 steps with 3025 reset in 481 ms.
Product exploration explored 100000 steps with 3025 reset in 491 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 111 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2907 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 2877 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 2877 transition count 446
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 718 ms. Remains 2877 /2907 variables (removed 30) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:37:52] [INFO ] Redundant transitions in 40 ms returned []
Running 416 sub problems to find dead transitions.
// Phase 1: matrix 446 rows 2877 cols
[2024-05-25 18:37:52] [INFO ] Computed 2436 invariants in 240 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2876 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2876/3323 variables, and 2436 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 0/2877 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/2876 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2876 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
At refinement iteration 2 (OVERLAPS) 446/3322 variables, 2876/5312 constraints. Problems are: Problem set: 4 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3322 variables, 412/5724 constraints. Problems are: Problem set: 4 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3322/3323 variables, and 5724 constraints, problems are : Problem set: 4 solved, 412 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2876/2877 constraints, PredecessorRefiner: 412/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60873ms problems are : Problem set: 4 solved, 412 unsolved
Search for dead transitions found 4 dead transitions in 60877ms
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 : 2877/2907 places, 442/446 transitions.
Graph (complete) has 29901 edges and 2877 vertex of which 2875 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 175 ms. Remains 2875 /2877 variables (removed 2) and now considering 442/442 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 2875/2907 places, 442/446 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61836 ms. Remains : 2875/2907 places, 442/446 transitions.
Support contains 59 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 139 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-25 18:38:54] [INFO ] Computed 2464 invariants in 233 ms
[2024-05-25 18:38:58] [INFO ] Implicit Places using invariants in 4258 ms returned []
[2024-05-25 18:38:58] [INFO ] Invariant cache hit.
[2024-05-25 18:39:05] [INFO ] Implicit Places using invariants and state equation in 7833 ms returned []
Implicit Place search using SMT with State Equation took 12095 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:39:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 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/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2906 variables, 0/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3352 variables, 2906/5370 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3352 variables, 416/5786 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3352/3353 variables, and 5786 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2906/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60650ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60656ms
Finished structural reductions in LTL mode , in 1 iterations and 72892 ms. Remains : 2907/2907 places, 446/446 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-05 finished in 243848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 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 2065 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.9 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 2007 transition count 329
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 2007 transition count 329
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 117 place count 2006 transition count 328
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 118 place count 2006 transition count 328
Applied a total of 118 rules in 336 ms. Remains 2006 /2936 variables (removed 930) and now considering 328/446 (removed 118) transitions.
// Phase 1: matrix 328 rows 2006 cols
[2024-05-25 18:40:07] [INFO ] Computed 1680 invariants in 17 ms
[2024-05-25 18:40:10] [INFO ] Implicit Places using invariants in 2880 ms returned []
[2024-05-25 18:40:10] [INFO ] Invariant cache hit.
[2024-05-25 18:40:32] [INFO ] Implicit Places using invariants and state equation in 22541 ms returned [1069, 1070, 1072, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1709, 1710, 1711, 1712, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1927]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 25424 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1948/2936 places, 328/446 transitions.
Applied a total of 0 rules in 84 ms. Remains 1948 /1948 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25844 ms. Remains : 1948/2936 places, 328/446 transitions.
Stuttering acceptance computed with spot in 173 ms :[p0]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-06
Product exploration explored 100000 steps with 2818 reset in 335 ms.
Product exploration explored 100000 steps with 2815 reset in 362 ms.
Computed a total of 1948 stabilizing places and 328 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1948 transition count 328
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 (NOT 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-PT-28-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-06 finished in 27024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G((!p0||X(G(!p1))))))'
Support contains 31 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 139 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:40:33] [INFO ] Computed 2492 invariants in 30 ms
[2024-05-25 18:40:38] [INFO ] Implicit Places using invariants in 4460 ms returned []
[2024-05-25 18:40:38] [INFO ] Invariant cache hit.
[2024-05-25 18:40:47] [INFO ] Implicit Places using invariants and state equation in 9347 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 13816 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 140 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 14095 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), false, (AND (NOT p0) p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-07
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-07 TRUE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-07 finished in 14308 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((X(p1)&&p0))&&F(G(p2)))))'
Support contains 62 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 145 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:40:48] [INFO ] Invariant cache hit.
[2024-05-25 18:40:52] [INFO ] Implicit Places using invariants in 4307 ms returned []
[2024-05-25 18:40:52] [INFO ] Invariant cache hit.
[2024-05-25 18:41:00] [INFO ] Implicit Places using invariants and state equation in 8074 ms returned [1969, 1970, 1972, 1981, 1982, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 12388 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2908/2936 places, 446/446 transitions.
Applied a total of 0 rules in 140 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 12674 ms. Remains : 2908/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-08
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-08 finished in 12826 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)&&X(G(p1))))'
Support contains 35 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 140 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:41:01] [INFO ] Invariant cache hit.
[2024-05-25 18:41:05] [INFO ] Implicit Places using invariants in 4347 ms returned []
[2024-05-25 18:41:05] [INFO ] Invariant cache hit.
[2024-05-25 18:41:13] [INFO ] Implicit Places using invariants and state equation in 7970 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 12323 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 134 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 12598 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-09
Product exploration explored 100000 steps with 3027 reset in 315 ms.
Product exploration explored 100000 steps with 3028 reset in 330 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 (NOT p0)), (X p1), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 420 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1205 resets) in 163 ms. (243 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (44 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
// Phase 1: matrix 446 rows 2907 cols
[2024-05-25 18:41:15] [INFO ] Computed 2464 invariants in 250 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/62 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 238/300 variables, 62/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 497/797 variables, 292/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 92/889 variables, 86/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/889 variables, 92/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/889 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2400/3289 variables, 2322/2882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3289 variables, 2400/5282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3289 variables, 0/5282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 64/3353 variables, 61/5343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3353 variables, 28/5371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3353/3353 variables, and 5371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1216 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/62 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 238/300 variables, 62/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 497/797 variables, 292/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/889 variables, 86/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/889 variables, 92/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/889 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2400/3289 variables, 2322/2883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3289 variables, 2400/5283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3289 variables, 0/5283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 64/3353 variables, 61/5344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3353 variables, 28/5372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3353 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3353 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3353/3353 variables, and 5372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1493 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2976ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 62 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 5 factoid took 483 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-09 finished in 17885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&(X(!p1)||G(p2))))'
Support contains 32 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 147 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:41:19] [INFO ] Computed 2492 invariants in 33 ms
[2024-05-25 18:41:23] [INFO ] Implicit Places using invariants in 4365 ms returned []
[2024-05-25 18:41:23] [INFO ] Invariant cache hit.
[2024-05-25 18:41:32] [INFO ] Implicit Places using invariants and state equation in 9441 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 13818 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 138 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 14103 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (AND p1 (NOT p2))), p1, (NOT p0), (NOT p0), (AND (NOT p2) p1), true, (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-10
Stuttering criterion allowed to conclude after 35 steps with 2 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-10 finished in 14342 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)) U (G((p1||X(F(p2)))) U (p2 U p0)))))'
Support contains 4 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.11 ms
Discarding 30 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 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 2904 transition count 442
Applied a total of 3 rules in 299 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2024-05-25 18:41:33] [INFO ] Computed 2464 invariants in 31 ms
[2024-05-25 18:41:37] [INFO ] Implicit Places using invariants in 4373 ms returned []
[2024-05-25 18:41:37] [INFO ] Invariant cache hit.
[2024-05-25 18:41:44] [INFO ] Implicit Places using invariants and state equation in 6915 ms returned [1967, 1968, 1970, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2602, 2607, 2608, 2609, 2610, 2811, 2812, 2813, 2814, 2815, 2816, 2817, 2818, 2825]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 11291 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2846/2936 places, 442/446 transitions.
Applied a total of 0 rules in 149 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11741 ms. Remains : 2846/2936 places, 442/446 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-11
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-11 finished in 11949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 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 2065 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.8 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 2007 transition count 329
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 2007 transition count 329
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 117 place count 2006 transition count 328
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 118 place count 2006 transition count 328
Applied a total of 118 rules in 349 ms. Remains 2006 /2936 variables (removed 930) and now considering 328/446 (removed 118) transitions.
// Phase 1: matrix 328 rows 2006 cols
[2024-05-25 18:41:45] [INFO ] Computed 1680 invariants in 18 ms
[2024-05-25 18:41:48] [INFO ] Implicit Places using invariants in 2854 ms returned []
[2024-05-25 18:41:48] [INFO ] Invariant cache hit.
[2024-05-25 18:42:11] [INFO ] Implicit Places using invariants and state equation in 22986 ms returned [1069, 1070, 1072, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1709, 1710, 1711, 1712, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1927]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 25846 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1948/2936 places, 328/446 transitions.
Applied a total of 0 rules in 93 ms. Remains 1948 /1948 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26290 ms. Remains : 1948/2936 places, 328/446 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-12
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-28-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-12 finished in 26339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 1 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 136 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:42:11] [INFO ] Computed 2492 invariants in 34 ms
[2024-05-25 18:42:16] [INFO ] Implicit Places using invariants in 4450 ms returned []
[2024-05-25 18:42:16] [INFO ] Invariant cache hit.
[2024-05-25 18:42:25] [INFO ] Implicit Places using invariants and state equation in 9597 ms returned [1969, 1970, 1972, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 14055 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 136 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 14327 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-14
Product exploration explored 100000 steps with 3022 reset in 301 ms.
Product exploration explored 100000 steps with 3026 reset in 318 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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (1210 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (56 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1542931 steps, run timeout after 3001 ms. (steps per millisecond=514 ) properties seen :0 out of 1
Probabilistic random walk after 1542931 steps, saw 194777 distinct states, run finished after 3002 ms. (steps per millisecond=513 ) properties seen :0
// Phase 1: matrix 446 rows 2907 cols
[2024-05-25 18:42:30] [INFO ] Computed 2464 invariants in 250 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 321/325 variables, 60/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/405 variables, 56/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2385/2790 variables, 2324/2441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2790 variables, 29/2470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2790 variables, 0/2470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 372/3162 variables, 2637/5107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3162 variables, 0/5107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 180/3342 variables, 174/5281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3342 variables, 84/5365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3342 variables, 0/5365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/3353 variables, 6/5371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3353/3353 variables, and 5371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1364 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 321/325 variables, 60/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 80/405 variables, 56/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2385/2790 variables, 2324/2442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2790 variables, 29/2471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2790 variables, 0/2471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 372/3162 variables, 2637/5108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3162 variables, 0/5108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 180/3342 variables, 174/5282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3342 variables, 84/5366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3342 variables, 0/5366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/3353 variables, 6/5372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3353 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/3353 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3353/3353 variables, and 5372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1180 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2812ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 160 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 117 ms :[true, p0, p0, p0]
Support contains 1 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 143 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 18:42:33] [INFO ] Invariant cache hit.
[2024-05-25 18:42:38] [INFO ] Implicit Places using invariants in 4491 ms returned []
[2024-05-25 18:42:38] [INFO ] Invariant cache hit.
[2024-05-25 18:42:49] [INFO ] Implicit Places using invariants and state equation in 10994 ms returned []
Implicit Place search using SMT with State Equation took 15487 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:42:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 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/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2906 variables, 0/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3352 variables, 2906/5370 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3352 variables, 416/5786 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3352/3353 variables, and 5786 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2906/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60634ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60640ms
Finished structural reductions in LTL mode , in 1 iterations and 76275 ms. Remains : 2907/2907 places, 446/446 transitions.
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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (1206 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (56 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1533075 steps, run timeout after 3001 ms. (steps per millisecond=510 ) properties seen :0 out of 1
Probabilistic random walk after 1533075 steps, saw 193216 distinct states, run finished after 3002 ms. (steps per millisecond=510 ) properties seen :0
[2024-05-25 18:43:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 321/325 variables, 60/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/405 variables, 56/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2385/2790 variables, 2324/2441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2790 variables, 29/2470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2790 variables, 0/2470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 372/3162 variables, 2637/5107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3162 variables, 0/5107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 180/3342 variables, 174/5281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3342 variables, 84/5365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3342 variables, 0/5365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/3353 variables, 6/5371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3353 variables, 0/5371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3353/3353 variables, and 5371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1356 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 321/325 variables, 60/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 80/405 variables, 56/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2385/2790 variables, 2324/2442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2790 variables, 29/2471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2790 variables, 0/2471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 372/3162 variables, 2637/5108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3162 variables, 0/5108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 180/3342 variables, 174/5282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3342 variables, 84/5366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3342 variables, 0/5366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/3353 variables, 6/5372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3353 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/3353 variables, 0/5372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3353/3353 variables, and 5372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1182 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2907/2907 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2550ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 152 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 135 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 131 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 3022 reset in 291 ms.
Product exploration explored 100000 steps with 3022 reset in 321 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 129 ms :[true, p0, p0, p0]
Support contains 1 out of 2907 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 2036 are kept as prefixes of interest. Removing 871 places using SCC suffix rule.9 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 57 place count 1980 transition count 332
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 1980 transition count 332
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 1980 transition count 334
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 115 rules in 254 ms. Remains 1980 /2907 variables (removed 927) and now considering 334/446 (removed 112) transitions.
[2024-05-25 18:43:57] [INFO ] Redundant transitions in 24 ms returned []
Running 304 sub problems to find dead transitions.
// Phase 1: matrix 334 rows 1980 cols
[2024-05-25 18:43:57] [INFO ] Computed 1652 invariants in 12 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1979 variables, 1652/1652 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1979 variables, 0/1652 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
At refinement iteration 2 (OVERLAPS) 334/2313 variables, 1979/3631 constraints. Problems are: Problem set: 4 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 16.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 (/ 1.0 57.0))
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 (/ 56.0 57.0))
(s44 (/ 56.0 57.0))
(s45 0.0)
(s46 (/ 56.0 57.0))
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 (/ 56.0 57.0))
(s52 (/ 56.0 57.0))
(s53 (/ 56.0 57.0))
(s54 (/ 56.0 57.0))
(s55 (/ 56.0 57.0))
(s56 (/ 56.0 57.0))
(s57 (/ 56.0 57.0))
(s58 (/ 56.0 57.0))
(s59 (/ 56.0 57.0))
(s60 (/ 56.0 57.0))
(s61 (/ 56.0 57.0))
(s62 (/ 56.0 57.0))
(s63 (/ 56.0 57.0))
(s64 (/ 56.0 57.0))
(s65 (/ 56.0 57.0))
(s66 (/ 56.0 57.0))
(s67 (/ 56.0 57.0))
(s68 (/ 56.0 57.0))
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 (/ 56.0 57.0))
(s76 (/ 56.0 57.0))
(s77 (/ 56.0 57.0))
(s78 (/ 56.0 57.0))
(s79 (/ 56.0 57.0))
(s80 (/ 56.0 57.0))
(s81 (/ 56.0 57.0))
(s82 (/ 56.0 57.0))
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2313/2314 variables, and 3631 constraints, problems are : Problem set: 4 solved, 300 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1979/1980 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1977 variables, 1652/1652 constraints. Problems are: Problem set: 4 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1977 variables, 0/1652 constraints. Problems are: Problem set: 4 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 332/2309 variables, 1977/3629 constraints. Problems are: Problem set: 4 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2309 variables, 300/3929 constraints. Problems are: Problem set: 4 solved, 300 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 2309/2314 variables, and 3929 constraints, problems are : Problem set: 4 solved, 300 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 1652/1652 constraints, State Equation: 1977/1980 constraints, PredecessorRefiner: 300/304 constraints, Known Traps: 0/0 constraints]
After SMT, in 60394ms problems are : Problem set: 4 solved, 300 unsolved
Search for dead transitions found 4 dead transitions in 60398ms
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 : 1980/2907 places, 330/446 transitions.
Graph (complete) has 29060 edges and 1980 vertex of which 1978 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 105 ms. Remains 1978 /1980 variables (removed 2) and now considering 330/330 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1978/2907 places, 330/446 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60795 ms. Remains : 1978/2907 places, 330/446 transitions.
Support contains 1 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 145 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-25 18:44:58] [INFO ] Computed 2464 invariants in 268 ms
[2024-05-25 18:45:03] [INFO ] Implicit Places using invariants in 4732 ms returned []
[2024-05-25 18:45:03] [INFO ] Invariant cache hit.
[2024-05-25 18:45:13] [INFO ] Implicit Places using invariants and state equation in 10605 ms returned []
Implicit Place search using SMT with State Equation took 15339 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 18:45:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 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/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2906 variables, 0/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3352 variables, 2906/5370 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3352 variables, 416/5786 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3352/3353 variables, and 5786 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2906/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60628ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60634ms
Finished structural reductions in LTL mode , in 1 iterations and 76121 ms. Remains : 2907/2907 places, 446/446 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-14 finished in 243054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1 U G(!p1))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-28-LTLFireability-05
Stuttering acceptance computed with spot in 132 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LI_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
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 2903 transition count 441
Applied a total of 5 rules in 293 ms. Remains 2903 /2936 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2024-05-25 18:46:15] [INFO ] Computed 2464 invariants in 32 ms
[2024-05-25 18:46:19] [INFO ] Implicit Places using invariants in 4142 ms returned []
[2024-05-25 18:46:19] [INFO ] Invariant cache hit.
[2024-05-25 18:46:27] [INFO ] Implicit Places using invariants and state equation in 8267 ms returned [1966, 1967, 1969, 1978, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2586, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2606, 2607, 2608, 2609, 2810, 2811, 2812, 2813, 2814, 2815, 2816, 2817, 2824]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 12421 ms to find 58 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2845/2936 places, 441/446 transitions.
Applied a total of 0 rules in 153 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 12869 ms. Remains : 2845/2936 places, 441/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-05
Product exploration explored 100000 steps with 2814 reset in 515 ms.
Product exploration explored 100000 steps with 2818 reset in 559 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 : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, p1, (AND p1 (NOT p0)), p1]
RANDOM walk for 40000 steps (1123 resets) in 283 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (32 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (31 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1151140 steps, run timeout after 3001 ms. (steps per millisecond=383 ) properties seen :0 out of 2
Probabilistic random walk after 1151140 steps, saw 147265 distinct states, run finished after 3004 ms. (steps per millisecond=383 ) properties seen :0
// Phase 1: matrix 441 rows 2845 cols
[2024-05-25 18:46:33] [INFO ] Computed 2408 invariants in 366 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 319/378 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2033/2411 variables, 1914/1973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2411 variables, 1596/3569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2411 variables, 0/3569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 841/3252 variables, 812/4381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3252 variables, 841/5222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3252 variables, 0/5222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 34/3286 variables, 31/5253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3286 variables, 0/5253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/3286 variables, 0/5253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3286/3286 variables, and 5253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1489 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2845/2845 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/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 319/378 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2033/2411 variables, 1914/1973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2411 variables, 1596/3569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2411 variables, 2/3571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2411 variables, 0/3571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 841/3252 variables, 812/4383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3252 variables, 841/5224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3252 variables, 0/5224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 34/3286 variables, 31/5255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3286 variables, 0/5255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3286 variables, 0/5255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3286/3286 variables, and 5255 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3331 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2845/2845 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 5222ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 164 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=20 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 8 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 162 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 128 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2845 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Applied a total of 0 rules in 120 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-25 18:46:38] [INFO ] Invariant cache hit.
[2024-05-25 18:46:42] [INFO ] Implicit Places using invariants in 4258 ms returned []
[2024-05-25 18:46:42] [INFO ] Invariant cache hit.
[2024-05-25 18:46:49] [INFO ] Implicit Places using invariants and state equation in 6560 ms returned []
Implicit Place search using SMT with State Equation took 10820 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-25 18:46:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2816/3286 variables, and 2408 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 0/2845 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/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2816 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 441/3257 variables, 2816/5224 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3257 variables, 382/5606 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3257/3286 variables, and 5606 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2816/2845 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60620ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60626ms
Finished structural reductions in LTL mode , in 1 iterations and 71568 ms. Remains : 2845/2845 places, 441/441 transitions.
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 : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 106 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, p1, (AND p1 (NOT p0)), p1]
RANDOM walk for 40000 steps (1125 resets) in 770 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (32 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (29 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1220350 steps, run timeout after 3001 ms. (steps per millisecond=406 ) properties seen :0 out of 2
Probabilistic random walk after 1220350 steps, saw 156454 distinct states, run finished after 3001 ms. (steps per millisecond=406 ) properties seen :0
[2024-05-25 18:47:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 319/378 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2033/2411 variables, 1914/1973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2411 variables, 1596/3569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2411 variables, 0/3569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 841/3252 variables, 812/4381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3252 variables, 841/5222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3252 variables, 0/5222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 34/3286 variables, 31/5253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3286 variables, 0/5253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/3286 variables, 0/5253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3286/3286 variables, and 5253 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1526 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2845/2845 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/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 319/378 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2033/2411 variables, 1914/1973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2411 variables, 1596/3569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2411 variables, 2/3571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2411 variables, 0/3571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 841/3252 variables, 812/4383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3252 variables, 841/5224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3252 variables, 0/5224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 34/3286 variables, 31/5255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3286 variables, 0/5255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3286 variables, 0/5255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3286/3286 variables, and 5255 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3064 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2845/2845 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4617ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 22 ms.
Support contains 29 out of 2845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Graph (complete) has 29813 edges and 2845 vertex of which 1975 are kept as prefixes of interest. Removing 870 places using SCC suffix rule.3 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 178 transitions
Reduce isomorphic transitions removed 178 transitions.
Discarding 58 places :
Implicit places reduction removed 58 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 265 rules applied. Total rules applied 266 place count 1917 transition count 205
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 295 place count 1888 transition count 205
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 295 place count 1888 transition count 147
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 58 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 469 place count 1772 transition count 147
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 2 with 1 rules applied. Total rules applied 470 place count 1772 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 471 place count 1771 transition count 146
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 812 places
Reduce places removed 841 places and 0 transitions.
Iterating global reduction 4 with 870 rules applied. Total rules applied 1341 place count 930 transition count 117
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 841 places
Reduce places removed 870 places and 0 transitions.
Iterating global reduction 4 with 899 rules applied. Total rules applied 2240 place count 60 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2241 place count 59 transition count 87
Applied a total of 2241 rules in 130 ms. Remains 59 /2845 variables (removed 2786) and now considering 87/441 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 59/2845 places, 87/441 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 140 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 111 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 125 ms :[true, p1, (AND p1 (NOT p0)), p1]
Product exploration explored 100000 steps with 2817 reset in 511 ms.
Product exploration explored 100000 steps with 2814 reset in 529 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 117 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Applied a total of 0 rules in 151 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-25 18:48:00] [INFO ] Redundant transitions in 29 ms returned []
Running 382 sub problems to find dead transitions.
[2024-05-25 18:48:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2816/3286 variables, and 2408 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 0/2845 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/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2816 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 441/3257 variables, 2816/5224 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3257 variables, 382/5606 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3257/3286 variables, and 5606 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2816/2845 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60622ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60627ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60813 ms. Remains : 2845/2845 places, 441/441 transitions.
Support contains 59 out of 2845 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Applied a total of 0 rules in 121 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-25 18:49:01] [INFO ] Invariant cache hit.
[2024-05-25 18:49:05] [INFO ] Implicit Places using invariants in 4209 ms returned []
[2024-05-25 18:49:05] [INFO ] Invariant cache hit.
[2024-05-25 18:49:11] [INFO ] Implicit Places using invariants and state equation in 6435 ms returned []
Implicit Place search using SMT with State Equation took 10654 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-25 18:49:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2816/3286 variables, and 2408 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 0/2845 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/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2816 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 441/3257 variables, 2816/5224 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3257 variables, 382/5606 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3257/3286 variables, and 5606 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2816/2845 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60686ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60691ms
Finished structural reductions in LTL mode , in 1 iterations and 71468 ms. Remains : 2845/2845 places, 441/441 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-05 finished in 238132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-28-LTLFireability-14
Stuttering acceptance computed with spot in 118 ms :[true, p0, p0, p0]
Support contains 1 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LI_LTL 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.7 ms
Discarding 871 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 57 place count 2008 transition count 331
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 2008 transition count 331
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 117 place count 2006 transition count 329
Applied a total of 117 rules in 248 ms. Remains 2006 /2936 variables (removed 930) and now considering 329/446 (removed 117) transitions.
// Phase 1: matrix 329 rows 2006 cols
[2024-05-25 18:50:13] [INFO ] Computed 1680 invariants in 20 ms
[2024-05-25 18:50:15] [INFO ] Implicit Places using invariants in 2792 ms returned []
[2024-05-25 18:50:15] [INFO ] Invariant cache hit.
[2024-05-25 18:50:23] [INFO ] Implicit Places using invariants and state equation in 7033 ms returned [1069, 1070, 1072, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1709, 1710, 1711, 1712, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1927]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 9827 ms to find 58 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1948/2936 places, 329/446 transitions.
Applied a total of 0 rules in 88 ms. Remains 1948 /1948 variables (removed 0) and now considering 329/329 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 10164 ms. Remains : 1948/2936 places, 329/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-28-LTLFireability-14
Product exploration explored 100000 steps with 2814 reset in 335 ms.
Product exploration explored 100000 steps with 2813 reset in 362 ms.
Computed a total of 1948 stabilizing places and 329 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1948 transition count 329
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (1123 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (32 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2138457 steps, run timeout after 3001 ms. (steps per millisecond=712 ) properties seen :0 out of 1
Probabilistic random walk after 2138457 steps, saw 272646 distinct states, run finished after 3002 ms. (steps per millisecond=712 ) properties seen :0
// Phase 1: matrix 329 rows 1948 cols
[2024-05-25 18:50:27] [INFO ] Computed 1624 invariants in 20 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 207/211 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/256 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1608/1864 variables, 1568/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1864 variables, 29/1657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1864 variables, 0/1657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 289/2153 variables, 1769/3426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2153 variables, 0/3426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/2273 variables, 116/3542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2273 variables, 28/3570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2273 variables, 0/3570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/2277 variables, 2/3572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2277 variables, 0/3572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2277 variables, 0/3572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2277/2277 variables, and 3572 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1043 ms.
Refiners :[Generalized P Invariants (flows): 1624/1624 constraints, State Equation: 1948/1948 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 207/211 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/256 variables, 28/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1608/1864 variables, 1568/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1864 variables, 29/1658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1864 variables, 0/1658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 289/2153 variables, 1769/3427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2153 variables, 0/3427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/2273 variables, 116/3543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2273 variables, 28/3571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2273 variables, 0/3571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/2277 variables, 2/3573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2277 variables, 0/3573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2277 variables, 0/3573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2277/2277 variables, and 3573 constraints, problems are : Problem set: 0 solved, 1 unsolved in 948 ms.
Refiners :[Generalized P Invariants (flows): 1624/1624 constraints, State Equation: 1948/1948 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2023ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 149 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 116 ms :[true, p0, p0, p0]
Support contains 1 out of 1948 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1948/1948 places, 329/329 transitions.
Applied a total of 0 rules in 70 ms. Remains 1948 /1948 variables (removed 0) and now considering 329/329 (removed 0) transitions.
[2024-05-25 18:50:29] [INFO ] Invariant cache hit.
[2024-05-25 18:50:32] [INFO ] Implicit Places using invariants in 3060 ms returned []
[2024-05-25 18:50:32] [INFO ] Invariant cache hit.
[2024-05-25 18:50:43] [INFO ] Implicit Places using invariants and state equation in 10143 ms returned []
Implicit Place search using SMT with State Equation took 13208 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-25 18:50:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1919 variables, 1624/1624 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1919 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 329/2248 variables, 1919/3543 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 0/3543 constraints. Problems are: Problem set: 0 solved, 270 unsolved
SMT process timed out in 30352ms, After SMT, problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 30355ms
Finished structural reductions in LTL mode , in 1 iterations and 43635 ms. Remains : 1948/1948 places, 329/329 transitions.
Computed a total of 1948 stabilizing places and 329 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1948 transition count 329
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (1126 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (32 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2148193 steps, run timeout after 3001 ms. (steps per millisecond=715 ) properties seen :0 out of 1
Probabilistic random walk after 2148193 steps, saw 273572 distinct states, run finished after 3001 ms. (steps per millisecond=715 ) properties seen :0
[2024-05-25 18:51:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 207/211 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/256 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1608/1864 variables, 1568/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1864 variables, 29/1657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1864 variables, 0/1657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 289/2153 variables, 1769/3426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2153 variables, 0/3426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/2273 variables, 116/3542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2273 variables, 28/3570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2273 variables, 0/3570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/2277 variables, 2/3572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2277 variables, 0/3572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2277 variables, 0/3572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2277/2277 variables, and 3572 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1031 ms.
Refiners :[Generalized P Invariants (flows): 1624/1624 constraints, State Equation: 1948/1948 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 207/211 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/256 variables, 28/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1608/1864 variables, 1568/1629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1864 variables, 29/1658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1864 variables, 0/1658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 289/2153 variables, 1769/3427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2153 variables, 0/3427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/2273 variables, 116/3543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2273 variables, 28/3571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2273 variables, 0/3571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/2277 variables, 2/3573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2277 variables, 0/3573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2277 variables, 0/3573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2277/2277 variables, and 3573 constraints, problems are : Problem set: 0 solved, 1 unsolved in 943 ms.
Refiners :[Generalized P Invariants (flows): 1624/1624 constraints, State Equation: 1948/1948 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1986ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 166 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 112 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 201 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 2812 reset in 356 ms.
Product exploration explored 100000 steps with 2811 reset in 370 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 131 ms :[true, p0, p0, p0]
Support contains 1 out of 1948 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1948/1948 places, 329/329 transitions.
Applied a total of 0 rules in 87 ms. Remains 1948 /1948 variables (removed 0) and now considering 329/329 (removed 0) transitions.
[2024-05-25 18:51:20] [INFO ] Redundant transitions in 29 ms returned []
Running 270 sub problems to find dead transitions.
[2024-05-25 18:51:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1919 variables, 1624/1624 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1919 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 329/2248 variables, 1919/3543 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 0/3543 constraints. Problems are: Problem set: 0 solved, 270 unsolved
SMT process timed out in 30342ms, After SMT, problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 30344ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30473 ms. Remains : 1948/1948 places, 329/329 transitions.
Support contains 1 out of 1948 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1948/1948 places, 329/329 transitions.
Applied a total of 0 rules in 87 ms. Remains 1948 /1948 variables (removed 0) and now considering 329/329 (removed 0) transitions.
[2024-05-25 18:51:51] [INFO ] Invariant cache hit.
[2024-05-25 18:51:53] [INFO ] Implicit Places using invariants in 2968 ms returned []
[2024-05-25 18:51:53] [INFO ] Invariant cache hit.
[2024-05-25 18:52:03] [INFO ] Implicit Places using invariants and state equation in 9267 ms returned []
Implicit Place search using SMT with State Equation took 12239 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-25 18:52:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1919 variables, 1624/1624 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1919 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 329/2248 variables, 1919/3543 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.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 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 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 0.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)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s147 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 1.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 1.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 1.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 1.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 1.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 1.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 1.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 1.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 1.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 1.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 1.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 1.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 1.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 timeout
0.0)
(s1011 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2248/2277 variables, and 3543 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1624/1624 constraints, State Equation: 1919/1948 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1919 variables, 1624/1624 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1919 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 329/2248 variables, 1919/3543 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 270/3813 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2248/2277 variables, and 3813 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1624/1624 constraints, State Equation: 1919/1948 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 60369ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60373ms
Finished structural reductions in LTL mode , in 1 iterations and 72701 ms. Remains : 1948/1948 places, 329/329 transitions.
Treatment of property QuasiCertifProtocol-PT-28-LTLFireability-14 finished in 170957 ms.
[2024-05-25 18:53:03] [INFO ] Flatten gal took : 69 ms
[2024-05-25 18:53:03] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-25 18:53:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2936 places, 446 transitions and 6222 arcs took 8 ms.
Total runtime 1572534 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running QuasiCertifProtocol-PT-28
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2936
TRANSITIONS: 446
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.028s, Sys 0.009s]
SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2109
MODEL NAME: /home/mcc/execution/409/model
2936 places, 446 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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-PT-28"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is QuasiCertifProtocol-PT-28, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662335900100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-28.tgz
mv QuasiCertifProtocol-PT-28 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;