About the Execution of ITS-Tools for ClientsAndServers-PT-N2000P0
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16219.340 | 3600000.00 | 4502724.00 | 31393.70 | FFFFTFFFF?TTTFFF | 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.r069-smll-167814396300347.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 ClientsAndServers-PT-N2000P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-167814396300347
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 13:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 13:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Feb 26 13:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 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 ClientsAndServers-PT-N2000P0-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678422091962
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N2000P0
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-10 04:21:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 04:21:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 04:21:35] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-10 04:21:35] [INFO ] Transformed 25 places.
[2023-03-10 04:21:35] [INFO ] Transformed 18 transitions.
[2023-03-10 04:21:35] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 14 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-10 04:21:35] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-10 04:21:35] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-10 04:21:35] [INFO ] Invariant cache hit.
[2023-03-10 04:21:35] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-10 04:21:35] [INFO ] Invariant cache hit.
[2023-03-10 04:21:35] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 20 out of 24 places after structural reductions.
[2023-03-10 04:21:35] [INFO ] Flatten gal took : 35 ms
[2023-03-10 04:21:35] [INFO ] Flatten gal took : 9 ms
[2023-03-10 04:21:35] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=457 ) properties (out of 28) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 26) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-10 04:21:36] [INFO ] Invariant cache hit.
[2023-03-10 04:21:36] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 04:21:36] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-10 04:21:36] [INFO ] After 27ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2023-03-10 04:21:36] [INFO ] After 36ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:9
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-10 04:21:36] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:9
[2023-03-10 04:21:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 04:21:36] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-10 04:21:36] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-10 04:21:36] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2023-03-10 04:21:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-10 04:21:36] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-10 04:21:36] [INFO ] After 287ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 8 properties in 7660 ms.
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 23 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 18 transition count 11
Reduce places removed 2 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 15 transition count 11
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 3 with 2 rules applied. Total rules applied 18 place count 14 transition count 10
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 21 place count 14 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 24 place count 11 transition count 7
Applied a total of 24 rules in 21 ms. Remains 11 /24 variables (removed 13) and now considering 7/18 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 11/24 places, 7/18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=941 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2294160 steps, run timeout after 3001 ms. (steps per millisecond=764 ) properties seen :{}
Probabilistic random walk after 2294160 steps, saw 1254752 distinct states, run finished after 3003 ms. (steps per millisecond=763 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 11 cols
[2023-03-10 04:21:47] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 04:21:47] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 04:21:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 04:21:47] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 04:21:47] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2023-03-10 04:21:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-10 04:21:47] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-10 04:21:47] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 170 ms.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 11/11 places, 7/7 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 7/7 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-10 04:21:47] [INFO ] Invariant cache hit.
[2023-03-10 04:21:47] [INFO ] Implicit Places using invariants in 62 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 10/11 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 70 ms. Remains : 10/11 places, 7/7 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1777 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2565231 steps, run timeout after 3001 ms. (steps per millisecond=854 ) properties seen :{}
Probabilistic random walk after 2565231 steps, saw 1373750 distinct states, run finished after 3001 ms. (steps per millisecond=854 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 10 cols
[2023-03-10 04:21:50] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-10 04:21:50] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 04:21:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 04:21:50] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 04:21:50] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2023-03-10 04:21:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-10 04:21:51] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-10 04:21:51] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 158 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 10/10 places, 7/7 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-10 04:21:51] [INFO ] Invariant cache hit.
[2023-03-10 04:21:51] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-10 04:21:51] [INFO ] Invariant cache hit.
[2023-03-10 04:21:51] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-10 04:21:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 04:21:51] [INFO ] Invariant cache hit.
[2023-03-10 04:21:51] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 10/10 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 6
Applied a total of 3 rules in 1 ms. Remains 8 /10 variables (removed 2) and now considering 6/7 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 8 cols
[2023-03-10 04:21:51] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-10 04:21:51] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 04:21:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 04:21:51] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 04:21:51] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-10 04:21:51] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
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))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-10 04:21:51] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 04:21:51] [INFO ] Implicit Places using invariants in 36 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s17 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-00 finished in 414 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((p1 U X(p2))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-10 04:21:52] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-10 04:21:52] [INFO ] Implicit Places using invariants in 69 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s1), p1:(LEQ s0 s19), p2:(LEQ s5 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33238 reset in 410 ms.
Product exploration explored 100000 steps with 33362 reset in 239 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 714 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=2666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 04:21:54] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-10 04:21:54] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 04:21:54] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 04:21:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 04:21:54] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 04:21:54] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-10 04:21:54] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 75486 steps, including 0 resets, run visited all 2 properties in 923 ms. (steps per millisecond=81 )
Parikh walk visited 2 properties in 923 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F p0), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 13 factoid took 703 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-10 04:21:56] [INFO ] Invariant cache hit.
[2023-03-10 04:21:56] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 04:21:56] [INFO ] Invariant cache hit.
[2023-03-10 04:21:56] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-10 04:21:56] [INFO ] Invariant cache hit.
[2023-03-10 04:21:56] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 651 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 04:21:57] [INFO ] Invariant cache hit.
[2023-03-10 04:21:57] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-10 04:21:57] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 04:21:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 04:21:57] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 04:21:57] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-10 04:21:57] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 74487 steps, including 0 resets, run visited all 2 properties in 847 ms. (steps per millisecond=87 )
Parikh walk visited 2 properties in 847 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F p0), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 13 factoid took 931 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33399 reset in 193 ms.
Product exploration explored 100000 steps with 33405 reset in 226 ms.
Built C files in :
/tmp/ltsmin15968441579809563106
[2023-03-10 04:22:00] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15968441579809563106
Running compilation step : cd /tmp/ltsmin15968441579809563106;'/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 376 ms.
Running link step : cd /tmp/ltsmin15968441579809563106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin15968441579809563106;'/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/stateBased14658407042456811926.hoa' '--buchi-type=spotba'
LTSmin run took 483 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-02 finished in 9300 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)&&((p0 U p1) U (p0&&X(G(p2))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-10 04:22:01] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 04:22:01] [INFO ] Implicit Places using invariants in 57 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 436 ms :[(OR (NOT p0) (NOT p2)), true, (NOT p0), (OR (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={0} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 1}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 1 s14), p1:(LEQ s3 s16), p2:(LEQ 3 s15)], nbAcceptance=1, 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]]
Product exploration explored 100000 steps with 9663 reset in 260 ms.
Product exploration explored 100000 steps with 9563 reset in 273 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p2) (AND p1 p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1599 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[(NOT p2), true, (OR (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 18 rows 20 cols
[2023-03-10 04:22:05] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-10 04:22:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 04:22:05] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 04:22:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 04:22:05] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-10 04:22:05] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-10 04:22:05] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 15998 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=999 )
Parikh walk visited 6 properties in 752 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p2) (AND p1 p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p0)), (F (NOT p0)), (F (AND p1 (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p2) p0))), (F p2), (F (OR (AND p1 p2) (AND p2 p0))), (F (AND (NOT p1) p2 (NOT p0)))]
Knowledge based reduction with 23 factoid took 1848 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(NOT p2), true, (OR (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 338 ms :[(NOT p2), true, (OR (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
[2023-03-10 04:22:08] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p2) (AND p1 p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p0)), (F (NOT p0)), (F (AND p1 (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p2) p0))), (F p2), (F (OR (AND p1 p2) (AND p2 p0))), (F (AND (NOT p1) p2 (NOT p0))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 23 factoid took 900 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-03 finished in 7912 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(p0)||G(p1))&&F((!p0||G(F(!p0)))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 3 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-10 04:22:09] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 04:22:09] [INFO ] Implicit Places using invariants in 45 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s11 s6), p0:(LEQ s1 s16)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-05 finished in 252 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||(G(p1)&&X(p0))))&&X(p2)))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-10 04:22:09] [INFO ] Invariant cache hit.
[2023-03-10 04:22:09] [INFO ] Implicit Places using invariants in 38 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p0) (NOT p2)), true, (AND (NOT p0) p1), (AND p0 (NOT p1)), (NOT p0), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}, { cond=(OR p0 p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(OR p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=5 dest: 1}]], initial=0, aps=[p0:(LEQ s17 s6), p1:(LEQ 3 s15), p2:(LEQ s19 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, 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 65 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-06 finished in 394 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(((X(X((!p0&&G(F(p1)))))&&G(p1))||G((!p0&&F(p1)))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 15 transition count 11
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 3 with 4 rules applied. Total rules applied 20 place count 13 transition count 9
Applied a total of 20 rules in 6 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2023-03-10 04:22:10] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-10 04:22:10] [INFO ] Implicit Places using invariants in 30 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/24 places, 9/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 10 transition count 7
Applied a total of 4 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-10 04:22:10] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 04:22:10] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-10 04:22:10] [INFO ] Invariant cache hit.
[2023-03-10 04:22:10] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/24 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 10/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 555 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 6}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 7}, { cond=(AND p0 p1), acceptance={1} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={1} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={1} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={1} source=6 dest: 7}, { cond=(NOT p0), acceptance={} source=6 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=7 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=true, acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(GT 2 s8), p0:(OR (LEQ 3 s4) (LEQ 1 s2))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-07 finished in 803 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((p0||X(G(p1)))))||G(p2)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-10 04:22:10] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-10 04:22:11] [INFO ] Implicit Places using invariants in 47 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 317 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(OR (LEQ 1 s19) (LEQ s1 s20)), p2:(GT 3 s13), p0:(LEQ s1 s20)], 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 181 ms.
Product exploration explored 100000 steps with 0 reset in 275 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (AND p2 p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (AND p2 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 922 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=2666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 04:22:13] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-10 04:22:13] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 04:22:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 04:22:13] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-10 04:22:13] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2023-03-10 04:22:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-10 04:22:13] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-10 04:22:13] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 6816 ms.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 15 transition count 9
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 18 place count 12 transition count 9
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 11 transition count 8
Applied a total of 20 rules in 12 ms. Remains 11 /21 variables (removed 10) and now considering 8/18 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 11/21 places, 8/18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 536779 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 536779 steps, saw 306470 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 11 cols
[2023-03-10 04:22:23] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 04:22:23] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 04:22:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 04:22:23] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 04:22:23] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-10 04:22:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-10 04:22:23] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-10 04:22:23] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1821 ms.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 4 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 11/11 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-10 04:22:25] [INFO ] Invariant cache hit.
[2023-03-10 04:22:25] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 04:22:25] [INFO ] Invariant cache hit.
[2023-03-10 04:22:25] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-10 04:22:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 04:22:25] [INFO ] Invariant cache hit.
[2023-03-10 04:22:25] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-10 04:22:25] [INFO ] Invariant cache hit.
[2023-03-10 04:22:25] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 04:22:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 04:22:25] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 04:22:25] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-10 04:22:25] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (AND p2 p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (AND p2 p0))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 17 factoid took 1027 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 305 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 04:22:27] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 04:22:27] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 04:22:27] [INFO ] Invariant cache hit.
[2023-03-10 04:22:27] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-10 04:22:27] [INFO ] Invariant cache hit.
[2023-03-10 04:22:27] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 838 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=2285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-10 04:22:29] [INFO ] Invariant cache hit.
[2023-03-10 04:22:29] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 04:22:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 04:22:29] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 04:22:29] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2023-03-10 04:22:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-10 04:22:29] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-10 04:22:29] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 3 properties in 4183 ms.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 10
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 13 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 11 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 10 transition count 7
Applied a total of 22 rules in 3 ms. Remains 10 /21 variables (removed 11) and now considering 7/18 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 10/21 places, 7/18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3538080 steps, run timeout after 3001 ms. (steps per millisecond=1178 ) properties seen :{}
Probabilistic random walk after 3538080 steps, saw 1669657 distinct states, run finished after 3001 ms. (steps per millisecond=1178 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 10 cols
[2023-03-10 04:22:36] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 04:22:36] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 04:22:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 04:22:36] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 04:22:36] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2023-03-10 04:22:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-03-10 04:22:36] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 04:22:36] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 216 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 10/10 places, 7/7 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-10 04:22:36] [INFO ] Invariant cache hit.
[2023-03-10 04:22:37] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-10 04:22:37] [INFO ] Invariant cache hit.
[2023-03-10 04:22:37] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-10 04:22:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 04:22:37] [INFO ] Invariant cache hit.
[2023-03-10 04:22:37] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 10/10 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 6
Applied a total of 3 rules in 3 ms. Remains 8 /10 variables (removed 2) and now considering 6/7 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 8 cols
[2023-03-10 04:22:37] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-10 04:22:37] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 04:22:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 04:22:37] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 04:22:37] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-10 04:22:37] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 13 factoid took 1158 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 337 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 337 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 430 ms.
Product exploration explored 100000 steps with 0 reset in 449 ms.
Applying partial POR strategy [true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 228 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 19 transition count 16
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 19 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 19 transition count 16
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 17 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 17 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 17 rules in 9 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2023-03-10 04:22:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2023-03-10 04:22:40] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 04:22:40] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/21 places, 14/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51 ms. Remains : 17/21 places, 14/18 transitions.
Built C files in :
/tmp/ltsmin2536068571694616290
[2023-03-10 04:22:40] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2536068571694616290
Running compilation step : cd /tmp/ltsmin2536068571694616290;'/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 102 ms.
Running link step : cd /tmp/ltsmin2536068571694616290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin2536068571694616290;'/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/stateBased11821311466863707455.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 04:22:55] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 04:22:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 04:22:55] [INFO ] Invariant cache hit.
[2023-03-10 04:22:55] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-10 04:22:55] [INFO ] Invariant cache hit.
[2023-03-10 04:22:55] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin5904791068039753656
[2023-03-10 04:22:55] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5904791068039753656
Running compilation step : cd /tmp/ltsmin5904791068039753656;'/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 99 ms.
Running link step : cd /tmp/ltsmin5904791068039753656;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5904791068039753656;'/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/stateBased4252370115118025196.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 04:23:11] [INFO ] Flatten gal took : 4 ms
[2023-03-10 04:23:11] [INFO ] Flatten gal took : 4 ms
[2023-03-10 04:23:11] [INFO ] Time to serialize gal into /tmp/LTL18416591566084440062.gal : 2 ms
[2023-03-10 04:23:11] [INFO ] Time to serialize properties into /tmp/LTL10213063478756822401.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/LTL18416591566084440062.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3221345658282057295.hoa' '-atoms' '/tmp/LTL10213063478756822401.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/LTL10213063478756822401.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3221345658282057295.hoa
Detected timeout of ITS tools.
[2023-03-10 04:23:26] [INFO ] Flatten gal took : 5 ms
[2023-03-10 04:23:26] [INFO ] Flatten gal took : 4 ms
[2023-03-10 04:23:26] [INFO ] Time to serialize gal into /tmp/LTL18407820972609455762.gal : 2 ms
[2023-03-10 04:23:26] [INFO ] Time to serialize properties into /tmp/LTL14270418964728449971.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/LTL18407820972609455762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14270418964728449971.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...277
Read 1 LTL properties
Checking formula 0 : !(((X(G(("(SA<=Ci)")||(X(G("((CwG>=1)||(SA<=Ci))"))))))||(G("(MwU<3)"))))
Formula 0 simplified : XF(!"(SA<=Ci)" & XF!"((CwG>=1)||(SA<=Ci))") & F!"(MwU<3)"
Detected timeout of ITS tools.
[2023-03-10 04:23:41] [INFO ] Flatten gal took : 4 ms
[2023-03-10 04:23:41] [INFO ] Applying decomposition
[2023-03-10 04:23:41] [INFO ] Flatten gal took : 3 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/graph5806142666856732508.txt' '-o' '/tmp/graph5806142666856732508.bin' '-w' '/tmp/graph5806142666856732508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5806142666856732508.bin' '-l' '-1' '-v' '-w' '/tmp/graph5806142666856732508.weights' '-q' '0' '-e' '0.001'
[2023-03-10 04:23:41] [INFO ] Decomposing Gal with order
[2023-03-10 04:23:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 04:23:41] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-10 04:23:41] [INFO ] Flatten gal took : 40 ms
[2023-03-10 04:23:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-10 04:23:41] [INFO ] Time to serialize gal into /tmp/LTL17134912670106139182.gal : 2 ms
[2023-03-10 04:23:41] [INFO ] Time to serialize properties into /tmp/LTL14593056873450907297.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/LTL17134912670106139182.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14593056873450907297.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...277
Read 1 LTL properties
Checking formula 0 : !(((X(G(("(gu7.SA<=gu7.Ci)")||(X(G("((gi0.gi0.gu1.CwG>=1)||(gu7.SA<=gu7.Ci))"))))))||(G("(gi0.gi1.gu0.MwU<3)"))))
Formula 0 simplified : XF(!"(gu7.SA<=gu7.Ci)" & XF!"((gi0.gi0.gu1.CwG>=1)||(gu7.SA<=gu7.Ci))") & F!"(gi0.gi1.gu0.MwU<3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6691405857409276988
[2023-03-10 04:23:56] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6691405857409276988
Running compilation step : cd /tmp/ltsmin6691405857409276988;'/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 107 ms.
Running link step : cd /tmp/ltsmin6691405857409276988;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin6691405857409276988;'/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([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-09 finished in 120497 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 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 7 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-10 04:24:11] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 04:24:11] [INFO ] Implicit Places using invariants in 65 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-11 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 (GT 3 s13) (GT 1 s7))], 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]]
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-11 finished in 509 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)||G(!p1)) U X(X(p0))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-10 04:24:11] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-10 04:24:12] [INFO ] Implicit Places using invariants in 45 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 405 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), true, (NOT p0), p1]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 7}], [{ cond=p1, acceptance={} source=8 dest: 6}, { cond=(NOT p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (LEQ s19 s10) (LEQ s13 s1)), p0:(LEQ s19 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 288 ms.
Product exploration explored 100000 steps with 0 reset in 348 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to knowledge :(X (AND (NOT p1) (NOT p0)))
Knowledge based reduction with 8 factoid took 307 ms. Reduced automaton from 9 states, 18 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-13 finished in 1424 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 p1) U X(G(p2))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-10 04:24:13] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-10 04:24:13] [INFO ] Implicit Places using invariants in 43 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(GT 2 s20), p1:(GT 2 s16), p0:(LEQ 2 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-14 finished in 305 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)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 17 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 14 transition count 10
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 3 with 4 rules applied. Total rules applied 22 place count 12 transition count 8
Applied a total of 22 rules in 4 ms. Remains 12 /24 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-10 04:24:13] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 04:24:13] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-10 04:24:13] [INFO ] Invariant cache hit.
[2023-03-10 04:24:13] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-10 04:24:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 04:24:13] [INFO ] Invariant cache hit.
[2023-03-10 04:24:13] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/24 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 12/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s10 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 99 ms.
Stack based approach found an accepted trace after 146 steps with 0 reset with depth 147 and stack size 147 in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-15 finished in 342 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((p0||X(G(p1)))))||G(p2)))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N2000P0-LTLCardinality-09
Stuttering acceptance computed with spot in 316 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2)]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 19 transition count 11
Reduce places removed 3 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 16 place count 15 transition count 11
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 3 with 2 rules applied. Total rules applied 18 place count 14 transition count 10
Applied a total of 18 rules in 6 ms. Remains 14 /24 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-10 04:24:14] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 04:24:14] [INFO ] Implicit Places using invariants in 33 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/24 places, 10/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 9
Applied a total of 2 rules in 3 ms. Remains 12 /13 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-10 04:24:14] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 04:24:14] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-10 04:24:14] [INFO ] Invariant cache hit.
[2023-03-10 04:24:14] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 12/24 places, 9/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 121 ms. Remains : 12/24 places, 9/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(OR (LEQ 1 s10) (LEQ s1 s11)), p2:(GT 3 s8), p0:(LEQ s1 s11)], 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, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 218 ms.
Product exploration explored 100000 steps with 0 reset in 167 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (AND p2 p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (AND p2 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 936 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=2285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-10 04:24:16] [INFO ] Invariant cache hit.
[2023-03-10 04:24:17] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 04:24:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 04:24:17] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-10 04:24:17] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-10 04:24:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-10 04:24:17] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-10 04:24:17] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 5765 ms.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 9/9 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 8
Applied a total of 2 rules in 3 ms. Remains 11 /12 variables (removed 1) and now considering 8/9 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 11/12 places, 8/9 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 437743 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 437743 steps, saw 263295 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 11 cols
[2023-03-10 04:24:25] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 04:24:26] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 04:24:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 04:24:26] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 04:24:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-10 04:24:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-03-10 04:24:26] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-10 04:24:26] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1779 ms.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 11/11 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-10 04:24:27] [INFO ] Invariant cache hit.
[2023-03-10 04:24:27] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-10 04:24:27] [INFO ] Invariant cache hit.
[2023-03-10 04:24:27] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-10 04:24:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 04:24:27] [INFO ] Invariant cache hit.
[2023-03-10 04:24:27] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-10 04:24:27] [INFO ] Invariant cache hit.
[2023-03-10 04:24:27] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 04:24:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 04:24:28] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 04:24:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-10 04:24:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-03-10 04:24:28] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 04:24:28] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (AND p2 p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (AND p2 p0))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 17 factoid took 1110 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 311 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-10 04:24:29] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 04:24:29] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-10 04:24:29] [INFO ] Invariant cache hit.
[2023-03-10 04:24:29] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-10 04:24:29] [INFO ] Invariant cache hit.
[2023-03-10 04:24:29] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 12/12 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 719 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-10 04:24:31] [INFO ] Invariant cache hit.
[2023-03-10 04:24:31] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 04:24:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 04:24:31] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 04:24:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2023-03-10 04:24:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-10 04:24:31] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-10 04:24:31] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 3 properties in 4090 ms.
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 9/9 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 11 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 10 transition count 7
Applied a total of 4 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 7/9 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/12 places, 7/9 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3136934 steps, run timeout after 3001 ms. (steps per millisecond=1045 ) properties seen :{}
Probabilistic random walk after 3136934 steps, saw 1495322 distinct states, run finished after 3001 ms. (steps per millisecond=1045 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 10 cols
[2023-03-10 04:24:38] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 04:24:38] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 04:24:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 04:24:38] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 04:24:38] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2023-03-10 04:24:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-03-10 04:24:38] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-10 04:24:38] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 206 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 7/7 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-10 04:24:38] [INFO ] Invariant cache hit.
[2023-03-10 04:24:38] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-10 04:24:38] [INFO ] Invariant cache hit.
[2023-03-10 04:24:38] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-10 04:24:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 04:24:38] [INFO ] Invariant cache hit.
[2023-03-10 04:24:39] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 10/10 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 6
Applied a total of 3 rules in 2 ms. Remains 8 /10 variables (removed 2) and now considering 6/7 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 8 cols
[2023-03-10 04:24:39] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-10 04:24:39] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 04:24:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 04:24:39] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 04:24:39] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-10 04:24:39] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 13 factoid took 850 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 320 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 325 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 175 ms.
Product exploration explored 100000 steps with 0 reset in 220 ms.
Applying partial POR strategy [true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 323 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-10 04:24:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2023-03-10 04:24:41] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 04:24:41] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50 ms. Remains : 12/12 places, 9/9 transitions.
Built C files in :
/tmp/ltsmin14637105229121039830
[2023-03-10 04:24:41] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14637105229121039830
Running compilation step : cd /tmp/ltsmin14637105229121039830;'/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 137 ms.
Running link step : cd /tmp/ltsmin14637105229121039830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14637105229121039830;'/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/stateBased16009045799364979491.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-10 04:24:56] [INFO ] Invariant cache hit.
[2023-03-10 04:24:56] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 04:24:56] [INFO ] Invariant cache hit.
[2023-03-10 04:24:56] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-10 04:24:56] [INFO ] Invariant cache hit.
[2023-03-10 04:24:56] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 12/12 places, 9/9 transitions.
Built C files in :
/tmp/ltsmin14967321088551936275
[2023-03-10 04:24:57] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14967321088551936275
Running compilation step : cd /tmp/ltsmin14967321088551936275;'/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 90 ms.
Running link step : cd /tmp/ltsmin14967321088551936275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin14967321088551936275;'/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/stateBased1538580851081206468.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 04:25:12] [INFO ] Flatten gal took : 2 ms
[2023-03-10 04:25:12] [INFO ] Flatten gal took : 7 ms
[2023-03-10 04:25:12] [INFO ] Time to serialize gal into /tmp/LTL8855046057381302032.gal : 1 ms
[2023-03-10 04:25:12] [INFO ] Time to serialize properties into /tmp/LTL4078656802393321768.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/LTL8855046057381302032.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17042659733134393806.hoa' '-atoms' '/tmp/LTL4078656802393321768.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...318
Loading property file /tmp/LTL4078656802393321768.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17042659733134393806.hoa
Detected timeout of ITS tools.
[2023-03-10 04:25:27] [INFO ] Flatten gal took : 1 ms
[2023-03-10 04:25:27] [INFO ] Flatten gal took : 5 ms
[2023-03-10 04:25:27] [INFO ] Time to serialize gal into /tmp/LTL2399966704285870327.gal : 4 ms
[2023-03-10 04:25:27] [INFO ] Time to serialize properties into /tmp/LTL12530359555269336218.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/LTL2399966704285870327.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12530359555269336218.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(("(SA<=Ci)")||(X(G("((CwG>=1)||(SA<=Ci))"))))))||(G("(MwU<3)"))))
Formula 0 simplified : XF(!"(SA<=Ci)" & XF!"((CwG>=1)||(SA<=Ci))") & F!"(MwU<3)"
Detected timeout of ITS tools.
[2023-03-10 04:25:42] [INFO ] Flatten gal took : 2 ms
[2023-03-10 04:25:42] [INFO ] Applying decomposition
[2023-03-10 04:25:42] [INFO ] Flatten gal took : 2 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/graph16771335219932166445.txt' '-o' '/tmp/graph16771335219932166445.bin' '-w' '/tmp/graph16771335219932166445.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16771335219932166445.bin' '-l' '-1' '-v' '-w' '/tmp/graph16771335219932166445.weights' '-q' '0' '-e' '0.001'
[2023-03-10 04:25:42] [INFO ] Decomposing Gal with order
[2023-03-10 04:25:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 04:25:42] [INFO ] Flatten gal took : 2 ms
[2023-03-10 04:25:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-10 04:25:42] [INFO ] Time to serialize gal into /tmp/LTL9267812065552565375.gal : 1 ms
[2023-03-10 04:25:42] [INFO ] Time to serialize properties into /tmp/LTL1375729996843728306.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/LTL9267812065552565375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1375729996843728306.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(("(gu0.SA<=gu0.Ci)")||(X(G("((gi1.gu1.CwG>=1)||(gu0.SA<=gu0.Ci))"))))))||(G("(gi1.gu2.MwU<3)"))))
Formula 0 simplified : XF(!"(gu0.SA<=gu0.Ci)" & XF!"((gi1.gu1.CwG>=1)||(gu0.SA<=gu0.Ci))") & F!"(gi1.gu2.MwU<3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6121323894742592409
[2023-03-10 04:25:57] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6121323894742592409
Running compilation step : cd /tmp/ltsmin6121323894742592409;'/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 84 ms.
Running link step : cd /tmp/ltsmin6121323894742592409;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin6121323894742592409;'/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([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-09 finished in 118336 ms.
[2023-03-10 04:26:12] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12147710127601097781
[2023-03-10 04:26:12] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2023-03-10 04:26:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 04:26:12] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2023-03-10 04:26:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 04:26:12] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2023-03-10 04:26:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 04:26:12] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12147710127601097781
Running compilation step : cd /tmp/ltsmin12147710127601097781;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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-10 04:26:12] [INFO ] Applying decomposition
[2023-03-10 04:26:12] [INFO ] Flatten gal took : 2 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/graph6271895143493332903.txt' '-o' '/tmp/graph6271895143493332903.bin' '-w' '/tmp/graph6271895143493332903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6271895143493332903.bin' '-l' '-1' '-v' '-w' '/tmp/graph6271895143493332903.weights' '-q' '0' '-e' '0.001'
[2023-03-10 04:26:12] [INFO ] Decomposing Gal with order
[2023-03-10 04:26:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 04:26:12] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-10 04:26:12] [INFO ] Flatten gal took : 4 ms
[2023-03-10 04:26:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-10 04:26:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality1960361484583322500.gal : 2 ms
[2023-03-10 04:26:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality13008363379111216344.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/LTLCardinality1960361484583322500.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13008363379111216344.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 1 LTL properties
Checking formula 0 : !(((X(G(("(gu9.SA<=gu9.Ci)")||(X(G("((gi0.gi0.gu1.CwG>=1)||(gu9.SA<=gu9.Ci))"))))))||(G("(gi0.gi1.gu5.MwU<3)"))))
Formula 0 simplified : XF(!"(gu9.SA<=gu9.Ci)" & XF!"((gi0.gi0.gu1.CwG>=1)||(gu9.SA<=gu9.Ci))") & F!"(gi0.gi1.gu5.MwU<3)"
Compilation finished in 116 ms.
Running link step : cd /tmp/ltsmin12147710127601097781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin12147710127601097781;'/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([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: LTL layer: formula: (X([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))||[]((LTLAPp2==true)))
pins2lts-mc-linux64( 0/ 8), 0.001: "(X([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))||[]((LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: buchi has 7 states
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.043: DFS-FIFO for weak LTL, using special progress label 22
pins2lts-mc-linux64( 0/ 8), 0.043: There are 23 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.043: State length is 25, there are 35 groups
pins2lts-mc-linux64( 0/ 8), 0.043: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.043: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.043: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.043: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.051: ~1 levels ~960 states ~2888 transitions
pins2lts-mc-linux64( 4/ 8), 0.091: ~1 levels ~1920 states ~6208 transitions
pins2lts-mc-linux64( 4/ 8), 0.122: ~1 levels ~3840 states ~13408 transitions
pins2lts-mc-linux64( 4/ 8), 0.193: ~1 levels ~7680 states ~28320 transitions
pins2lts-mc-linux64( 4/ 8), 0.411: ~1 levels ~15360 states ~61376 transitions
pins2lts-mc-linux64( 4/ 8), 0.721: ~1 levels ~30720 states ~136048 transitions
pins2lts-mc-linux64( 2/ 8), 1.112: ~1 levels ~61440 states ~316272 transitions
pins2lts-mc-linux64( 2/ 8), 1.793: ~1 levels ~122880 states ~658240 transitions
pins2lts-mc-linux64( 2/ 8), 2.793: ~1 levels ~245760 states ~1382560 transitions
pins2lts-mc-linux64( 0/ 8), 3.960: ~1 levels ~491520 states ~2752984 transitions
pins2lts-mc-linux64( 0/ 8), 5.319: ~1 levels ~983040 states ~5690568 transitions
pins2lts-mc-linux64( 7/ 8), 7.462: ~1 levels ~1966080 states ~12168160 transitions
pins2lts-mc-linux64( 0/ 8), 11.799: ~1 levels ~3932160 states ~24308408 transitions
pins2lts-mc-linux64( 6/ 8), 20.793: ~1 levels ~7864320 states ~48444240 transitions
pins2lts-mc-linux64( 6/ 8), 38.412: ~1 levels ~15728640 states ~100052344 transitions
pins2lts-mc-linux64( 6/ 8), 75.690: ~1 levels ~31457280 states ~205497512 transitions
pins2lts-mc-linux64( 6/ 8), 158.146: ~1 levels ~62914560 states ~425759288 transitions
pins2lts-mc-linux64( 1/ 8), 201.081: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 201.124:
pins2lts-mc-linux64( 0/ 8), 201.124: mean standard work distribution: 3.8% (states) 3.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 201.124:
pins2lts-mc-linux64( 0/ 8), 201.124: Explored 68429853 states 505953441 transitions, fanout: 7.394
pins2lts-mc-linux64( 0/ 8), 201.124: Total exploration time 201.070 sec (201.010 sec minimum, 201.050 sec on average)
pins2lts-mc-linux64( 0/ 8), 201.124: States per second: 340328, Transitions per second: 2516305
pins2lts-mc-linux64( 0/ 8), 201.124:
pins2lts-mc-linux64( 0/ 8), 201.124: Progress states detected: 78399766
pins2lts-mc-linux64( 0/ 8), 201.124: Redundant explorations: -12.7169
pins2lts-mc-linux64( 0/ 8), 201.124:
pins2lts-mc-linux64( 0/ 8), 201.124: Queue width: 8B, total height: 19852303, memory: 151.46MB
pins2lts-mc-linux64( 0/ 8), 201.124: Tree memory: 854.1MB, 11.4 B/state, compr.: 11.2%
pins2lts-mc-linux64( 0/ 8), 201.124: Tree fill ratio (roots/leafs): 58.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 201.124: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 201.125: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 201.125: Est. total memory use: 1005.6MB (~1175.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12147710127601097781;'/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([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12147710127601097781;'/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([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))||[]((LTLAPp2==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-10 04:47:48] [INFO ] Flatten gal took : 485 ms
[2023-03-10 04:47:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality4298144454444238353.gal : 169 ms
[2023-03-10 04:47:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality3979063813088035942.ltl : 18 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/LTLCardinality4298144454444238353.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3979063813088035942.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...297
Read 1 LTL properties
Checking formula 0 : !(((X(G(("(SA<=Ci)")||(X(G("((CwG>=1)||(SA<=Ci))"))))))||(G("(MwU<3)"))))
Formula 0 simplified : XF(!"(SA<=Ci)" & XF!"((CwG>=1)||(SA<=Ci))") & F!"(MwU<3)"
Detected timeout of ITS tools.
[2023-03-10 05:09:22] [INFO ] Flatten gal took : 35 ms
[2023-03-10 05:09:22] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-10 05:09:22] [INFO ] Transformed 24 places.
[2023-03-10 05:09:22] [INFO ] Transformed 18 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-10 05:09:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality1171259824374347203.gal : 8 ms
[2023-03-10 05:09:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality6443050396933993726.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/LTLCardinality1171259824374347203.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6443050396933993726.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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(G(("(SA<=Ci)")||(X(G("((CwG>=1)||(SA<=Ci))"))))))||(G("(MwU<3)"))))
Formula 0 simplified : XF(!"(SA<=Ci)" & XF!"((CwG>=1)||(SA<=Ci))") & F!"(MwU<3)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6901160 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16068980 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N2000P0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N2000P0, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-smll-167814396300347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N2000P0.tgz
mv ClientsAndServers-PT-N2000P0 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;