About the Execution of ITS-Tools for QuasiCertifProtocol-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.155 | 3600000.00 | 3338741.00 | 738908.90 | FFFFFFFF?FTTF?FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r293-tall-167873946000884.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is QuasiCertifProtocol-PT-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873946000884
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 42K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 289K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 01:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 593K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 360K Mar 5 18:23 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-18-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678993647576
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 19:07:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 19:07:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 19:07:29] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-16 19:07:29] [INFO ] Transformed 1398 places.
[2023-03-16 19:07:29] [INFO ] Transformed 296 transitions.
[2023-03-16 19:07:29] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 946 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1356 transition count 296
Applied a total of 42 rules in 57 ms. Remains 1356 /1398 variables (removed 42) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2023-03-16 19:07:29] [INFO ] Computed 1062 place invariants in 70 ms
[2023-03-16 19:07:30] [INFO ] Implicit Places using invariants in 823 ms returned []
[2023-03-16 19:07:30] [INFO ] Invariant cache hit.
[2023-03-16 19:07:31] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 931, 933, 934]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 1959 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1339/1398 places, 296/296 transitions.
Applied a total of 0 rules in 17 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2034 ms. Remains : 1339/1398 places, 296/296 transitions.
Support contains 946 out of 1339 places after structural reductions.
[2023-03-16 19:07:31] [INFO ] Flatten gal took : 123 ms
[2023-03-16 19:07:32] [INFO ] Flatten gal took : 66 ms
[2023-03-16 19:07:32] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 945 out of 1339 places (down from 946) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 441 resets, run finished after 619 ms. (steps per millisecond=16 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-16 19:07:33] [INFO ] Computed 1045 place invariants in 43 ms
[2023-03-16 19:07:34] [INFO ] [Real]Absence check using 0 positive and 1045 generalized place invariants in 197 ms returned sat
[2023-03-16 19:07:34] [INFO ] After 1089ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-16 19:07:35] [INFO ] [Nat]Absence check using 0 positive and 1045 generalized place invariants in 184 ms returned sat
[2023-03-16 19:07:37] [INFO ] After 1987ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :15
[2023-03-16 19:07:39] [INFO ] After 3860ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :15
Attempting to minimize the solution found.
Minimization took 2270 ms.
[2023-03-16 19:07:41] [INFO ] After 7275ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :15
Fused 16 Parikh solutions to 13 different solutions.
Finished Parikh walk after 138 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=34 )
Parikh walk visited 15 properties in 38 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1339 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1339 transition count 296
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 1339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Graph (complete) has 8709 edges and 1339 vertex of which 951 are kept as prefixes of interest. Removing 388 places using SCC suffix rule.24 ms
Discarding 388 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 951 transition count 281
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 921 transition count 221
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 921 transition count 221
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 1 with 4 rules applied. Total rules applied 71 place count 919 transition count 219
Applied a total of 71 rules in 209 ms. Remains 919 /1339 variables (removed 420) and now considering 219/296 (removed 77) transitions.
// Phase 1: matrix 219 rows 919 cols
[2023-03-16 19:07:42] [INFO ] Computed 703 place invariants in 5 ms
[2023-03-16 19:07:43] [INFO ] Implicit Places using invariants in 912 ms returned []
[2023-03-16 19:07:43] [INFO ] Invariant cache hit.
[2023-03-16 19:07:44] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned [515, 516]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2474 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 917/1339 places, 219/296 transitions.
Applied a total of 0 rules in 42 ms. Remains 917 /917 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2725 ms. Remains : 917/1339 places, 219/296 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s98 1) (GEQ s861 1) (GEQ s862 1) (GEQ s863 1) (GEQ s864 1) (GEQ s865 1) (GEQ s866 1) (GEQ s867 1) (GEQ s868 1) (GEQ s869 1) (GEQ s870 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-00 finished in 2931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 21 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-16 19:07:44] [INFO ] Computed 1045 place invariants in 19 ms
[2023-03-16 19:07:46] [INFO ] Implicit Places using invariants in 1245 ms returned []
[2023-03-16 19:07:46] [INFO ] Invariant cache hit.
[2023-03-16 19:07:48] [INFO ] Implicit Places using invariants and state equation in 2117 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3368 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 46 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3453 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s127 1), p0:(AND (GEQ s146 1) (GEQ s1281 1) (GEQ s1282 1) (GEQ s1283 1) (GEQ s1284 1) (GEQ s1285 1) (GEQ s1286 1) (GEQ s1287 1) (GEQ s1288 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-01 finished in 3591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Graph (complete) has 8709 edges and 1339 vertex of which 951 are kept as prefixes of interest. Removing 388 places using SCC suffix rule.9 ms
Discarding 388 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 950 transition count 280
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 920 transition count 220
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 920 transition count 220
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 1 with 2 rules applied. Total rules applied 69 place count 919 transition count 219
Applied a total of 69 rules in 110 ms. Remains 919 /1339 variables (removed 420) and now considering 219/296 (removed 77) transitions.
// Phase 1: matrix 219 rows 919 cols
[2023-03-16 19:07:48] [INFO ] Computed 703 place invariants in 10 ms
[2023-03-16 19:07:49] [INFO ] Implicit Places using invariants in 771 ms returned []
[2023-03-16 19:07:49] [INFO ] Invariant cache hit.
[2023-03-16 19:07:50] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned [516, 517, 758, 759, 760, 761, 762, 763, 766, 767, 768, 769, 770, 771, 772, 773, 879, 880, 881, 882, 885]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 2189 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 898/1339 places, 219/296 transitions.
Applied a total of 0 rules in 36 ms. Remains 898 /898 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2335 ms. Remains : 898/1339 places, 219/296 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s90 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-02 finished in 2393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&(p1||X(X(F(!p2)))))))))'
Support contains 41 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 46 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-16 19:07:50] [INFO ] Computed 1045 place invariants in 17 ms
[2023-03-16 19:07:52] [INFO ] Implicit Places using invariants in 1239 ms returned []
[2023-03-16 19:07:52] [INFO ] Invariant cache hit.
[2023-03-16 19:07:54] [INFO ] Implicit Places using invariants and state equation in 2138 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3382 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 44 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3472 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 257 ms :[true, p2, p0, p0, (AND p0 p2), (AND p0 p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(AND (GEQ s127 1) (GEQ s1305 1) (GEQ s1306 1) (GEQ s1307 1) (GEQ s1308 1) (GEQ s1309 1) (GEQ s1310 1) (GEQ s1313 1) (GEQ s1314 1) (GEQ s1315 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-03 finished in 3754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(p1)||X(G((G(p2) U p3))))))'
Support contains 836 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 13 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-16 19:07:54] [INFO ] Invariant cache hit.
[2023-03-16 19:07:55] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-16 19:07:55] [INFO ] Invariant cache hit.
[2023-03-16 19:07:56] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1712 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 11 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1737 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 394 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={1} source=1 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={0, 1} source=1 dest: 7}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 p3 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={1} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={1} source=7 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={0, 1} source=7 dest: 7}]], initial=1, aps=[p1:(OR (AND (GEQ s78 1) (GEQ s1264 1)) (AND (GEQ s77 1) (GEQ s1265 1)) (AND (GEQ s93 1) (GEQ s1251 1)) (AND (GEQ s86 1) (GEQ s1256 1)) (AND (GEQ s97 1) (G...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-05 finished in 2173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 20 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 50 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-16 19:07:56] [INFO ] Invariant cache hit.
[2023-03-16 19:07:58] [INFO ] Implicit Places using invariants in 1248 ms returned []
[2023-03-16 19:07:58] [INFO ] Invariant cache hit.
[2023-03-16 19:08:00] [INFO ] Implicit Places using invariants and state equation in 2114 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3364 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 43 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3457 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s127 1) (GEQ s1305 1) (GEQ s1306 1) (GEQ s1307 1) (GEQ s1308 1) (GEQ s1309 1) (GEQ s1310 1) (GEQ s1313 1) (GEQ s1314 1) (GEQ s1315 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-06 finished in 3554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 21 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 42 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-16 19:08:00] [INFO ] Invariant cache hit.
[2023-03-16 19:08:01] [INFO ] Implicit Places using invariants in 1300 ms returned []
[2023-03-16 19:08:01] [INFO ] Invariant cache hit.
[2023-03-16 19:08:03] [INFO ] Implicit Places using invariants and state equation in 2141 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3446 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 44 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3532 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(LT s1268 1), p0:(OR (LT s125 1) (LT s1236 1) (LT s1237 1) (LT s1238 1) (LT s1239 1) (LT s1240 1) (LT s1241 1) (LT s1242 1) (LT s1243 1) (LT s1244 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-07 finished in 3739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 53 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-16 19:08:04] [INFO ] Invariant cache hit.
[2023-03-16 19:08:05] [INFO ] Implicit Places using invariants in 1265 ms returned []
[2023-03-16 19:08:05] [INFO ] Invariant cache hit.
[2023-03-16 19:08:07] [INFO ] Implicit Places using invariants and state equation in 2191 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3459 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 50 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3563 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s105 1) (LT s1273 1)), p0:(OR (LT s105 1) (LT s1273 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4415 reset in 320 ms.
Product exploration explored 100000 steps with 4414 reset in 268 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 342 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, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1047269 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :{}
Probabilistic random walk after 1047269 steps, saw 149857 distinct states, run finished after 3002 ms. (steps per millisecond=348 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-16 19:08:12] [INFO ] Computed 1044 place invariants in 107 ms
[2023-03-16 19:08:12] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 168 ms returned sat
[2023-03-16 19:08:13] [INFO ] After 372ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3
[2023-03-16 19:08:13] [INFO ] After 547ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-16 19:08:13] [INFO ] After 1087ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 23 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 3 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (F (G p1)), (F (G p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 9 factoid took 512 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 54 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-16 19:08:14] [INFO ] Invariant cache hit.
[2023-03-16 19:08:15] [INFO ] Implicit Places using invariants in 1197 ms returned []
[2023-03-16 19:08:15] [INFO ] Invariant cache hit.
[2023-03-16 19:08:17] [INFO ] Implicit Places using invariants and state equation in 2125 ms returned []
Implicit Place search using SMT with State Equation took 3332 ms to find 0 implicit places.
[2023-03-16 19:08:17] [INFO ] Invariant cache hit.
[2023-03-16 19:08:18] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3848 ms. Remains : 1337/1337 places, 296/296 transitions.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 242 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 443 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1203130 steps, run timeout after 3001 ms. (steps per millisecond=400 ) properties seen :{}
Probabilistic random walk after 1203130 steps, saw 171916 distinct states, run finished after 3001 ms. (steps per millisecond=400 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 19:08:21] [INFO ] Invariant cache hit.
[2023-03-16 19:08:22] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 183 ms returned sat
[2023-03-16 19:08:22] [INFO ] After 368ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-16 19:08:22] [INFO ] After 482ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-16 19:08:22] [INFO ] After 952ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 23 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 306 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4416 reset in 217 ms.
Product exploration explored 100000 steps with 4416 reset in 228 ms.
Built C files in :
/tmp/ltsmin3268775278552759506
[2023-03-16 19:08:24] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3268775278552759506
Running compilation step : cd /tmp/ltsmin3268775278552759506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 985 ms.
Running link step : cd /tmp/ltsmin3268775278552759506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3268775278552759506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6066211856707575212.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 45 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-16 19:08:39] [INFO ] Invariant cache hit.
[2023-03-16 19:08:40] [INFO ] Implicit Places using invariants in 1282 ms returned []
[2023-03-16 19:08:40] [INFO ] Invariant cache hit.
[2023-03-16 19:08:42] [INFO ] Implicit Places using invariants and state equation in 2231 ms returned []
Implicit Place search using SMT with State Equation took 3516 ms to find 0 implicit places.
[2023-03-16 19:08:42] [INFO ] Invariant cache hit.
[2023-03-16 19:08:43] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4002 ms. Remains : 1337/1337 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin3610265993525374609
[2023-03-16 19:08:43] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3610265993525374609
Running compilation step : cd /tmp/ltsmin3610265993525374609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 895 ms.
Running link step : cd /tmp/ltsmin3610265993525374609;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3610265993525374609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2463180213994547580.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 19:08:58] [INFO ] Flatten gal took : 45 ms
[2023-03-16 19:08:58] [INFO ] Flatten gal took : 43 ms
[2023-03-16 19:08:58] [INFO ] Time to serialize gal into /tmp/LTL13250758199717383623.gal : 7 ms
[2023-03-16 19:08:58] [INFO ] Time to serialize properties into /tmp/LTL3056844293607667077.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13250758199717383623.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14766076822470888419.hoa' '-atoms' '/tmp/LTL3056844293607667077.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3056844293607667077.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14766076822470888419.hoa
Detected timeout of ITS tools.
[2023-03-16 19:09:13] [INFO ] Flatten gal took : 36 ms
[2023-03-16 19:09:13] [INFO ] Flatten gal took : 34 ms
[2023-03-16 19:09:13] [INFO ] Time to serialize gal into /tmp/LTL12876604349847508129.gal : 7 ms
[2023-03-16 19:09:13] [INFO ] Time to serialize properties into /tmp/LTL7028120396065163020.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12876604349847508129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7028120396065163020.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((s2_3<1)||(n3_3<1))")||(X("((s2_3<1)||(n3_3<1))"))))))
Formula 0 simplified : XF(!"((s2_3<1)||(n3_3<1))" & X!"((s2_3<1)||(n3_3<1))")
Detected timeout of ITS tools.
[2023-03-16 19:09:28] [INFO ] Flatten gal took : 48 ms
[2023-03-16 19:09:28] [INFO ] Applying decomposition
[2023-03-16 19:09:28] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5895017087307213298.txt' '-o' '/tmp/graph5895017087307213298.bin' '-w' '/tmp/graph5895017087307213298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5895017087307213298.bin' '-l' '-1' '-v' '-w' '/tmp/graph5895017087307213298.weights' '-q' '0' '-e' '0.001'
[2023-03-16 19:09:29] [INFO ] Decomposing Gal with order
[2023-03-16 19:09:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 19:09:29] [INFO ] Removed a total of 188 redundant transitions.
[2023-03-16 19:09:29] [INFO ] Flatten gal took : 184 ms
[2023-03-16 19:09:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 55 ms.
[2023-03-16 19:09:29] [INFO ] Time to serialize gal into /tmp/LTL214573695871572486.gal : 16 ms
[2023-03-16 19:09:29] [INFO ] Time to serialize properties into /tmp/LTL6587720995633669627.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL214573695871572486.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6587720995633669627.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i24.i1.u61.s2_3<1)||(i24.i1.u83.n3_3<1))")||(X("((i24.i1.u61.s2_3<1)||(i24.i1.u83.n3_3<1))"))))))
Formula 0 simplified : XF(!"((i24.i1.u61.s2_3<1)||(i24.i1.u83.n3_3<1))" & X!"((i24.i1.u61.s2_3<1)||(i24.i1.u83.n3_3<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12227002578303500996
[2023-03-16 19:09:44] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12227002578303500996
Running compilation step : cd /tmp/ltsmin12227002578303500996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 891 ms.
Running link step : cd /tmp/ltsmin12227002578303500996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12227002578303500996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-08 finished in 115566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 44 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-16 19:09:59] [INFO ] Computed 1045 place invariants in 17 ms
[2023-03-16 19:10:01] [INFO ] Implicit Places using invariants in 1320 ms returned []
[2023-03-16 19:10:01] [INFO ] Invariant cache hit.
[2023-03-16 19:10:03] [INFO ] Implicit Places using invariants and state equation in 2139 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3462 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3551 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s128 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-09 finished in 3695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Support contains 21 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 53 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-16 19:10:03] [INFO ] Invariant cache hit.
[2023-03-16 19:10:04] [INFO ] Implicit Places using invariants in 1280 ms returned []
[2023-03-16 19:10:04] [INFO ] Invariant cache hit.
[2023-03-16 19:10:07] [INFO ] Implicit Places using invariants and state equation in 2352 ms returned [917]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3636 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1339 places, 296/296 transitions.
Applied a total of 0 rules in 45 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3735 ms. Remains : 1338/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s125 1), p0:(OR (LT s759 1) (LT s760 1) (LT s761 1) (LT s762 1) (LT s763 1) (LT s764 1) (LT s765 1) (LT s766 1) (LT s771 1) (LT s772 1) (LT s775 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4423 reset in 263 ms.
Product exploration explored 100000 steps with 4419 reset in 239 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
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 (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 9 factoid took 225 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-10 finished in 4881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X(F(p1))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Applied a total of 0 rules in 43 ms. Remains 1339 /1339 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-16 19:10:08] [INFO ] Invariant cache hit.
[2023-03-16 19:10:09] [INFO ] Implicit Places using invariants in 1286 ms returned []
[2023-03-16 19:10:09] [INFO ] Invariant cache hit.
[2023-03-16 19:10:12] [INFO ] Implicit Places using invariants and state equation in 2460 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3756 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1339 places, 296/296 transitions.
Applied a total of 0 rules in 42 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3843 ms. Remains : 1337/1339 places, 296/296 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LT s1268 1), p1:(GEQ s146 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10861 reset in 401 ms.
Product exploration explored 100000 steps with 10750 reset in 375 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1)]
Knowledge based reduction with 3 factoid took 245 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
// Phase 1: matrix 296 rows 1337 cols
[2023-03-16 19:10:14] [INFO ] Computed 1044 place invariants in 115 ms
[2023-03-16 19:10:15] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 873 ms returned sat
[2023-03-16 19:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:10:19] [INFO ] [Real]Absence check using state equation in 4205 ms returned sat
[2023-03-16 19:10:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:10:20] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 873 ms returned sat
[2023-03-16 19:10:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:10:28] [INFO ] [Nat]Absence check using state equation in 7292 ms returned sat
[2023-03-16 19:10:28] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 23 ms.
[2023-03-16 19:10:28] [INFO ] Added : 0 causal constraints over 0 iterations in 111 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 1337 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 : 1337/1337 places, 296/296 transitions.
Graph (complete) has 8669 edges and 1337 vertex of which 949 are kept as prefixes of interest. Removing 388 places using SCC suffix rule.3 ms
Discarding 388 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 949 transition count 281
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 919 transition count 221
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 919 transition count 221
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 1 with 4 rules applied. Total rules applied 71 place count 917 transition count 219
Applied a total of 71 rules in 120 ms. Remains 917 /1337 variables (removed 420) and now considering 219/296 (removed 77) transitions.
// Phase 1: matrix 219 rows 917 cols
[2023-03-16 19:10:28] [INFO ] Computed 702 place invariants in 9 ms
[2023-03-16 19:10:29] [INFO ] Implicit Places using invariants in 773 ms returned []
[2023-03-16 19:10:29] [INFO ] Invariant cache hit.
[2023-03-16 19:10:30] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 2414 ms to find 0 implicit places.
[2023-03-16 19:10:30] [INFO ] Redundant transitions in 33 ms returned [182]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 218 rows 917 cols
[2023-03-16 19:10:30] [INFO ] Computed 702 place invariants in 9 ms
[2023-03-16 19:10:31] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 917/1337 places, 218/296 transitions.
Graph (complete) has 8837 edges and 917 vertex of which 194 are kept as prefixes of interest. Removing 723 places using SCC suffix rule.1 ms
Discarding 723 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 176 transition count 162
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 176 transition count 162
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 55 place count 158 transition count 126
Iterating global reduction 0 with 18 rules applied. Total rules applied 73 place count 158 transition count 126
Applied a total of 73 rules in 13 ms. Remains 158 /917 variables (removed 759) and now considering 126/218 (removed 92) transitions.
// Phase 1: matrix 126 rows 158 cols
[2023-03-16 19:10:31] [INFO ] Computed 36 place invariants in 1 ms
[2023-03-16 19:10:31] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-16 19:10:31] [INFO ] Invariant cache hit.
[2023-03-16 19:10:31] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/1337 places, 126/296 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3135 ms. Remains : 158/1337 places, 126/296 transitions.
Computed a total of 158 stabilizing places and 126 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 158 transition count 126
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 321 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
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 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
[2023-03-16 19:10:32] [INFO ] Invariant cache hit.
[2023-03-16 19:10:32] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 5 ms returned sat
[2023-03-16 19:10:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:10:32] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-16 19:10:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:10:32] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 5 ms returned sat
[2023-03-16 19:10:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:10:32] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-16 19:10:32] [INFO ] Computed and/alt/rep : 99/137/99 causal constraints (skipped 6 transitions) in 9 ms.
[2023-03-16 19:10:32] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Product exploration explored 100000 steps with 10739 reset in 206 ms.
Product exploration explored 100000 steps with 10690 reset in 243 ms.
Built C files in :
/tmp/ltsmin10781078023183657590
[2023-03-16 19:10:32] [INFO ] Computing symmetric may disable matrix : 126 transitions.
[2023-03-16 19:10:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:10:32] [INFO ] Computing symmetric may enable matrix : 126 transitions.
[2023-03-16 19:10:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:10:32] [INFO ] Computing Do-Not-Accords matrix : 126 transitions.
[2023-03-16 19:10:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:10:32] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10781078023183657590
Running compilation step : cd /tmp/ltsmin10781078023183657590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 278 ms.
Running link step : cd /tmp/ltsmin10781078023183657590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10781078023183657590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2661962021615656008.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 126/126 transitions.
Applied a total of 0 rules in 10 ms. Remains 158 /158 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-16 19:10:48] [INFO ] Invariant cache hit.
[2023-03-16 19:10:48] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-16 19:10:48] [INFO ] Invariant cache hit.
[2023-03-16 19:10:48] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-16 19:10:48] [INFO ] Redundant transitions in 46 ms returned [121]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 125 rows 158 cols
[2023-03-16 19:10:48] [INFO ] Computed 36 place invariants in 1 ms
[2023-03-16 19:10:48] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/158 places, 125/126 transitions.
Graph (complete) has 991 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 4 ms. Remains 157 /158 variables (removed 1) and now considering 124/125 (removed 1) transitions.
// Phase 1: matrix 124 rows 157 cols
[2023-03-16 19:10:48] [INFO ] Computed 36 place invariants in 0 ms
[2023-03-16 19:10:48] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-16 19:10:48] [INFO ] Invariant cache hit.
[2023-03-16 19:10:48] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 157/158 places, 124/126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 560 ms. Remains : 157/158 places, 124/126 transitions.
Built C files in :
/tmp/ltsmin12355744066693165453
[2023-03-16 19:10:48] [INFO ] Computing symmetric may disable matrix : 124 transitions.
[2023-03-16 19:10:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:10:48] [INFO ] Computing symmetric may enable matrix : 124 transitions.
[2023-03-16 19:10:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:10:48] [INFO ] Computing Do-Not-Accords matrix : 124 transitions.
[2023-03-16 19:10:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:10:48] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12355744066693165453
Running compilation step : cd /tmp/ltsmin12355744066693165453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 271 ms.
Running link step : cd /tmp/ltsmin12355744066693165453;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12355744066693165453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4723002801629281876.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 19:11:03] [INFO ] Flatten gal took : 5 ms
[2023-03-16 19:11:03] [INFO ] Flatten gal took : 5 ms
[2023-03-16 19:11:03] [INFO ] Time to serialize gal into /tmp/LTL10348202196999619138.gal : 1 ms
[2023-03-16 19:11:03] [INFO ] Time to serialize properties into /tmp/LTL3649529661867171171.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10348202196999619138.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13027114147949157466.hoa' '-atoms' '/tmp/LTL3649529661867171171.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3649529661867171171.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13027114147949157466.hoa
Detected timeout of ITS tools.
[2023-03-16 19:11:18] [INFO ] Flatten gal took : 6 ms
[2023-03-16 19:11:18] [INFO ] Flatten gal took : 5 ms
[2023-03-16 19:11:18] [INFO ] Time to serialize gal into /tmp/LTL9477190937150374184.gal : 1 ms
[2023-03-16 19:11:18] [INFO ] Time to serialize properties into /tmp/LTL1166321355999305536.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9477190937150374184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1166321355999305536.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("(Astart>=1)"))&&(X(F("(a1>=1)")))))
Formula 0 simplified : G!"(Astart>=1)" | XG!"(a1>=1)"
Detected timeout of ITS tools.
[2023-03-16 19:11:33] [INFO ] Flatten gal took : 10 ms
[2023-03-16 19:11:33] [INFO ] Applying decomposition
[2023-03-16 19:11:33] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15235235193079516306.txt' '-o' '/tmp/graph15235235193079516306.bin' '-w' '/tmp/graph15235235193079516306.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15235235193079516306.bin' '-l' '-1' '-v' '-w' '/tmp/graph15235235193079516306.weights' '-q' '0' '-e' '0.001'
[2023-03-16 19:11:33] [INFO ] Decomposing Gal with order
[2023-03-16 19:11:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 19:11:33] [INFO ] Removed a total of 135 redundant transitions.
[2023-03-16 19:11:33] [INFO ] Flatten gal took : 10 ms
[2023-03-16 19:11:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 3 ms.
[2023-03-16 19:11:33] [INFO ] Time to serialize gal into /tmp/LTL9107851546565190327.gal : 2 ms
[2023-03-16 19:11:33] [INFO ] Time to serialize properties into /tmp/LTL7180762125908547943.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9107851546565190327.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7180762125908547943.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F("(i11.u13.Astart>=1)"))&&(X(F("(i11.u13.a1>=1)")))))
Formula 0 simplified : G!"(i11.u13.Astart>=1)" | XG!"(i11.u13.a1>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3120749659937905263
[2023-03-16 19:11:49] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3120749659937905263
Running compilation step : cd /tmp/ltsmin3120749659937905263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 238 ms.
Running link step : cd /tmp/ltsmin3120749659937905263;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3120749659937905263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(<>((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 7716 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-11 finished in 108800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&(!p1 U (G(!p1)||(!p1&&G(!p2))))))'
Support contains 5 out of 1339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Graph (complete) has 8709 edges and 1339 vertex of which 1319 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions 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 1317 transition count 292
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1317 transition count 292
Applied a total of 4 rules in 199 ms. Remains 1317 /1339 variables (removed 22) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1317 cols
[2023-03-16 19:11:57] [INFO ] Computed 1027 place invariants in 18 ms
[2023-03-16 19:11:58] [INFO ] Implicit Places using invariants in 1218 ms returned []
[2023-03-16 19:11:58] [INFO ] Invariant cache hit.
[2023-03-16 19:12:00] [INFO ] Implicit Places using invariants and state equation in 2104 ms returned [914, 915, 1156, 1157, 1158, 1159, 1160, 1161, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1277, 1278, 1279, 1280, 1283]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 3328 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1339 places, 292/296 transitions.
Applied a total of 0 rules in 47 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3575 ms. Remains : 1296/1339 places, 292/296 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) p1), true, (NOT p0), (NOT p0), p1, (AND p1 p2), p2]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 p1), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 1}, { cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s126 1), p0:(OR (LT s0 1) (LT s106 1)), p2:(AND (GEQ s102 1) (GEQ s1288 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 4408 reset in 275 ms.
Product exploration explored 100000 steps with 4418 reset in 286 ms.
Computed a total of 1296 stabilizing places and 292 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1296 transition count 292
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 (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 16 factoid took 760 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Incomplete random walk after 10000 steps, including 423 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 796114 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :{}
Probabilistic random walk after 796114 steps, saw 116122 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 292 rows 1296 cols
[2023-03-16 19:12:06] [INFO ] Computed 1008 place invariants in 123 ms
[2023-03-16 19:12:06] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 242 ms returned sat
[2023-03-16 19:12:06] [INFO ] After 321ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-16 19:12:06] [INFO ] After 373ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-16 19:12:06] [INFO ] After 926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:5
[2023-03-16 19:12:07] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 192 ms returned sat
[2023-03-16 19:12:07] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 19:12:08] [INFO ] After 784ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-16 19:12:08] [INFO ] After 1494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 22 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 6 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND p1 p2)), (F p2), (F (AND p1 (NOT p2))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 16 factoid took 928 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Stuttering acceptance computed with spot in 166 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Support contains 3 out of 1296 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1296/1296 places, 292/292 transitions.
Applied a total of 0 rules in 32 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2023-03-16 19:12:09] [INFO ] Invariant cache hit.
[2023-03-16 19:12:10] [INFO ] Implicit Places using invariants in 1171 ms returned []
[2023-03-16 19:12:10] [INFO ] Invariant cache hit.
[2023-03-16 19:12:12] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 3199 ms to find 0 implicit places.
[2023-03-16 19:12:12] [INFO ] Invariant cache hit.
[2023-03-16 19:12:13] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3636 ms. Remains : 1296/1296 places, 292/292 transitions.
Computed a total of 1296 stabilizing places and 292 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1296 transition count 292
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 p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 686 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Incomplete random walk after 10000 steps, including 421 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 863833 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :{}
Probabilistic random walk after 863833 steps, saw 126026 distinct states, run finished after 3001 ms. (steps per millisecond=287 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-16 19:12:17] [INFO ] Invariant cache hit.
[2023-03-16 19:12:18] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 175 ms returned sat
[2023-03-16 19:12:18] [INFO ] After 335ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-16 19:12:18] [INFO ] After 390ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-16 19:12:18] [INFO ] After 912ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:5
[2023-03-16 19:12:18] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 164 ms returned sat
[2023-03-16 19:12:19] [INFO ] After 572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 19:12:19] [INFO ] After 855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-16 19:12:20] [INFO ] After 1541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 22 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 6 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND p1 p2)), (F p2), (F (AND p1 (NOT p2))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 14 factoid took 666 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Stuttering acceptance computed with spot in 178 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Stuttering acceptance computed with spot in 161 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Product exploration explored 100000 steps with 4210 reset in 263 ms.
Product exploration explored 100000 steps with 4209 reset in 280 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 173 ms :[true, (AND p1 p2), p1, p2, (AND p1 p2)]
Support contains 3 out of 1296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1296/1296 places, 292/292 transitions.
Graph (complete) has 8913 edges and 1296 vertex of which 935 are kept as prefixes of interest. Removing 361 places using SCC suffix rule.6 ms
Discarding 361 places :
Also discarding 0 output transitions
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 898 transition count 218
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 898 transition count 218
Applied a total of 75 rules in 123 ms. Remains 898 /1296 variables (removed 398) and now considering 218/292 (removed 74) transitions.
[2023-03-16 19:12:22] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 218 rows 898 cols
[2023-03-16 19:12:22] [INFO ] Computed 684 place invariants in 6 ms
[2023-03-16 19:12:22] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 898/1296 places, 218/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 440 ms. Remains : 898/1296 places, 218/292 transitions.
Built C files in :
/tmp/ltsmin4332839317910652862
[2023-03-16 19:12:22] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4332839317910652862
Running compilation step : cd /tmp/ltsmin4332839317910652862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 883 ms.
Running link step : cd /tmp/ltsmin4332839317910652862;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4332839317910652862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7773962960859231856.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1296/1296 places, 292/292 transitions.
Applied a total of 0 rules in 28 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
// Phase 1: matrix 292 rows 1296 cols
[2023-03-16 19:12:37] [INFO ] Computed 1008 place invariants in 114 ms
[2023-03-16 19:12:38] [INFO ] Implicit Places using invariants in 1213 ms returned []
[2023-03-16 19:12:38] [INFO ] Invariant cache hit.
[2023-03-16 19:12:41] [INFO ] Implicit Places using invariants and state equation in 2053 ms returned []
Implicit Place search using SMT with State Equation took 3280 ms to find 0 implicit places.
[2023-03-16 19:12:41] [INFO ] Invariant cache hit.
[2023-03-16 19:12:41] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3742 ms. Remains : 1296/1296 places, 292/292 transitions.
Built C files in :
/tmp/ltsmin18077760391616749084
[2023-03-16 19:12:41] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18077760391616749084
Running compilation step : cd /tmp/ltsmin18077760391616749084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 908 ms.
Running link step : cd /tmp/ltsmin18077760391616749084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18077760391616749084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8761113106991256328.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 19:12:56] [INFO ] Flatten gal took : 35 ms
[2023-03-16 19:12:56] [INFO ] Flatten gal took : 26 ms
[2023-03-16 19:12:56] [INFO ] Time to serialize gal into /tmp/LTL10456072557440877789.gal : 7 ms
[2023-03-16 19:12:56] [INFO ] Time to serialize properties into /tmp/LTL2960959382019015526.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10456072557440877789.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16992014513180100812.hoa' '-atoms' '/tmp/LTL2960959382019015526.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2960959382019015526.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16992014513180100812.hoa
Detected timeout of ITS tools.
[2023-03-16 19:13:11] [INFO ] Flatten gal took : 26 ms
[2023-03-16 19:13:11] [INFO ] Flatten gal took : 26 ms
[2023-03-16 19:13:11] [INFO ] Time to serialize gal into /tmp/LTL9986732834004914995.gal : 5 ms
[2023-03-16 19:13:11] [INFO ] Time to serialize properties into /tmp/LTL17534710558879984294.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9986732834004914995.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17534710558879984294.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(F("((malicious_reservoir<1)||(s2_4<1))")))&&(("(a3<1)")U((G("(a3<1)"))||(("(a3<1)")&&(G(!("((s2_8>=1)&&(n3_8>=1))"))))))))
Formula 0 simplified : FG!"((malicious_reservoir<1)||(s2_4<1))" | (F"((s2_8>=1)&&(n3_8>=1))" U !"(a3<1)")
Detected timeout of ITS tools.
[2023-03-16 19:13:26] [INFO ] Flatten gal took : 27 ms
[2023-03-16 19:13:26] [INFO ] Applying decomposition
[2023-03-16 19:13:26] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11459824325727978663.txt' '-o' '/tmp/graph11459824325727978663.bin' '-w' '/tmp/graph11459824325727978663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11459824325727978663.bin' '-l' '-1' '-v' '-w' '/tmp/graph11459824325727978663.weights' '-q' '0' '-e' '0.001'
[2023-03-16 19:13:27] [INFO ] Decomposing Gal with order
[2023-03-16 19:13:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 19:13:27] [INFO ] Removed a total of 209 redundant transitions.
[2023-03-16 19:13:27] [INFO ] Flatten gal took : 69 ms
[2023-03-16 19:13:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 18 ms.
[2023-03-16 19:13:27] [INFO ] Time to serialize gal into /tmp/LTL13371207421413725894.gal : 8 ms
[2023-03-16 19:13:27] [INFO ] Time to serialize properties into /tmp/LTL17676595872140561554.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13371207421413725894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17676595872140561554.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G(F("((u0.malicious_reservoir<1)||(i20.u34.s2_4<1))")))&&(("(i28.u42.a3<1)")U((G("(i28.u42.a3<1)"))||(("(i28.u42.a3<1)")&&(G(!("((...200
Formula 0 simplified : FG!"((u0.malicious_reservoir<1)||(i20.u34.s2_4<1))" | (F"((i24.u38.s2_8>=1)&&(i24.u73.n3_8>=1))" U !"(i28.u42.a3<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12071298780147140326
[2023-03-16 19:13:42] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12071298780147140326
Running compilation step : cd /tmp/ltsmin12071298780147140326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 882 ms.
Running link step : cd /tmp/ltsmin12071298780147140326;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12071298780147140326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true)))&&(!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&[](!(LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-13 finished in 120278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&G((F(p1)&&F(G(p0))))))'
Support contains 21 out of 1339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Graph (complete) has 8709 edges and 1339 vertex of which 971 are kept as prefixes of interest. Removing 368 places using SCC suffix rule.3 ms
Discarding 368 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 970 transition count 282
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 940 transition count 222
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 940 transition count 222
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 1 with 2 rules applied. Total rules applied 69 place count 939 transition count 221
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 939 transition count 221
Applied a total of 70 rules in 95 ms. Remains 939 /1339 variables (removed 400) and now considering 221/296 (removed 75) transitions.
// Phase 1: matrix 221 rows 939 cols
[2023-03-16 19:13:57] [INFO ] Computed 721 place invariants in 6 ms
[2023-03-16 19:13:58] [INFO ] Implicit Places using invariants in 733 ms returned []
[2023-03-16 19:13:58] [INFO ] Invariant cache hit.
[2023-03-16 19:13:59] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned [517, 759, 760, 761, 762, 763, 764, 767, 768, 769, 770, 771, 772, 773, 774, 899, 900, 901, 902, 905]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 2190 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 919/1339 places, 221/296 transitions.
Applied a total of 0 rules in 26 ms. Remains 919 /919 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2311 ms. Remains : 919/1339 places, 221/296 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, p0, (NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s88 1), p1:(AND (GEQ s296 1) (GEQ s297 1) (GEQ s298 1) (GEQ s299 1) (GEQ s300 1) (GEQ s301 1) (GEQ s302 1) (GEQ s303 1) (GEQ s304 1) (GEQ s305 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-14 finished in 2516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-18-LTLFireability-08
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1339/1339 places, 296/296 transitions.
Graph (complete) has 8709 edges and 1339 vertex of which 958 are kept as prefixes of interest. Removing 381 places using SCC suffix rule.8 ms
Discarding 381 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 920 transition count 219
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 920 transition count 219
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 77 place count 919 transition count 218
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 919 transition count 218
Applied a total of 78 rules in 100 ms. Remains 919 /1339 variables (removed 420) and now considering 218/296 (removed 78) transitions.
// Phase 1: matrix 218 rows 919 cols
[2023-03-16 19:14:00] [INFO ] Computed 703 place invariants in 11 ms
[2023-03-16 19:14:00] [INFO ] Implicit Places using invariants in 782 ms returned []
[2023-03-16 19:14:00] [INFO ] Invariant cache hit.
[2023-03-16 19:14:02] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned [516, 517, 758, 759, 760, 761, 762, 763, 766, 767, 768, 769, 770, 771, 772, 773, 879, 880, 881, 882, 885]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 2202 ms to find 21 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 898/1339 places, 218/296 transitions.
Applied a total of 0 rules in 25 ms. Remains 898 /898 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2328 ms. Remains : 898/1339 places, 218/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s68 1) (LT s839 1)), p0:(OR (LT s68 1) (LT s839 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4210 reset in 264 ms.
Product exploration explored 100000 steps with 4206 reset in 259 ms.
Computed a total of 898 stabilizing places and 218 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 898 transition count 218
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 340 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 125 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 419 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 923834 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 923834 steps, saw 133740 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 218 rows 898 cols
[2023-03-16 19:14:06] [INFO ] Computed 684 place invariants in 5 ms
[2023-03-16 19:14:07] [INFO ] [Real]Absence check using 0 positive and 684 generalized place invariants in 115 ms returned sat
[2023-03-16 19:14:07] [INFO ] After 266ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3
[2023-03-16 19:14:07] [INFO ] After 382ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-16 19:14:07] [INFO ] After 751ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 22 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 3 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (F (G p1)), (F (G p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 9 factoid took 448 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 898/898 places, 218/218 transitions.
Applied a total of 0 rules in 22 ms. Remains 898 /898 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-16 19:14:08] [INFO ] Invariant cache hit.
[2023-03-16 19:14:08] [INFO ] Implicit Places using invariants in 687 ms returned []
[2023-03-16 19:14:08] [INFO ] Invariant cache hit.
[2023-03-16 19:14:10] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 2112 ms to find 0 implicit places.
[2023-03-16 19:14:10] [INFO ] Invariant cache hit.
[2023-03-16 19:14:10] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2408 ms. Remains : 898/898 places, 218/218 transitions.
Computed a total of 898 stabilizing places and 218 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 898 transition count 218
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 421 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1430521 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :{}
Probabilistic random walk after 1430521 steps, saw 206357 distinct states, run finished after 3001 ms. (steps per millisecond=476 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 19:14:14] [INFO ] Invariant cache hit.
[2023-03-16 19:14:14] [INFO ] [Real]Absence check using 0 positive and 684 generalized place invariants in 107 ms returned sat
[2023-03-16 19:14:14] [INFO ] After 218ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-16 19:14:14] [INFO ] After 303ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-16 19:14:14] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 22 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 564 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4209 reset in 248 ms.
Product exploration explored 100000 steps with 4208 reset in 261 ms.
Built C files in :
/tmp/ltsmin14921861913973729974
[2023-03-16 19:14:16] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14921861913973729974
Running compilation step : cd /tmp/ltsmin14921861913973729974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 596 ms.
Running link step : cd /tmp/ltsmin14921861913973729974;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14921861913973729974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10994261242811265450.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 898/898 places, 218/218 transitions.
Applied a total of 0 rules in 25 ms. Remains 898 /898 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-16 19:14:31] [INFO ] Invariant cache hit.
[2023-03-16 19:14:32] [INFO ] Implicit Places using invariants in 710 ms returned []
[2023-03-16 19:14:32] [INFO ] Invariant cache hit.
[2023-03-16 19:14:33] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
[2023-03-16 19:14:33] [INFO ] Invariant cache hit.
[2023-03-16 19:14:33] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2177 ms. Remains : 898/898 places, 218/218 transitions.
Built C files in :
/tmp/ltsmin16803392799898725408
[2023-03-16 19:14:33] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16803392799898725408
Running compilation step : cd /tmp/ltsmin16803392799898725408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 637 ms.
Running link step : cd /tmp/ltsmin16803392799898725408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16803392799898725408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14284554804526144374.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 19:14:48] [INFO ] Flatten gal took : 22 ms
[2023-03-16 19:14:48] [INFO ] Flatten gal took : 19 ms
[2023-03-16 19:14:48] [INFO ] Time to serialize gal into /tmp/LTL9869803248801578461.gal : 5 ms
[2023-03-16 19:14:48] [INFO ] Time to serialize properties into /tmp/LTL13347006992803697702.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9869803248801578461.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17489461828315207329.hoa' '-atoms' '/tmp/LTL13347006992803697702.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13347006992803697702.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17489461828315207329.hoa
Detected timeout of ITS tools.
[2023-03-16 19:15:04] [INFO ] Flatten gal took : 18 ms
[2023-03-16 19:15:04] [INFO ] Flatten gal took : 17 ms
[2023-03-16 19:15:04] [INFO ] Time to serialize gal into /tmp/LTL1142555030469314459.gal : 3 ms
[2023-03-16 19:15:04] [INFO ] Time to serialize properties into /tmp/LTL3934676167981148063.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1142555030469314459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3934676167981148063.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("((s2_3<1)||(n3_3<1))")||(X("((s2_3<1)||(n3_3<1))"))))))
Formula 0 simplified : XF(!"((s2_3<1)||(n3_3<1))" & X!"((s2_3<1)||(n3_3<1))")
Detected timeout of ITS tools.
[2023-03-16 19:15:19] [INFO ] Flatten gal took : 17 ms
[2023-03-16 19:15:19] [INFO ] Applying decomposition
[2023-03-16 19:15:19] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4264002413809610850.txt' '-o' '/tmp/graph4264002413809610850.bin' '-w' '/tmp/graph4264002413809610850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4264002413809610850.bin' '-l' '-1' '-v' '-w' '/tmp/graph4264002413809610850.weights' '-q' '0' '-e' '0.001'
[2023-03-16 19:15:19] [INFO ] Decomposing Gal with order
[2023-03-16 19:15:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 19:15:19] [INFO ] Removed a total of 172 redundant transitions.
[2023-03-16 19:15:19] [INFO ] Flatten gal took : 41 ms
[2023-03-16 19:15:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 8 ms.
[2023-03-16 19:15:19] [INFO ] Time to serialize gal into /tmp/LTL9358918727584528344.gal : 5 ms
[2023-03-16 19:15:19] [INFO ] Time to serialize properties into /tmp/LTL4495945673497432004.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9358918727584528344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4495945673497432004.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i11.u42.s2_3<1)||(i11.u32.n3_3<1))")||(X("((i11.u42.s2_3<1)||(i11.u32.n3_3<1))"))))))
Formula 0 simplified : XF(!"((i11.u42.s2_3<1)||(i11.u32.n3_3<1))" & X!"((i11.u42.s2_3<1)||(i11.u32.n3_3<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4899636520806801133
[2023-03-16 19:15:34] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4899636520806801133
Running compilation step : cd /tmp/ltsmin4899636520806801133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 669 ms.
Running link step : cd /tmp/ltsmin4899636520806801133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4899636520806801133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-08 finished in 109626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&(!p1 U (G(!p1)||(!p1&&G(!p2))))))'
[2023-03-16 19:15:49] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16773416854865903602
[2023-03-16 19:15:49] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2023-03-16 19:15:49] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:15:49] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2023-03-16 19:15:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:15:49] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2023-03-16 19:15:49] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 19:15:49] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16773416854865903602
Running compilation step : cd /tmp/ltsmin16773416854865903602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 19:15:50] [INFO ] Applying decomposition
[2023-03-16 19:15:50] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10744981206279954107.txt' '-o' '/tmp/graph10744981206279954107.bin' '-w' '/tmp/graph10744981206279954107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10744981206279954107.bin' '-l' '-1' '-v' '-w' '/tmp/graph10744981206279954107.weights' '-q' '0' '-e' '0.001'
[2023-03-16 19:15:50] [INFO ] Decomposing Gal with order
[2023-03-16 19:15:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 19:15:50] [INFO ] Removed a total of 189 redundant transitions.
[2023-03-16 19:15:50] [INFO ] Flatten gal took : 63 ms
[2023-03-16 19:15:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 19 ms.
[2023-03-16 19:15:50] [INFO ] Time to serialize gal into /tmp/LTLFireability2302212398031423327.gal : 11 ms
[2023-03-16 19:15:50] [INFO ] Time to serialize properties into /tmp/LTLFireability10279610889276958707.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2302212398031423327.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10279610889276958707.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(G(("((i35.i1.u39.s2_3<1)||(i35.i1.u85.n3_3<1))")||(X("((i35.i1.u39.s2_3<1)||(i35.i1.u85.n3_3<1))"))))))
Formula 0 simplified : XF(!"((i35.i1.u39.s2_3<1)||(i35.i1.u85.n3_3<1))" & X!"((i35.i1.u39.s2_3<1)||(i35.i1.u85.n3_3<1))")
Compilation finished in 1096 ms.
Running link step : cd /tmp/ltsmin16773416854865903602;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16773416854865903602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.018: LTL layer: formula: X([]((X((LTLAPp1==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 1/ 8), 0.018: "X([]((X((LTLAPp1==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.018: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.069: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.229: DFS-FIFO for weak LTL, using special progress label 302
pins2lts-mc-linux64( 0/ 8), 0.229: There are 303 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.229: State length is 1340, there are 303 groups
pins2lts-mc-linux64( 0/ 8), 0.229: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.229: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.229: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.229: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.444: ~1 levels ~960 states ~17992 transitions
pins2lts-mc-linux64( 4/ 8), 0.522: ~1 levels ~1920 states ~39320 transitions
pins2lts-mc-linux64( 0/ 8), 0.756: ~1 levels ~3840 states ~63160 transitions
pins2lts-mc-linux64( 0/ 8), 1.091: ~1 levels ~7680 states ~142552 transitions
pins2lts-mc-linux64( 4/ 8), 1.757: ~1 levels ~15360 states ~389120 transitions
pins2lts-mc-linux64( 5/ 8), 3.033: ~1 levels ~30720 states ~786680 transitions
pins2lts-mc-linux64( 0/ 8), 4.774: ~1 levels ~61440 states ~1542824 transitions
pins2lts-mc-linux64( 0/ 8), 7.292: ~1 levels ~122880 states ~2653520 transitions
pins2lts-mc-linux64( 0/ 8), 13.210: ~1 levels ~245760 states ~5882160 transitions
pins2lts-mc-linux64( 0/ 8), 25.128: ~1 levels ~491520 states ~12615592 transitions
pins2lts-mc-linux64( 0/ 8), 48.998: ~1 levels ~983040 states ~25662152 transitions
pins2lts-mc-linux64( 0/ 8), 101.483: ~1 levels ~1966080 states ~51249824 transitions
pins2lts-mc-linux64( 2/ 8), 104.570: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 104.948:
pins2lts-mc-linux64( 0/ 8), 104.949: mean standard work distribution: 6.6% (states) 7.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 104.949:
pins2lts-mc-linux64( 0/ 8), 104.949: Explored 1764452 states 52517580 transitions, fanout: 29.764
pins2lts-mc-linux64( 0/ 8), 104.949: Total exploration time 104.710 sec (104.370 sec minimum, 104.550 sec on average)
pins2lts-mc-linux64( 0/ 8), 104.949: States per second: 16851, Transitions per second: 501553
pins2lts-mc-linux64( 0/ 8), 104.949:
pins2lts-mc-linux64( 0/ 8), 104.949: Progress states detected: 11830995
pins2lts-mc-linux64( 0/ 8), 104.949: Redundant explorations: -85.0863
pins2lts-mc-linux64( 0/ 8), 104.949:
pins2lts-mc-linux64( 0/ 8), 104.949: Queue width: 8B, total height: 12704652, memory: 96.93MB
pins2lts-mc-linux64( 0/ 8), 104.949: Tree memory: 346.3MB, 30.7 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 104.949: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 104.949: Stored 299 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 104.949: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 104.949: Est. total memory use: 443.2MB (~1120.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16773416854865903602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16773416854865903602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 19:39:22] [INFO ] Flatten gal took : 997 ms
[2023-03-16 19:39:22] [INFO ] Time to serialize gal into /tmp/LTLFireability7591608093748617641.gal : 44 ms
[2023-03-16 19:39:22] [INFO ] Time to serialize properties into /tmp/LTLFireability11987696895217146892.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7591608093748617641.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11987696895217146892.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((X(G(("((s2_3<1)||(n3_3<1))")||(X("((s2_3<1)||(n3_3<1))"))))))
Formula 0 simplified : XF(!"((s2_3<1)||(n3_3<1))" & X!"((s2_3<1)||(n3_3<1))")
Detected timeout of ITS tools.
[2023-03-16 20:02:26] [INFO ] Flatten gal took : 418 ms
[2023-03-16 20:02:28] [INFO ] Input system was already deterministic with 296 transitions.
[2023-03-16 20:02:28] [INFO ] Transformed 1339 places.
[2023-03-16 20:02:28] [INFO ] Transformed 296 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 20:02:28] [INFO ] Time to serialize gal into /tmp/LTLFireability8466286937365604164.gal : 6 ms
[2023-03-16 20:02:28] [INFO ] Time to serialize properties into /tmp/LTLFireability12358257611466389410.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8466286937365604164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12358257611466389410.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(("((s2_3<1)||(n3_3<1))")||(X("((s2_3<1)||(n3_3<1))"))))))
Formula 0 simplified : XF(!"((s2_3<1)||(n3_3<1))" & X!"((s2_3<1)||(n3_3<1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10844148 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16006216 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-18, 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 r293-tall-167873946000884"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-18.tgz
mv QuasiCertifProtocol-PT-18 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 ;