About the Execution of ITS-Tools for ClientsAndServers-PT-N0020P4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16203.151 | 3600000.00 | 4336779.00 | 25348.20 | ?FFFFFTFTFTFFFFF | 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-167814396200299.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-N0020P4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-167814396200299
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 13:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:23 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.6K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 13:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Feb 26 13:24 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-N0020P4-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678378383530
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-N0020P4
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 16:13:07] [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-09 16:13:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 16:13:07] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-09 16:13:07] [INFO ] Transformed 25 places.
[2023-03-09 16:13:07] [INFO ] Transformed 18 transitions.
[2023-03-09 16:13:07] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-10 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.
Applied a total of 0 rules in 20 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-09 16:13:07] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-09 16:13:07] [INFO ] Implicit Places using invariants in 203 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 262 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 285 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 20 out of 24 places after structural reductions.
[2023-03-09 16:13:08] [INFO ] Flatten gal took : 34 ms
[2023-03-09 16:13:08] [INFO ] Flatten gal took : 11 ms
[2023-03-09 16:13:08] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10022 steps, including 3 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 29) seen :27
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 24 cols
[2023-03-09 16:13:08] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-09 16:13:08] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 16:13:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-09 16:13:08] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-09 16:13:08] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 16:13:08] [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 14 ms.
[2023-03-09 16:13:08] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1697 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=67 )
Parikh walk visited 1 properties in 27 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(G(((X(p0) U p1)||G((((p2 U p0)&&G(p3))||p1)))))'
Support contains 6 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 4 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-09 16:13:09] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 16:13:09] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-09 16:13:09] [INFO ] Invariant cache hit.
[2023-03-09 16:13:09] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-09 16:13:09] [INFO ] Invariant cache hit.
[2023-03-09 16:13:09] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 593 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3)), acceptance={} source=3 dest: 5}, { cond=(OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3)), acceptance={} source=6 dest: 5}, { cond=(OR p1 (AND p0 p3) (AND p2 p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 2 s0), p0:(LEQ 1 s19), p2:(LEQ s17 s4), p3:(LEQ s5 s12)], 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 669 ms.
Product exploration explored 100000 steps with 2 reset in 536 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 (NOT p0) p2 p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p0) p2))), true, (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 (AND p0 p3) (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3))))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1103 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Incomplete random walk after 10028 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=334 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 16:13:13] [INFO ] Invariant cache hit.
[2023-03-09 16:13:13] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 16:13:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 16:13:13] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 16:13:13] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2 p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p0) p2))), true, (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 (AND p0 p3) (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (G (NOT (AND (NOT p2) (NOT p0)))), (G (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (NOT (AND p2 (NOT p0)))), (F (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3)))), (F (OR (AND (NOT p1) p2 p3) (AND (NOT p1) p0 p3))), (F (AND (NOT p1) p2 (NOT p0) p3)), (F (NOT (OR (AND p1 (NOT p0) p3) (AND p2 (NOT p0) p3)))), (F (NOT (OR p1 (AND p2 p3) (AND p0 p3)))), (F (NOT p3))]
Knowledge based reduction with 18 factoid took 1776 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Support contains 4 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-09 16:13:15] [INFO ] Invariant cache hit.
[2023-03-09 16:13:15] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-09 16:13:15] [INFO ] Invariant cache hit.
[2023-03-09 16:13:15] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-09 16:13:15] [INFO ] Invariant cache hit.
[2023-03-09 16:13:15] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 22/22 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 p3 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X p3)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 503 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 16:13:16] [INFO ] Invariant cache hit.
[2023-03-09 16:13:16] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 16:13:16] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 16:13:16] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 16:13:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-09 16:13:16] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-09 16:13:16] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 16:13:16] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 16:13:16] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 876 steps, including 0 resets, run visited all 2 properties in 46 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 46 ms.
Knowledge obtained : [(AND p1 p3 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X p3)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (NOT p3)), (F (AND (NOT p3) (NOT p1))), (F (AND p3 (NOT p1))), (F (AND p3 (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 843 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 292 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 300 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Product exploration explored 100000 steps with 1 reset in 324 ms.
Product exploration explored 100000 steps with 3 reset in 526 ms.
Applying partial POR strategy [false, true, true, false, true, true]
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 6 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
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 21 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 18 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 18 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 18 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 16 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 16 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 22 rules in 14 ms. Remains 16 /22 variables (removed 6) and now considering 13/18 (removed 5) transitions.
[2023-03-09 16:13:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-09 16:13:19] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 16:13:19] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/22 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 16/22 places, 13/18 transitions.
Built C files in :
/tmp/ltsmin4189767217497966165
[2023-03-09 16:13:20] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4189767217497966165
Running compilation step : cd /tmp/ltsmin4189767217497966165;'/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 375 ms.
Running link step : cd /tmp/ltsmin4189767217497966165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin4189767217497966165;'/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/stateBased1307574450835793077.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 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 21 transition count 18
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 16:13:35] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-09 16:13:35] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-09 16:13:35] [INFO ] Invariant cache hit.
[2023-03-09 16:13:35] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-09 16:13:35] [INFO ] Invariant cache hit.
[2023-03-09 16:13:35] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 21/22 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin8531104690720530223
[2023-03-09 16:13:35] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8531104690720530223
Running compilation step : cd /tmp/ltsmin8531104690720530223;'/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 100 ms.
Running link step : cd /tmp/ltsmin8531104690720530223;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin8531104690720530223;'/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/stateBased16934993003055073889.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 16:13:50] [INFO ] Flatten gal took : 10 ms
[2023-03-09 16:13:50] [INFO ] Flatten gal took : 5 ms
[2023-03-09 16:13:50] [INFO ] Time to serialize gal into /tmp/LTL1285388883368403497.gal : 3 ms
[2023-03-09 16:13:50] [INFO ] Time to serialize properties into /tmp/LTL3977389975783823961.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1285388883368403497.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18285008441185245724.hoa' '-atoms' '/tmp/LTL3977389975783823961.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/LTL3977389975783823961.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18285008441185245724.hoa
Detected timeout of ITS tools.
[2023-03-09 16:14:05] [INFO ] Flatten gal took : 3 ms
[2023-03-09 16:14:05] [INFO ] Flatten gal took : 2 ms
[2023-03-09 16:14:05] [INFO ] Time to serialize gal into /tmp/LTL4877640592118963537.gal : 1 ms
[2023-03-09 16:14:05] [INFO ] Time to serialize properties into /tmp/LTL4944089152640262721.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/LTL4877640592118963537.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4944089152640262721.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 : !((G(((X("(CwA>=1)"))U("(Uf>=2)"))||(G(((("(SwA<=CA)")U("(CwA>=1)"))&&(G("(CF<=MpG)")))||("(Uf>=2)"))))))
Formula 0 simplified : F(!"(Uf>=2)" & F(!"(Uf>=2)" & ((!"(SwA<=CA)" R !"(CwA>=1)") | F!"(CF<=MpG)")) & X(!"(Uf>=2)" W !"(CwA>=1)"))
Detected timeout of ITS tools.
[2023-03-09 16:14:20] [INFO ] Flatten gal took : 7 ms
[2023-03-09 16:14:20] [INFO ] Applying decomposition
[2023-03-09 16:14:20] [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/graph17446478149767233875.txt' '-o' '/tmp/graph17446478149767233875.bin' '-w' '/tmp/graph17446478149767233875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17446478149767233875.bin' '-l' '-1' '-v' '-w' '/tmp/graph17446478149767233875.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:14:20] [INFO ] Decomposing Gal with order
[2023-03-09 16:14:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:14:20] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-09 16:14:20] [INFO ] Flatten gal took : 41 ms
[2023-03-09 16:14:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-09 16:14:20] [INFO ] Time to serialize gal into /tmp/LTL18416367830773369197.gal : 1 ms
[2023-03-09 16:14:20] [INFO ] Time to serialize properties into /tmp/LTL392588441037172740.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/LTL18416367830773369197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL392588441037172740.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 : !((G(((X("(gi2.gi0.gu8.CwA>=1)"))U("(gi2.gi1.gu1.Uf>=2)"))||(G(((("(gu3.SwA<=gu3.CA)")U("(gi2.gi0.gu8.CwA>=1)"))&&(G("(gu4.CF<=gu4.MpG...190
Formula 0 simplified : F(!"(gi2.gi1.gu1.Uf>=2)" & F(!"(gi2.gi1.gu1.Uf>=2)" & ((!"(gu3.SwA<=gu3.CA)" R !"(gi2.gi0.gu8.CwA>=1)") | F!"(gu4.CF<=gu4.MpG)")) & ...207
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15983711718348419452
[2023-03-09 16:14:35] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15983711718348419452
Running compilation step : cd /tmp/ltsmin15983711718348419452;'/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 105 ms.
Running link step : cd /tmp/ltsmin15983711718348419452;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15983711718348419452;'/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)) U (LTLAPp1==true))||[](((((LTLAPp2==true) U (LTLAPp0==true))&&[]((LTLAPp3==true)))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-00 finished in 101529 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||G(p1)))))'
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 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 21 transition count 8
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 24 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 25 place count 10 transition count 7
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 27 place count 9 transition count 6
Applied a total of 27 rules in 10 ms. Remains 9 /24 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-09 16:14:50] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 16:14:50] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 16:14:50] [INFO ] Invariant cache hit.
[2023-03-09 16:14:50] [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-09 16:14:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 16:14:50] [INFO ] Invariant cache hit.
[2023-03-09 16:14:51] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/24 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 9/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s7 s8), p0:(GT 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8 reset in 117 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-01 finished in 328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 11
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 19 place count 13 transition count 6
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 28 place count 8 transition count 6
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 32 place count 6 transition count 4
Applied a total of 32 rules in 5 ms. Remains 6 /24 variables (removed 18) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-09 16:14:51] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 16:14:51] [INFO ] Implicit Places using invariants in 23 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/24 places, 4/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32 ms. Remains : 5/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4 reset in 183 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 33 in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-02 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(G(p1))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 2 ms. Remains 20 /24 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 16:14:51] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 16:14:51] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-09 16:14:51] [INFO ] Invariant cache hit.
[2023-03-09 16:14:51] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-09 16:14:51] [INFO ] Invariant cache hit.
[2023-03-09 16:14:51] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 s3), p1:(LEQ s8 s16)], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 1 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-03 finished in 440 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&&F((G(!p0)||G(p1))))) U p2))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 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 9 rules applied. Total rules applied 9 place count 20 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 15 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 15 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 13 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 2 with 2 rules applied. Total rules applied 20 place count 12 transition count 10
Applied a total of 20 rules in 9 ms. Remains 12 /24 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-09 16:14:51] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 16:14:51] [INFO ] Implicit Places using invariants in 32 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 places, 10/18 transitions.
Applied a total of 0 rules in 4 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48 ms. Remains : 11/24 places, 10/18 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), true, (AND p0 (NOT p1)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 3 s5), p0:(LEQ s10 s6), p1:(GT 3 s3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 41967 steps with 1 reset in 135 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-04 finished in 354 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((X(p0)&&(X(p1) U ((p2&&X(p1))||X(G(p1)))))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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-09 16:14:52] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 16:14:52] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 16:14:52] [INFO ] Invariant cache hit.
[2023-03-09 16:14:52] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-09 16:14:52] [INFO ] Invariant cache hit.
[2023-03-09 16:14:52] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 2 s17), p1:(AND (GT 2 s17) (LEQ 1 s1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-05 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (F((F(p1)&&X(p2)))||X(p1))))'
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 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 2 ms. Remains 20 /24 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 16:14:52] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 16:14:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-09 16:14:52] [INFO ] Invariant cache hit.
[2023-03-09 16:14:52] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-09 16:14:52] [INFO ] Invariant cache hit.
[2023-03-09 16:14:52] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s0 s19), p0:(GT 3 s3), p2:(LEQ 2 s16)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 275 ms.
Product exploration explored 100000 steps with 50000 reset in 298 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 (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))
Knowledge based reduction with 10 factoid took 214 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-06 finished in 1212 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(((X(p0) U ((p1&&X(p0))||X(G(p0)))) U (G(p3)||p2))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 2 ms. Remains 20 /24 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2023-03-09 16:14:53] [INFO ] Invariant cache hit.
[2023-03-09 16:14:53] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-09 16:14:53] [INFO ] Invariant cache hit.
[2023-03-09 16:14:53] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-09 16:14:53] [INFO ] Invariant cache hit.
[2023-03-09 16:14:53] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 394 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 6}, { cond=p3, acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(OR (LEQ 3 s8) (LEQ s4 s17)), p3:(LEQ s1 s3), p1:(GT 3 s8), p0:(GT s3 s18)], 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]]
Entered a terminal (fully accepting) state of product in 2176 steps with 6 reset in 11 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-07 finished in 569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X((p0 U (p1||G(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 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 2 ms. Remains 20 /24 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2023-03-09 16:14:54] [INFO ] Invariant cache hit.
[2023-03-09 16:14:54] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-09 16:14:54] [INFO ] Invariant cache hit.
[2023-03-09 16:14:54] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-09 16:14:54] [INFO ] Invariant cache hit.
[2023-03-09 16:14:54] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s5 s17), p1:(AND (LEQ s2 s9) (GT s5 s17))], 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 2600 reset in 173 ms.
Product exploration explored 100000 steps with 2581 reset in 176 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)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 340 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 654 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=163 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 459 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2023-03-09 16:14:56] [INFO ] Invariant cache hit.
[2023-03-09 16:14:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 16:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 16:14:56] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-09 16:14:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 16:14:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 16:14:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 16:14:56] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-09 16:14:56] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 16:14:56] [INFO ] Added : 15 causal constraints over 3 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 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.
[2023-03-09 16:14:56] [INFO ] Invariant cache hit.
[2023-03-09 16:14:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-09 16:14:56] [INFO ] Invariant cache hit.
[2023-03-09 16:14:56] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-09 16:14:56] [INFO ] Invariant cache hit.
[2023-03-09 16:14:56] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 20/20 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)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 446 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 531 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=106 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 461 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2023-03-09 16:14:57] [INFO ] Invariant cache hit.
[2023-03-09 16:14:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 16:14:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 16:14:57] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-09 16:14:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 16:14:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 16:14:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 16:14:58] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-09 16:14:58] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 16:14:58] [INFO ] Added : 15 causal constraints over 3 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2578 reset in 163 ms.
Product exploration explored 100000 steps with 2602 reset in 186 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 4 place count 20 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 20 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 17 transition count 15
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 17 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 17 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 14 rules in 12 ms. Remains 17 /20 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2023-03-09 16:14:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 17 cols
[2023-03-09 16:14:58] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 16:14:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/20 places, 15/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 17/20 places, 15/18 transitions.
Built C files in :
/tmp/ltsmin16925162000391272946
[2023-03-09 16:14:58] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16925162000391272946
Running compilation step : cd /tmp/ltsmin16925162000391272946;'/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 172 ms.
Running link step : cd /tmp/ltsmin16925162000391272946;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16925162000391272946;'/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/stateBased12152761125272281256.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 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.
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 16:15:14] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 16:15:14] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-09 16:15:14] [INFO ] Invariant cache hit.
[2023-03-09 16:15:14] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-09 16:15:14] [INFO ] Invariant cache hit.
[2023-03-09 16:15:14] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 20/20 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin14804744889531440951
[2023-03-09 16:15:14] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14804744889531440951
Running compilation step : cd /tmp/ltsmin14804744889531440951;'/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 98 ms.
Running link step : cd /tmp/ltsmin14804744889531440951;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin14804744889531440951;'/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/stateBased13398335431103586105.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 16:15:29] [INFO ] Flatten gal took : 3 ms
[2023-03-09 16:15:29] [INFO ] Flatten gal took : 2 ms
[2023-03-09 16:15:29] [INFO ] Time to serialize gal into /tmp/LTL4519499923622923285.gal : 1 ms
[2023-03-09 16:15:29] [INFO ] Time to serialize properties into /tmp/LTL9065985226366361441.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/LTL4519499923622923285.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12467933293632086182.hoa' '-atoms' '/tmp/LTL9065985226366361441.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/LTL9065985226366361441.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12467933293632086182.hoa
Detected timeout of ITS tools.
[2023-03-09 16:15:44] [INFO ] Flatten gal took : 2 ms
[2023-03-09 16:15:44] [INFO ] Flatten gal took : 2 ms
[2023-03-09 16:15:44] [INFO ] Time to serialize gal into /tmp/LTL1364341416564171769.gal : 1 ms
[2023-03-09 16:15:44] [INFO ] Time to serialize properties into /tmp/LTL13261363394176032503.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/LTL1364341416564171769.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13261363394176032503.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 : !((F((G(F("(CF>SpA)")))||((F("(CF>SpA)"))&&(X(("(CF>SpA)")U(("((SF<=MpA)&&(CF>SpA))")||(G("(CF>SpA)")))))))))
Formula 0 simplified : G(FG!"(CF>SpA)" & (G!"(CF>SpA)" | X(!"(CF>SpA)" M !"((SF<=MpA)&&(CF>SpA))")))
Detected timeout of ITS tools.
[2023-03-09 16:15:59] [INFO ] Flatten gal took : 6 ms
[2023-03-09 16:15:59] [INFO ] Applying decomposition
[2023-03-09 16:15:59] [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/graph10526362239727760670.txt' '-o' '/tmp/graph10526362239727760670.bin' '-w' '/tmp/graph10526362239727760670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10526362239727760670.bin' '-l' '-1' '-v' '-w' '/tmp/graph10526362239727760670.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:15:59] [INFO ] Decomposing Gal with order
[2023-03-09 16:15:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:15:59] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-09 16:15:59] [INFO ] Flatten gal took : 4 ms
[2023-03-09 16:15:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-09 16:15:59] [INFO ] Time to serialize gal into /tmp/LTL6068522714718720940.gal : 1 ms
[2023-03-09 16:15:59] [INFO ] Time to serialize properties into /tmp/LTL12901533993822916984.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/LTL6068522714718720940.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12901533993822916984.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 : !((F((G(F("(gu4.CF>gu4.SpA)")))||((F("(gu4.CF>gu4.SpA)"))&&(X(("(gu4.CF>gu4.SpA)")U(("((gu0.SF<=gu0.MpA)&&(gu4.CF>gu4.SpA))")||(G("(gu...178
Formula 0 simplified : G(FG!"(gu4.CF>gu4.SpA)" & (G!"(gu4.CF>gu4.SpA)" | X(!"(gu4.CF>gu4.SpA)" M !"((gu0.SF<=gu0.MpA)&&(gu4.CF>gu4.SpA))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15329126477980128900
[2023-03-09 16:16:14] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15329126477980128900
Running compilation step : cd /tmp/ltsmin15329126477980128900;'/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 163 ms.
Running link step : cd /tmp/ltsmin15329126477980128900;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin15329126477980128900;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-08 finished in 95181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(!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 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-09 16:16:29] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 16:16:29] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-09 16:16:29] [INFO ] Invariant cache hit.
[2023-03-09 16:16:29] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-09 16:16:29] [INFO ] Invariant cache hit.
[2023-03-09 16:16:29] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT s19 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1797 steps with 0 reset in 3 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-13 finished in 273 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 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 2 ms. Remains 20 /24 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 16:16:29] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-09 16:16:29] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 16:16:29] [INFO ] Invariant cache hit.
[2023-03-09 16:16:29] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-09 16:16:29] [INFO ] Invariant cache hit.
[2023-03-09 16:16:29] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s4)], 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 1082 reset in 188 ms.
Product exploration explored 100000 steps with 1105 reset in 211 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 1105 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1105 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2023-03-09 16:16:30] [INFO ] Invariant cache hit.
[2023-03-09 16:16:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 16:16:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 16:16:30] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-09 16:16:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 16:16:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 16:16:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 16:16:30] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-09 16:16:30] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 16:16:30] [INFO ] Added : 15 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 20 transition count 8
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 10 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 20 place count 10 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 7 transition count 5
Applied a total of 26 rules in 5 ms. Remains 7 /20 variables (removed 13) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-09 16:16:30] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 16:16:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 16:16:31] [INFO ] Invariant cache hit.
[2023-03-09 16:16:31] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-09 16:16:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 16:16:31] [INFO ] Invariant cache hit.
[2023-03-09 16:16:31] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/20 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 7/20 places, 5/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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 206 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=206 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2023-03-09 16:16:31] [INFO ] Invariant cache hit.
[2023-03-09 16:16:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 16:16:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 16:16:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-09 16:16:31] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 16:16:31] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10262 reset in 128 ms.
Product exploration explored 100000 steps with 10174 reset in 147 ms.
Built C files in :
/tmp/ltsmin7142625897949793799
[2023-03-09 16:16:32] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2023-03-09 16:16:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 16:16:32] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2023-03-09 16:16:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 16:16:32] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2023-03-09 16:16:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 16:16:32] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7142625897949793799
Running compilation step : cd /tmp/ltsmin7142625897949793799;'/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 138 ms.
Running link step : cd /tmp/ltsmin7142625897949793799;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7142625897949793799;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4226066098959127392.hoa' '--buchi-type=spotba'
LTSmin run took 448 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-14 finished in 2869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(p0)&&(p0 U (p1||G(p0)))))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 1 ms. Remains 20 /24 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 16:16:32] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 16:16:32] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-09 16:16:32] [INFO ] Invariant cache hit.
[2023-03-09 16:16:32] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-09 16:16:32] [INFO ] Invariant cache hit.
[2023-03-09 16:16:32] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(OR p1 p0), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (LEQ 3 s9) (GT s11 s4)), p0:(GT s11 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1875 reset in 266 ms.
Product exploration explored 100000 steps with 1920 reset in 286 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 p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10015 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1112 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 16:16:34] [INFO ] Invariant cache hit.
[2023-03-09 16:16:34] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (OR p0 p1))]
Knowledge based reduction with 3 factoid took 274 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-09 16:16:35] [INFO ] Invariant cache hit.
[2023-03-09 16:16:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 16:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 16:16:35] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-09 16:16:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 16:16:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 16:16:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 16:16:35] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-09 16:16:35] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 16:16:35] [INFO ] Added : 4 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 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.
[2023-03-09 16:16:35] [INFO ] Invariant cache hit.
[2023-03-09 16:16:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-09 16:16:35] [INFO ] Invariant cache hit.
[2023-03-09 16:16:35] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-09 16:16:35] [INFO ] Invariant cache hit.
[2023-03-09 16:16:35] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 20/20 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)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 326 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=163 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-09 16:16:36] [INFO ] Invariant cache hit.
[2023-03-09 16:16:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 16:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 16:16:36] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-09 16:16:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 16:16:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 16:16:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 16:16:36] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-09 16:16:36] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 16:16:36] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1923 reset in 123 ms.
Product exploration explored 100000 steps with 1974 reset in 179 ms.
Built C files in :
/tmp/ltsmin8001930637999817266
[2023-03-09 16:16:37] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8001930637999817266
Running compilation step : cd /tmp/ltsmin8001930637999817266;'/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 145 ms.
Running link step : cd /tmp/ltsmin8001930637999817266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8001930637999817266;'/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/stateBased11638953910013356332.hoa' '--buchi-type=spotba'
LTSmin run took 240 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-15 finished in 4948 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(((X(p0) U p1)||G((((p2 U p0)&&G(p3))||p1)))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0020P4-LTLCardinality-00
Stuttering acceptance computed with spot in 362 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 10 place count 18 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 18 place count 14 transition count 10
Applied a total of 18 rules in 3 ms. Remains 14 /24 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-09 16:16:38] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 16:16:38] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 16:16:38] [INFO ] Invariant cache hit.
[2023-03-09 16:16:38] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-09 16:16:38] [INFO ] Invariant cache hit.
[2023-03-09 16:16:38] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/24 places, 10/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 109 ms. Remains : 14/24 places, 10/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3)), acceptance={} source=3 dest: 5}, { cond=(OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=6 dest: 4}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3)), acceptance={} source=6 dest: 5}, { cond=(OR p1 (AND p0 p3) (AND p2 p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 2 s0), p0:(LEQ 1 s12), p2:(LEQ s10 s2), p3:(LEQ s3 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 4 reset in 154 ms.
Product exploration explored 100000 steps with 2 reset in 197 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 (NOT p0) p2 p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p0) p2))), true, (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 (AND p0 p3) (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3))))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1281 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Incomplete random walk after 10026 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=345 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 16:16:40] [INFO ] Invariant cache hit.
[2023-03-09 16:16:40] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 16:16:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 16:16:40] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 16:16:40] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2 p3), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p0) p2))), true, (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p0 p3) (AND (NOT p1) p2 p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 (AND p0 p3) (AND p2 p3)))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (G (NOT (AND (NOT p2) (NOT p0)))), (G (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (NOT (AND p2 (NOT p0)))), (F (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3)))), (F (OR (AND (NOT p1) p2 p3) (AND (NOT p1) p0 p3))), (F (AND (NOT p1) p2 (NOT p0) p3)), (F (NOT (OR (AND p1 (NOT p0) p3) (AND p2 (NOT p0) p3)))), (F (NOT (OR p1 (AND p2 p3) (AND p0 p3)))), (F (NOT p3))]
Knowledge based reduction with 18 factoid took 1412 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Support contains 4 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-09 16:16:42] [INFO ] Invariant cache hit.
[2023-03-09 16:16:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 16:16:42] [INFO ] Invariant cache hit.
[2023-03-09 16:16:42] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-09 16:16:42] [INFO ] Invariant cache hit.
[2023-03-09 16:16:42] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 14/14 places, 10/10 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 p3 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X p3)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 466 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10018 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=477 ) properties (out of 6) seen :4
Finished Best-First random walk after 1413 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=157 )
Knowledge obtained : [(AND p1 p3 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X p3)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (NOT p3)), (F (AND (NOT p3) (NOT p1))), (F (AND p3 (NOT p1))), (F (AND p3 (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 737 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 275 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Product exploration explored 100000 steps with 2 reset in 149 ms.
Product exploration explored 100000 steps with 1 reset in 251 ms.
Applying partial POR strategy [false, true, true, false, true, true]
Stuttering acceptance computed with spot in 274 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3)), true, (NOT p3)]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 13 transition count 10
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 12 transition count 9
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 6 rules in 5 ms. Remains 12 /14 variables (removed 2) and now considering 9/10 (removed 1) transitions.
[2023-03-09 16:16:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2023-03-09 16:16:45] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 16:16:45] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/14 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51 ms. Remains : 12/14 places, 9/10 transitions.
Built C files in :
/tmp/ltsmin13668557592750649778
[2023-03-09 16:16:45] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13668557592750649778
Running compilation step : cd /tmp/ltsmin13668557592750649778;'/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 127 ms.
Running link step : cd /tmp/ltsmin13668557592750649778;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13668557592750649778;'/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/stateBased17516992205497936514.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 10
Applied a total of 1 rules in 2 ms. Remains 13 /14 variables (removed 1) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-09 16:17:00] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 16:17:00] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 16:17:00] [INFO ] Invariant cache hit.
[2023-03-09 16:17:00] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-09 16:17:00] [INFO ] Invariant cache hit.
[2023-03-09 16:17:00] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 13/14 places, 10/10 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 13/14 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin33069819607953514
[2023-03-09 16:17:01] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin33069819607953514
Running compilation step : cd /tmp/ltsmin33069819607953514;'/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 139 ms.
Running link step : cd /tmp/ltsmin33069819607953514;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin33069819607953514;'/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/stateBased1144229398641759689.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 16:17:16] [INFO ] Flatten gal took : 1 ms
[2023-03-09 16:17:16] [INFO ] Flatten gal took : 1 ms
[2023-03-09 16:17:16] [INFO ] Time to serialize gal into /tmp/LTL15097460385374242469.gal : 1 ms
[2023-03-09 16:17:16] [INFO ] Time to serialize properties into /tmp/LTL14530950495010394005.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15097460385374242469.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12809775095349366012.hoa' '-atoms' '/tmp/LTL14530950495010394005.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...320
Loading property file /tmp/LTL14530950495010394005.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12809775095349366012.hoa
Detected timeout of ITS tools.
[2023-03-09 16:17:31] [INFO ] Flatten gal took : 1 ms
[2023-03-09 16:17:31] [INFO ] Flatten gal took : 1 ms
[2023-03-09 16:17:31] [INFO ] Time to serialize gal into /tmp/LTL5299547449986163925.gal : 0 ms
[2023-03-09 16:17:31] [INFO ] Time to serialize properties into /tmp/LTL18194336881089206725.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/LTL5299547449986163925.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18194336881089206725.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(((X("(CwA>=1)"))U("(Uf>=2)"))||(G(((("(SwA<=CA)")U("(CwA>=1)"))&&(G("(CF<=MpG)")))||("(Uf>=2)"))))))
Formula 0 simplified : F(!"(Uf>=2)" & F(!"(Uf>=2)" & ((!"(SwA<=CA)" R !"(CwA>=1)") | F!"(CF<=MpG)")) & X(!"(Uf>=2)" W !"(CwA>=1)"))
Detected timeout of ITS tools.
[2023-03-09 16:17:46] [INFO ] Flatten gal took : 2 ms
[2023-03-09 16:17:46] [INFO ] Applying decomposition
[2023-03-09 16:17:46] [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/graph5323095717005652810.txt' '-o' '/tmp/graph5323095717005652810.bin' '-w' '/tmp/graph5323095717005652810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5323095717005652810.bin' '-l' '-1' '-v' '-w' '/tmp/graph5323095717005652810.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:17:46] [INFO ] Decomposing Gal with order
[2023-03-09 16:17:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:17:46] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-09 16:17:46] [INFO ] Flatten gal took : 3 ms
[2023-03-09 16:17:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-09 16:17:46] [INFO ] Time to serialize gal into /tmp/LTL12866854465536922225.gal : 0 ms
[2023-03-09 16:17:46] [INFO ] Time to serialize properties into /tmp/LTL18442567916895991550.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/LTL12866854465536922225.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18442567916895991550.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 : !((G(((X("(gi0.gi1.gu5.CwA>=1)"))U("(gi0.gi0.gu0.Uf>=2)"))||(G(((("(gu1.SwA<=gu1.CA)")U("(gi0.gi1.gu5.CwA>=1)"))&&(G("(gu2.CF<=gu2.MpG...190
Formula 0 simplified : F(!"(gi0.gi0.gu0.Uf>=2)" & F(!"(gi0.gi0.gu0.Uf>=2)" & ((!"(gu1.SwA<=gu1.CA)" R !"(gi0.gi1.gu5.CwA>=1)") | F!"(gu2.CF<=gu2.MpG)")) & ...207
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15022232927265492694
[2023-03-09 16:18:01] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15022232927265492694
Running compilation step : cd /tmp/ltsmin15022232927265492694;'/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 88 ms.
Running link step : cd /tmp/ltsmin15022232927265492694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin15022232927265492694;'/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)) U (LTLAPp1==true))||[](((((LTLAPp2==true) U (LTLAPp0==true))&&[]((LTLAPp3==true)))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-00 finished in 98769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X((p0 U (p1||G(p0))))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P4-LTLCardinality-08
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
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 4 places :
Implicit places reduction removed 4 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 9 rules applied. Total rules applied 9 place count 20 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 15 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 15 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 13 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 2 with 2 rules applied. Total rules applied 20 place count 12 transition count 10
Applied a total of 20 rules in 4 ms. Remains 12 /24 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-09 16:18:16] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 16:18:16] [INFO ] Implicit Places using invariants in 28 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 11/24 places, 10/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 34 ms. Remains : 11/24 places, 10/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s3 s10), p1:(AND (LEQ s2 s6) (GT s3 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 15120 reset in 73 ms.
Product exploration explored 100000 steps with 15153 reset in 88 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)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 371 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 165 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 457 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 10 rows 11 cols
[2023-03-09 16:18:18] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 16:18:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 16:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 16:18:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-09 16:18:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 16:18:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 16:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 16:18:18] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-09 16:18:18] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 16:18:18] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-09 16:18:18] [INFO ] Invariant cache hit.
[2023-03-09 16:18:18] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-09 16:18:18] [INFO ] Invariant cache hit.
[2023-03-09 16:18:18] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-09 16:18:18] [INFO ] Invariant cache hit.
[2023-03-09 16:18:18] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 11/11 places, 10/10 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)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 395 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 124 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 433 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2023-03-09 16:18:19] [INFO ] Invariant cache hit.
[2023-03-09 16:18:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 16:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 16:18:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-09 16:18:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 16:18:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 16:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 16:18:19] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-09 16:18:19] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 16:18:19] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14994 reset in 126 ms.
Product exploration explored 100000 steps with 15089 reset in 139 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-09 16:18:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 16:18:20] [INFO ] Invariant cache hit.
[2023-03-09 16:18:20] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35 ms. Remains : 11/11 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin1666044232299822776
[2023-03-09 16:18:20] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1666044232299822776
Running compilation step : cd /tmp/ltsmin1666044232299822776;'/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 138 ms.
Running link step : cd /tmp/ltsmin1666044232299822776;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1666044232299822776;'/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/stateBased5600782504510717548.hoa' '--buchi-type=spotba'
LTSmin run took 574 ms.
Treatment of property ClientsAndServers-PT-N0020P4-LTLCardinality-08 finished in 5006 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLCardinality-08 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2023-03-09 16:18:21] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10115351013652775495
[2023-03-09 16:18:21] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2023-03-09 16:18:21] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 16:18:21] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2023-03-09 16:18:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 16:18:21] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2023-03-09 16:18:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 16:18:21] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10115351013652775495
Running compilation step : cd /tmp/ltsmin10115351013652775495;'/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-09 16:18:21] [INFO ] Applying decomposition
[2023-03-09 16:18:21] [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/graph3264339011608591112.txt' '-o' '/tmp/graph3264339011608591112.bin' '-w' '/tmp/graph3264339011608591112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3264339011608591112.bin' '-l' '-1' '-v' '-w' '/tmp/graph3264339011608591112.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:18:21] [INFO ] Decomposing Gal with order
[2023-03-09 16:18:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:18:21] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-09 16:18:21] [INFO ] Flatten gal took : 7 ms
[2023-03-09 16:18:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-09 16:18:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality6568750869916643404.gal : 2 ms
[2023-03-09 16:18:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality11480585137306981287.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/LTLCardinality6568750869916643404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11480585137306981287.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 : !((G(((X("(gi2.gi2.gu8.CwA>=1)"))U("(gi2.gi1.gu4.Uf>=2)"))||(G(((("(gu1.SwA<=gu1.CA)")U("(gi2.gi2.gu8.CwA>=1)"))&&(G("(gu2.CF<=gu2.MpG...190
Formula 0 simplified : F(!"(gi2.gi1.gu4.Uf>=2)" & F(!"(gi2.gi1.gu4.Uf>=2)" & ((!"(gu1.SwA<=gu1.CA)" R !"(gi2.gi2.gu8.CwA>=1)") | F!"(gu2.CF<=gu2.MpG)")) & ...207
Compilation finished in 124 ms.
Running link step : cd /tmp/ltsmin10115351013652775495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10115351013652775495;'/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)) U (LTLAPp1==true))||[](((((LTLAPp2==true) U (LTLAPp0==true))&&[]((LTLAPp3==true)))||(LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: LTL layer: formula: [](((X((LTLAPp0==true)) U (LTLAPp1==true))||[](((((LTLAPp2==true) U (LTLAPp0==true))&&[]((LTLAPp3==true)))||(LTLAPp1==true)))))
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: "[](((X((LTLAPp0==true)) U (LTLAPp1==true))||[](((((LTLAPp2==true) U (LTLAPp0==true))&&[]((LTLAPp3==true)))||(LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: buchi has 7 states
pins2lts-mc-linux64( 0/ 8), 0.023: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.082: DFS-FIFO for weak LTL, using special progress label 25
pins2lts-mc-linux64( 0/ 8), 0.082: There are 26 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.082: State length is 25, there are 44 groups
pins2lts-mc-linux64( 0/ 8), 0.082: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.082: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.082: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.082: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.109: ~1 levels ~960 states ~2888 transitions
pins2lts-mc-linux64( 0/ 8), 0.137: ~1 levels ~1920 states ~6192 transitions
pins2lts-mc-linux64( 0/ 8), 0.189: ~1 levels ~3840 states ~13456 transitions
pins2lts-mc-linux64( 0/ 8), 0.252: ~1 levels ~7680 states ~28496 transitions
pins2lts-mc-linux64( 0/ 8), 0.413: ~1 levels ~15360 states ~61360 transitions
pins2lts-mc-linux64( 0/ 8), 0.670: ~1 levels ~30720 states ~133504 transitions
pins2lts-mc-linux64( 0/ 8), 1.128: ~1 levels ~61440 states ~285816 transitions
pins2lts-mc-linux64( 5/ 8), 1.839: ~1 levels ~122880 states ~651456 transitions
pins2lts-mc-linux64( 0/ 8), 2.875: ~1 levels ~245760 states ~1285440 transitions
pins2lts-mc-linux64( 0/ 8), 4.083: ~1 levels ~491520 states ~2690360 transitions
pins2lts-mc-linux64( 0/ 8), 5.500: ~1 levels ~983040 states ~5610096 transitions
pins2lts-mc-linux64( 0/ 8), 7.746: ~1 levels ~1966080 states ~11671960 transitions
pins2lts-mc-linux64( 0/ 8), 12.063: ~1 levels ~3932160 states ~23903136 transitions
pins2lts-mc-linux64( 0/ 8), 21.504: ~1 levels ~7864320 states ~49866416 transitions
pins2lts-mc-linux64( 0/ 8), 41.378: ~1 levels ~15728640 states ~102748296 transitions
pins2lts-mc-linux64( 0/ 8), 82.684: ~1 levels ~31457280 states ~210638008 transitions
pins2lts-mc-linux64( 6/ 8), 115.500: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 115.556:
pins2lts-mc-linux64( 0/ 8), 115.556: mean standard work distribution: 3.8% (states) 2.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 115.556:
pins2lts-mc-linux64( 0/ 8), 115.556: Explored 37410285 states 275853359 transitions, fanout: 7.374
pins2lts-mc-linux64( 0/ 8), 115.556: Total exploration time 115.450 sec (115.410 sec minimum, 115.429 sec on average)
pins2lts-mc-linux64( 0/ 8), 115.556: States per second: 324039, Transitions per second: 2389375
pins2lts-mc-linux64( 0/ 8), 115.556:
pins2lts-mc-linux64( 0/ 8), 115.556: Progress states detected: 43084709
pins2lts-mc-linux64( 0/ 8), 115.556: Redundant explorations: -13.1707
pins2lts-mc-linux64( 0/ 8), 115.556:
pins2lts-mc-linux64( 0/ 8), 115.556: Queue width: 8B, total height: 11651489, memory: 88.89MB
pins2lts-mc-linux64( 0/ 8), 115.556: Tree memory: 584.7MB, 14.2 B/state, compr.: 14.0%
pins2lts-mc-linux64( 0/ 8), 115.556: Tree fill ratio (roots/leafs): 32.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 115.556: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 115.556: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 115.556: Est. total memory use: 673.6MB (~1112.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10115351013652775495;'/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)) U (LTLAPp1==true))||[](((((LTLAPp2==true) U (LTLAPp0==true))&&[]((LTLAPp3==true)))||(LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10115351013652775495;'/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)) U (LTLAPp1==true))||[](((((LTLAPp2==true) U (LTLAPp0==true))&&[]((LTLAPp3==true)))||(LTLAPp1==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-09 16:40:08] [INFO ] Flatten gal took : 301 ms
[2023-03-09 16:40:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality14492410169297262557.gal : 84 ms
[2023-03-09 16:40:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality901057108201943639.ltl : 32 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/LTLCardinality14492410169297262557.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality901057108201943639.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 : !((G(((X("(CwA>=1)"))U("(Uf>=2)"))||(G(((("(SwA<=CA)")U("(CwA>=1)"))&&(G("(CF<=MpG)")))||("(Uf>=2)"))))))
Formula 0 simplified : F(!"(Uf>=2)" & F(!"(Uf>=2)" & ((!"(SwA<=CA)" R !"(CwA>=1)") | F!"(CF<=MpG)")) & X(!"(Uf>=2)" W !"(CwA>=1)"))
Detected timeout of ITS tools.
[2023-03-09 17:01:53] [INFO ] Flatten gal took : 14 ms
[2023-03-09 17:01:53] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-09 17:01:53] [INFO ] Transformed 24 places.
[2023-03-09 17:01:53] [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-09 17:01:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality12545903667552560992.gal : 7 ms
[2023-03-09 17:01:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality14316301855351232740.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/LTLCardinality12545903667552560992.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14316301855351232740.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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(((X("(CwA>=1)"))U("(Uf>=2)"))||(G(((("(SwA<=CA)")U("(CwA>=1)"))&&(G("(CF<=MpG)")))||("(Uf>=2)"))))))
Formula 0 simplified : F(!"(Uf>=2)" & F(!"(Uf>=2)" & ((!"(SwA<=CA)" R !"(CwA>=1)") | F!"(CF<=MpG)")) & X(!"(Uf>=2)" W !"(CwA>=1)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 11960772 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16026716 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-N0020P4"
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-N0020P4, 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-167814396200299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0020P4.tgz
mv ClientsAndServers-PT-N0020P4 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 ;