About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S24C11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16184.424 | 3600000.00 | 3980152.00 | 39622.70 | FFFFTFTFF?T?F?F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r229-tall-167856413900875.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 MultiCrashLeafsetExtension-PT-S24C11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413900875
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 14K Feb 26 02:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 02:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 02:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 02:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 02:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 19M 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 MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679602393017
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=MultiCrashLeafsetExtension-PT-S24C11
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-23 20:13:14] [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-23 20:13:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 20:13:15] [INFO ] Load time of PNML (sax parser for PT used): 637 ms
[2023-03-23 20:13:15] [INFO ] Transformed 19254 places.
[2023-03-23 20:13:15] [INFO ] Transformed 27973 transitions.
[2023-03-23 20:13:15] [INFO ] Parsed PT model containing 19254 places and 27973 transitions and 103022 arcs in 1189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 19254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19254/19254 places, 27973/27973 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 19204 transition count 27973
Applied a total of 50 rules in 789 ms. Remains 19204 /19254 variables (removed 50) and now considering 27973/27973 (removed 0) transitions.
[2023-03-23 20:13:17] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2023-03-23 20:13:20] [INFO ] Computed 1249 place invariants in 2809 ms
[2023-03-23 20:13:22] [INFO ] Implicit Places using invariants in 4777 ms returned []
Implicit Place search using SMT only with invariants took 5572 ms to find 0 implicit places.
[2023-03-23 20:13:22] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:13:22] [INFO ] Invariant cache hit.
[2023-03-23 20:13:24] [INFO ] Dead Transitions using invariants and state equation in 1834 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19204/19254 places, 27973/27973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8207 ms. Remains : 19204/19254 places, 27973/27973 transitions.
Support contains 40 out of 19204 places after structural reductions.
[2023-03-23 20:13:25] [INFO ] Flatten gal took : 1108 ms
[2023-03-23 20:13:26] [INFO ] Flatten gal took : 829 ms
[2023-03-23 20:13:28] [INFO ] Input system was already deterministic with 27973 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 1090 ms. (steps per millisecond=9 ) properties (out of 27) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=12 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-23 20:13:30] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:13:30] [INFO ] Invariant cache hit.
[2023-03-23 20:13:37] [INFO ] [Real]Absence check using 47 positive place invariants in 234 ms returned sat
[2023-03-23 20:13:38] [INFO ] [Real]Absence check using 47 positive and 1202 generalized place invariants in 723 ms returned sat
[2023-03-23 20:13:55] [INFO ] After 16620ms SMT Verify possible using state equation in real domain returned unsat :0 sat :0 real:21
[2023-03-23 20:13:55] [INFO ] State equation strengthened by 8602 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 20:13:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:13:55] [INFO ] After 25173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 32 out of 19204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6582 transitions
Trivial Post-agglo rules discarded 6582 transitions
Performed 6582 trivial Post agglomeration. Transition count delta: 6582
Iterating post reduction 0 with 6582 rules applied. Total rules applied 6582 place count 19204 transition count 21391
Reduce places removed 6582 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 6589 rules applied. Total rules applied 13171 place count 12622 transition count 21384
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 13178 place count 12615 transition count 21384
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 549 Pre rules applied. Total rules applied 13178 place count 12615 transition count 20835
Deduced a syphon composed of 549 places in 20 ms
Reduce places removed 549 places and 0 transitions.
Iterating global reduction 3 with 1098 rules applied. Total rules applied 14276 place count 12066 transition count 20835
Discarding 6032 places :
Symmetric choice reduction at 3 with 6032 rule applications. Total rules 20308 place count 6034 transition count 14803
Iterating global reduction 3 with 6032 rules applied. Total rules applied 26340 place count 6034 transition count 14803
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 26340 place count 6034 transition count 14794
Deduced a syphon composed of 9 places in 14 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 26358 place count 6025 transition count 14794
Discarding 531 places :
Symmetric choice reduction at 3 with 531 rule applications. Total rules 26889 place count 5494 transition count 8953
Iterating global reduction 3 with 531 rules applied. Total rules applied 27420 place count 5494 transition count 8953
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 6 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 27468 place count 5470 transition count 8929
Free-agglomeration rule (complex) applied 350 times.
Iterating global reduction 3 with 350 rules applied. Total rules applied 27818 place count 5470 transition count 13779
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 3 with 350 rules applied. Total rules applied 28168 place count 5120 transition count 13779
Partial Free-agglomeration rule applied 325 times.
Drop transitions removed 325 transitions
Iterating global reduction 4 with 325 rules applied. Total rules applied 28493 place count 5120 transition count 13779
Applied a total of 28493 rules in 6358 ms. Remains 5120 /19204 variables (removed 14084) and now considering 13779/27973 (removed 14194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6359 ms. Remains : 5120/19204 places, 13779/27973 transitions.
Incomplete random walk after 10000 steps, including 146 resets, run finished after 810 ms. (steps per millisecond=12 ) properties (out of 22) seen :3
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-23 20:14:02] [INFO ] Flow matrix only has 12896 transitions (discarded 883 similar events)
// Phase 1: matrix 12896 rows 5120 cols
[2023-03-23 20:14:03] [INFO ] Computed 1249 place invariants in 367 ms
[2023-03-23 20:14:04] [INFO ] After 1571ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-23 20:14:06] [INFO ] [Nat]Absence check using 49 positive place invariants in 77 ms returned sat
[2023-03-23 20:14:06] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 352 ms returned sat
[2023-03-23 20:14:17] [INFO ] After 10320ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :7
[2023-03-23 20:14:17] [INFO ] State equation strengthened by 8492 read => feed constraints.
[2023-03-23 20:14:29] [INFO ] After 12034ms SMT Verify possible using 8492 Read/Feed constraints in natural domain returned unsat :11 sat :6
[2023-03-23 20:14:29] [INFO ] After 12040ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :6
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-23 20:14:29] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :6
Fused 18 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 12 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 13779/13779 transitions.
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 7 rules applied. Total rules applied 7 place count 5120 transition count 13772
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 5113 transition count 13772
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 5113 transition count 13771
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 5112 transition count 13771
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 5112 transition count 13871
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 36 place count 5102 transition count 13871
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 46 place count 5092 transition count 13861
Iterating global reduction 3 with 10 rules applied. Total rules applied 56 place count 5092 transition count 13861
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 5092 transition count 13861
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 5090 transition count 13859
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 5090 transition count 13859
Applied a total of 62 rules in 3317 ms. Remains 5090 /5120 variables (removed 30) and now considering 13859/13779 (removed -80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3318 ms. Remains : 5090/5120 places, 13859/13779 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 779 ms. (steps per millisecond=12 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 18172 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18172 steps, saw 8578 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-23 20:14:37] [INFO ] Flow matrix only has 12975 transitions (discarded 884 similar events)
// Phase 1: matrix 12975 rows 5090 cols
[2023-03-23 20:14:38] [INFO ] Computed 1249 place invariants in 365 ms
[2023-03-23 20:14:39] [INFO ] After 950ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 20:14:40] [INFO ] [Nat]Absence check using 49 positive place invariants in 90 ms returned sat
[2023-03-23 20:14:40] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 356 ms returned sat
[2023-03-23 20:14:53] [INFO ] After 12354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 20:14:53] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-23 20:15:04] [INFO ] After 10656ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 20:15:04] [INFO ] After 10657ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-23 20:15:04] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 12 out of 5090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5090/5090 places, 13859/13859 transitions.
Applied a total of 0 rules in 782 ms. Remains 5090 /5090 variables (removed 0) and now considering 13859/13859 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 782 ms. Remains : 5090/5090 places, 13859/13859 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5090/5090 places, 13859/13859 transitions.
Applied a total of 0 rules in 817 ms. Remains 5090 /5090 variables (removed 0) and now considering 13859/13859 (removed 0) transitions.
[2023-03-23 20:15:05] [INFO ] Flow matrix only has 12975 transitions (discarded 884 similar events)
[2023-03-23 20:15:05] [INFO ] Invariant cache hit.
[2023-03-23 20:15:10] [INFO ] Implicit Places using invariants in 4975 ms returned []
Implicit Place search using SMT only with invariants took 4977 ms to find 0 implicit places.
[2023-03-23 20:15:10] [INFO ] Flow matrix only has 12975 transitions (discarded 884 similar events)
[2023-03-23 20:15:10] [INFO ] Invariant cache hit.
[2023-03-23 20:15:19] [INFO ] Dead Transitions using invariants and state equation in 8562 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14360 ms. Remains : 5090/5090 places, 13859/13859 transitions.
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16580 stabilizing places and 22772 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 504 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2023-03-23 20:15:20] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2023-03-23 20:15:22] [INFO ] Computed 1249 place invariants in 2522 ms
[2023-03-23 20:15:24] [INFO ] Implicit Places using invariants in 4259 ms returned []
Implicit Place search using SMT only with invariants took 4269 ms to find 0 implicit places.
[2023-03-23 20:15:24] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:15:24] [INFO ] Invariant cache hit.
[2023-03-23 20:15:25] [INFO ] Dead Transitions using invariants and state equation in 1463 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6248 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-00 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 s18761)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 10 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-00 finished in 6565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(X(X(F(p1))))))))'
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 460 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2023-03-23 20:15:26] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:15:26] [INFO ] Invariant cache hit.
[2023-03-23 20:15:28] [INFO ] Implicit Places using invariants in 1526 ms returned []
Implicit Place search using SMT only with invariants took 1528 ms to find 0 implicit places.
[2023-03-23 20:15:28] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:15:28] [INFO ] Invariant cache hit.
[2023-03-23 20:15:29] [INFO ] Dead Transitions using invariants and state equation in 1752 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3743 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(GT s13440 s1208), p1:(GT s1043 s6365)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 6 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-01 finished in 4040 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((G(p0)||G(p1)||(p2&&X(p2))))))'
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 465 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2023-03-23 20:15:30] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:15:30] [INFO ] Invariant cache hit.
[2023-03-23 20:15:32] [INFO ] Implicit Places using invariants in 1492 ms returned []
Implicit Place search using SMT only with invariants took 1505 ms to find 0 implicit places.
[2023-03-23 20:15:32] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:15:32] [INFO ] Invariant cache hit.
[2023-03-23 20:15:33] [INFO ] Dead Transitions using invariants and state equation in 1615 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3590 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LEQ 1 s14569), p2:(LEQ s1774 s345), p1:(LEQ 1 s15585)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 7965 ms.
Product exploration explored 100000 steps with 33333 reset in 7824 ms.
Computed a total of 16580 stabilizing places and 22772 stable transitions
Computed a total of 16580 stabilizing places and 22772 stable transitions
Detected a total of 16580/19204 stabilizing places and 22772/27973 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p2 (NOT p1))
Knowledge based reduction with 19 factoid took 589 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-06 finished in 20299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6600 transitions
Trivial Post-agglo rules discarded 6600 transitions
Performed 6600 trivial Post agglomeration. Transition count delta: 6600
Iterating post reduction 0 with 6600 rules applied. Total rules applied 6600 place count 19204 transition count 21373
Reduce places removed 6600 places and 0 transitions.
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 550 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20823
Deduced a syphon composed of 550 places in 18 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 2 with 1100 rules applied. Total rules applied 14300 place count 12054 transition count 20823
Discarding 6050 places :
Symmetric choice reduction at 2 with 6050 rule applications. Total rules 20350 place count 6004 transition count 14773
Iterating global reduction 2 with 6050 rules applied. Total rules applied 26400 place count 6004 transition count 14773
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 26400 place count 6004 transition count 14751
Deduced a syphon composed of 22 places in 11 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 26444 place count 5982 transition count 14751
Discarding 550 places :
Symmetric choice reduction at 2 with 550 rule applications. Total rules 26994 place count 5432 transition count 8701
Iterating global reduction 2 with 550 rules applied. Total rules applied 27544 place count 5432 transition count 8701
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 27592 place count 5408 transition count 8677
Applied a total of 27592 rules in 3534 ms. Remains 5408 /19204 variables (removed 13796) and now considering 8677/27973 (removed 19296) transitions.
[2023-03-23 20:15:53] [INFO ] Flow matrix only has 8077 transitions (discarded 600 similar events)
// Phase 1: matrix 8077 rows 5408 cols
[2023-03-23 20:15:54] [INFO ] Computed 1249 place invariants in 246 ms
[2023-03-23 20:15:58] [INFO ] Implicit Places using invariants in 4691 ms returned []
[2023-03-23 20:15:58] [INFO ] Flow matrix only has 8077 transitions (discarded 600 similar events)
[2023-03-23 20:15:58] [INFO ] Invariant cache hit.
[2023-03-23 20:16:03] [INFO ] Implicit Places using invariants and state equation in 4499 ms returned []
Implicit Place search using SMT with State Equation took 9192 ms to find 0 implicit places.
[2023-03-23 20:16:04] [INFO ] Redundant transitions in 1026 ms returned []
[2023-03-23 20:16:04] [INFO ] Flow matrix only has 8077 transitions (discarded 600 similar events)
[2023-03-23 20:16:04] [INFO ] Invariant cache hit.
[2023-03-23 20:16:09] [INFO ] Dead Transitions using invariants and state equation in 5665 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5408/19204 places, 8677/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19425 ms. Remains : 5408/19204 places, 8677/27973 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s3209)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-07 finished in 19613 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 2 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6599 transitions
Trivial Post-agglo rules discarded 6599 transitions
Performed 6599 trivial Post agglomeration. Transition count delta: 6599
Iterating post reduction 0 with 6599 rules applied. Total rules applied 6599 place count 19204 transition count 21374
Reduce places removed 6599 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13199 place count 12605 transition count 21373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 550 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20823
Deduced a syphon composed of 550 places in 28 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 3 with 1100 rules applied. Total rules applied 14300 place count 12054 transition count 20823
Discarding 6049 places :
Symmetric choice reduction at 3 with 6049 rule applications. Total rules 20349 place count 6005 transition count 14774
Iterating global reduction 3 with 6049 rules applied. Total rules applied 26398 place count 6005 transition count 14774
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 26398 place count 6005 transition count 14753
Deduced a syphon composed of 21 places in 10 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 26440 place count 5984 transition count 14753
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 26989 place count 5435 transition count 8714
Iterating global reduction 3 with 549 rules applied. Total rules applied 27538 place count 5435 transition count 8714
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27588 place count 5410 transition count 8689
Applied a total of 27588 rules in 3133 ms. Remains 5410 /19204 variables (removed 13794) and now considering 8689/27973 (removed 19284) transitions.
[2023-03-23 20:16:13] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
// Phase 1: matrix 8089 rows 5410 cols
[2023-03-23 20:16:13] [INFO ] Computed 1249 place invariants in 272 ms
[2023-03-23 20:16:17] [INFO ] Implicit Places using invariants in 4784 ms returned []
[2023-03-23 20:16:18] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2023-03-23 20:16:18] [INFO ] Invariant cache hit.
[2023-03-23 20:16:22] [INFO ] Implicit Places using invariants and state equation in 4359 ms returned []
Implicit Place search using SMT with State Equation took 9157 ms to find 0 implicit places.
[2023-03-23 20:16:23] [INFO ] Redundant transitions in 1020 ms returned []
[2023-03-23 20:16:23] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2023-03-23 20:16:23] [INFO ] Invariant cache hit.
[2023-03-23 20:16:29] [INFO ] Dead Transitions using invariants and state equation in 5707 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5410/19204 places, 8689/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19029 ms. Remains : 5410/19204 places, 8689/27973 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-09 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 s1668 s4611)], 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 1247 reset in 1342 ms.
Product exploration explored 100000 steps with 1246 reset in 1333 ms.
Computed a total of 2811 stabilizing places and 3513 stable transitions
Computed a total of 2811 stabilizing places and 3513 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 423 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24652 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24652 steps, saw 11702 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 20:16:35] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2023-03-23 20:16:35] [INFO ] Invariant cache hit.
[2023-03-23 20:16:36] [INFO ] After 563ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:16:36] [INFO ] [Nat]Absence check using 49 positive place invariants in 83 ms returned sat
[2023-03-23 20:16:37] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 351 ms returned sat
[2023-03-23 20:16:43] [INFO ] After 6118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:16:43] [INFO ] State equation strengthened by 3112 read => feed constraints.
[2023-03-23 20:16:44] [INFO ] After 1056ms SMT Verify possible using 3112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 20:16:50] [INFO ] Deduced a trap composed of 591 places in 6081 ms of which 6 ms to minimize.
[2023-03-23 20:16:57] [INFO ] Deduced a trap composed of 355 places in 5978 ms of which 6 ms to minimize.
[2023-03-23 20:16:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 12921 ms
[2023-03-23 20:16:57] [INFO ] After 14211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 365 ms.
[2023-03-23 20:16:57] [INFO ] After 21755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 5410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5410/5410 places, 8689/8689 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5410 transition count 13842
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5073 transition count 13842
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 5073 transition count 13842
Applied a total of 699 rules in 2288 ms. Remains 5073 /5410 variables (removed 337) and now considering 13842/8689 (removed -5153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2288 ms. Remains : 5073/5410 places, 13842/8689 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 569 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 20672 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20672 steps, saw 9702 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 20:17:03] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
// Phase 1: matrix 12956 rows 5073 cols
[2023-03-23 20:17:04] [INFO ] Computed 1249 place invariants in 365 ms
[2023-03-23 20:17:04] [INFO ] After 550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:17:05] [INFO ] [Nat]Absence check using 49 positive place invariants in 80 ms returned sat
[2023-03-23 20:17:05] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 348 ms returned sat
[2023-03-23 20:17:12] [INFO ] After 6748ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:17:12] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-23 20:17:21] [INFO ] After 9066ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 20:17:29] [INFO ] Deduced a trap composed of 294 places in 7753 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 20:17:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:17:29] [INFO ] After 25132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 5073 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 877 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 877 ms. Remains : 5073/5073 places, 13842/13842 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 843 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
[2023-03-23 20:17:31] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2023-03-23 20:17:31] [INFO ] Invariant cache hit.
[2023-03-23 20:17:36] [INFO ] Implicit Places using invariants in 5176 ms returned []
Implicit Place search using SMT only with invariants took 5177 ms to find 0 implicit places.
[2023-03-23 20:17:36] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2023-03-23 20:17:36] [INFO ] Invariant cache hit.
[2023-03-23 20:17:44] [INFO ] Dead Transitions using invariants and state equation in 7881 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13909 ms. Remains : 5073/5073 places, 13842/13842 transitions.
Graph (trivial) has 3578 edges and 5073 vertex of which 25 / 5073 are part of one of the 1 SCC in 7 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 51800 edges and 5049 vertex of which 5027 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.8 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4641 transition count 12113
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4399 transition count 11632
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4158 transition count 11192
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3918 transition count 10794
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3718 transition count 10434
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3520 transition count 10112
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 6 with 449 rules applied. Total rules applied 3816 place count 3358 transition count 9825
Ensure Unique test removed 32 places
Reduce places removed 159 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 127 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 7 with 411 rules applied. Total rules applied 4227 place count 3199 transition count 9573
Ensure Unique test removed 2 places
Reduce places removed 127 places and 0 transitions.
Drop transitions removed 27 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 125 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 350 rules applied. Total rules applied 4577 place count 3072 transition count 9350
Ensure Unique test removed 27 places
Reduce places removed 125 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 319 rules applied. Total rules applied 4896 place count 2947 transition count 9156
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5162 place count 2849 transition count 8988
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5400 place count 2753 transition count 8846
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5592 place count 2681 transition count 8726
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5760 place count 2611 transition count 8628
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5890 place count 2561 transition count 8548
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6000 place count 2513 transition count 8486
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6080 place count 2481 transition count 8438
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6144 place count 2451 transition count 8404
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6186 place count 2433 transition count 8380
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6216 place count 2417 transition count 8366
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6232 place count 2409 transition count 8358
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6241 place count 2403 transition count 8355
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6245 place count 2400 transition count 8354
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 550 Pre rules applied. Total rules applied 6245 place count 2400 transition count 7804
Deduced a syphon composed of 550 places in 2 ms
Ensure Unique test removed 549 places
Reduce places removed 1099 places and 0 transitions.
Iterating global reduction 23 with 1649 rules applied. Total rules applied 7894 place count 1301 transition count 7804
Discarding 551 places :
Symmetric choice reduction at 23 with 551 rule applications. Total rules 8445 place count 750 transition count 7253
Iterating global reduction 23 with 551 rules applied. Total rules applied 8996 place count 750 transition count 7253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8996 place count 750 transition count 7252
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8998 place count 749 transition count 7252
Discarding 539 places :
Symmetric choice reduction at 23 with 539 rule applications. Total rules 9537 place count 210 transition count 1323
Iterating global reduction 23 with 539 rules applied. Total rules applied 10076 place count 210 transition count 1323
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Iterating post reduction 23 with 539 rules applied. Total rules applied 10615 place count 210 transition count 784
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10666 place count 184 transition count 759
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10688 place count 184 transition count 737
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10710 place count 162 transition count 737
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10732 place count 140 transition count 495
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 10765 place count 129 transition count 495
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10787 place count 129 transition count 473
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10798 place count 118 transition count 352
Iterating global reduction 26 with 11 rules applied. Total rules applied 10809 place count 118 transition count 352
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10820 place count 107 transition count 341
Iterating global reduction 26 with 11 rules applied. Total rules applied 10831 place count 107 transition count 341
Applied a total of 10831 rules in 9651 ms. Remains 107 /5073 variables (removed 4966) and now considering 341/13842 (removed 13501) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 341 rows 107 cols
[2023-03-23 20:17:54] [INFO ] Computed 40 place invariants in 5 ms
[2023-03-23 20:17:54] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:17:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-23 20:17:54] [INFO ] [Nat]Absence check using 4 positive and 36 generalized place invariants in 6 ms returned sat
[2023-03-23 20:17:54] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:17:54] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-23 20:17:54] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 5410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5410/5410 places, 8689/8689 transitions.
Applied a total of 0 rules in 511 ms. Remains 5410 /5410 variables (removed 0) and now considering 8689/8689 (removed 0) transitions.
[2023-03-23 20:17:55] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
// Phase 1: matrix 8089 rows 5410 cols
[2023-03-23 20:17:55] [INFO ] Computed 1249 place invariants in 244 ms
[2023-03-23 20:17:59] [INFO ] Implicit Places using invariants in 4446 ms returned []
[2023-03-23 20:17:59] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2023-03-23 20:17:59] [INFO ] Invariant cache hit.
[2023-03-23 20:18:04] [INFO ] Implicit Places using invariants and state equation in 4270 ms returned []
Implicit Place search using SMT with State Equation took 8733 ms to find 0 implicit places.
[2023-03-23 20:18:04] [INFO ] Redundant transitions in 774 ms returned []
[2023-03-23 20:18:04] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2023-03-23 20:18:04] [INFO ] Invariant cache hit.
[2023-03-23 20:18:10] [INFO ] Dead Transitions using invariants and state equation in 5759 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15790 ms. Remains : 5410/5410 places, 8689/8689 transitions.
Computed a total of 2811 stabilizing places and 3513 stable transitions
Computed a total of 2811 stabilizing places and 3513 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23992 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23992 steps, saw 11395 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 20:18:14] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2023-03-23 20:18:14] [INFO ] Invariant cache hit.
[2023-03-23 20:18:14] [INFO ] After 562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:18:15] [INFO ] [Nat]Absence check using 49 positive place invariants in 85 ms returned sat
[2023-03-23 20:18:15] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 355 ms returned sat
[2023-03-23 20:18:22] [INFO ] After 6528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:18:22] [INFO ] State equation strengthened by 3112 read => feed constraints.
[2023-03-23 20:18:23] [INFO ] After 1026ms SMT Verify possible using 3112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 20:18:29] [INFO ] Deduced a trap composed of 591 places in 5631 ms of which 5 ms to minimize.
[2023-03-23 20:18:35] [INFO ] Deduced a trap composed of 355 places in 6125 ms of which 6 ms to minimize.
[2023-03-23 20:18:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 12552 ms
[2023-03-23 20:18:36] [INFO ] After 13798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 367 ms.
[2023-03-23 20:18:36] [INFO ] After 21825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 5410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5410/5410 places, 8689/8689 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5410 transition count 13842
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5073 transition count 13842
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 5073 transition count 13842
Applied a total of 699 rules in 2316 ms. Remains 5073 /5410 variables (removed 337) and now considering 13842/8689 (removed -5153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2316 ms. Remains : 5073/5410 places, 13842/8689 transitions.
Incomplete random walk after 10000 steps, including 148 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19664 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19664 steps, saw 9242 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 20:18:42] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
// Phase 1: matrix 12956 rows 5073 cols
[2023-03-23 20:18:42] [INFO ] Computed 1249 place invariants in 346 ms
[2023-03-23 20:18:43] [INFO ] After 519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:18:43] [INFO ] [Nat]Absence check using 49 positive place invariants in 80 ms returned sat
[2023-03-23 20:18:44] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 343 ms returned sat
[2023-03-23 20:18:50] [INFO ] After 6420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:18:50] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-23 20:19:00] [INFO ] After 9249ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 20:19:08] [INFO ] Deduced a trap composed of 294 places in 8023 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 20:19:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:19:08] [INFO ] After 25180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 5073 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 803 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 804 ms. Remains : 5073/5073 places, 13842/13842 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5073/5073 places, 13842/13842 transitions.
Applied a total of 0 rules in 793 ms. Remains 5073 /5073 variables (removed 0) and now considering 13842/13842 (removed 0) transitions.
[2023-03-23 20:19:10] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2023-03-23 20:19:10] [INFO ] Invariant cache hit.
[2023-03-23 20:19:15] [INFO ] Implicit Places using invariants in 5052 ms returned []
Implicit Place search using SMT only with invariants took 5055 ms to find 0 implicit places.
[2023-03-23 20:19:15] [INFO ] Flow matrix only has 12956 transitions (discarded 886 similar events)
[2023-03-23 20:19:15] [INFO ] Invariant cache hit.
[2023-03-23 20:19:23] [INFO ] Dead Transitions using invariants and state equation in 7894 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13749 ms. Remains : 5073/5073 places, 13842/13842 transitions.
Graph (trivial) has 3578 edges and 5073 vertex of which 25 / 5073 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 51800 edges and 5049 vertex of which 5027 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4641 transition count 12113
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4399 transition count 11632
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4158 transition count 11192
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3918 transition count 10794
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3718 transition count 10434
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3520 transition count 10112
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 6 with 449 rules applied. Total rules applied 3816 place count 3358 transition count 9825
Ensure Unique test removed 32 places
Reduce places removed 159 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 127 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 7 with 411 rules applied. Total rules applied 4227 place count 3199 transition count 9573
Ensure Unique test removed 2 places
Reduce places removed 127 places and 0 transitions.
Drop transitions removed 27 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 125 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 350 rules applied. Total rules applied 4577 place count 3072 transition count 9350
Ensure Unique test removed 27 places
Reduce places removed 125 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 319 rules applied. Total rules applied 4896 place count 2947 transition count 9156
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5162 place count 2849 transition count 8988
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5400 place count 2753 transition count 8846
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5592 place count 2681 transition count 8726
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5760 place count 2611 transition count 8628
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5890 place count 2561 transition count 8548
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6000 place count 2513 transition count 8486
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6080 place count 2481 transition count 8438
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6144 place count 2451 transition count 8404
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6186 place count 2433 transition count 8380
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6216 place count 2417 transition count 8366
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6232 place count 2409 transition count 8358
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6241 place count 2403 transition count 8355
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6245 place count 2400 transition count 8354
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 550 Pre rules applied. Total rules applied 6245 place count 2400 transition count 7804
Deduced a syphon composed of 550 places in 2 ms
Ensure Unique test removed 549 places
Reduce places removed 1099 places and 0 transitions.
Iterating global reduction 23 with 1649 rules applied. Total rules applied 7894 place count 1301 transition count 7804
Discarding 551 places :
Symmetric choice reduction at 23 with 551 rule applications. Total rules 8445 place count 750 transition count 7253
Iterating global reduction 23 with 551 rules applied. Total rules applied 8996 place count 750 transition count 7253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8996 place count 750 transition count 7252
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8998 place count 749 transition count 7252
Discarding 539 places :
Symmetric choice reduction at 23 with 539 rule applications. Total rules 9537 place count 210 transition count 1323
Iterating global reduction 23 with 539 rules applied. Total rules applied 10076 place count 210 transition count 1323
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Iterating post reduction 23 with 539 rules applied. Total rules applied 10615 place count 210 transition count 784
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10666 place count 184 transition count 759
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10688 place count 184 transition count 737
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10710 place count 162 transition count 737
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10732 place count 140 transition count 495
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 10765 place count 129 transition count 495
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10787 place count 129 transition count 473
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10798 place count 118 transition count 352
Iterating global reduction 26 with 11 rules applied. Total rules applied 10809 place count 118 transition count 352
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10820 place count 107 transition count 341
Iterating global reduction 26 with 11 rules applied. Total rules applied 10831 place count 107 transition count 341
Applied a total of 10831 rules in 9402 ms. Remains 107 /5073 variables (removed 4966) and now considering 341/13842 (removed 13501) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 341 rows 107 cols
[2023-03-23 20:19:32] [INFO ] Computed 40 place invariants in 9 ms
[2023-03-23 20:19:32] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:19:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-23 20:19:32] [INFO ] [Nat]Absence check using 4 positive and 36 generalized place invariants in 6 ms returned sat
[2023-03-23 20:19:32] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:19:32] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-23 20:19:32] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1247 reset in 1284 ms.
Product exploration explored 100000 steps with 1246 reset in 1328 ms.
Built C files in :
/tmp/ltsmin7304305837024828113
[2023-03-23 20:19:35] [INFO ] Too many transitions (8689) to apply POR reductions. Disabling POR matrices.
[2023-03-23 20:19:35] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7304305837024828113
Running compilation step : cd /tmp/ltsmin7304305837024828113;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7304305837024828113;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7304305837024828113;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 5410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5410/5410 places, 8689/8689 transitions.
Applied a total of 0 rules in 504 ms. Remains 5410 /5410 variables (removed 0) and now considering 8689/8689 (removed 0) transitions.
[2023-03-23 20:19:39] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
// Phase 1: matrix 8089 rows 5410 cols
[2023-03-23 20:19:39] [INFO ] Computed 1249 place invariants in 235 ms
[2023-03-23 20:19:44] [INFO ] Implicit Places using invariants in 4769 ms returned []
[2023-03-23 20:19:44] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2023-03-23 20:19:44] [INFO ] Invariant cache hit.
[2023-03-23 20:19:48] [INFO ] Implicit Places using invariants and state equation in 4506 ms returned []
Implicit Place search using SMT with State Equation took 9279 ms to find 0 implicit places.
[2023-03-23 20:19:49] [INFO ] Redundant transitions in 783 ms returned []
[2023-03-23 20:19:49] [INFO ] Flow matrix only has 8089 transitions (discarded 600 similar events)
[2023-03-23 20:19:49] [INFO ] Invariant cache hit.
[2023-03-23 20:19:54] [INFO ] Dead Transitions using invariants and state equation in 5077 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15657 ms. Remains : 5410/5410 places, 8689/8689 transitions.
Built C files in :
/tmp/ltsmin11344469241542956130
[2023-03-23 20:19:54] [INFO ] Too many transitions (8689) to apply POR reductions. Disabling POR matrices.
[2023-03-23 20:19:54] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11344469241542956130
Running compilation step : cd /tmp/ltsmin11344469241542956130;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11344469241542956130;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11344469241542956130;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-23 20:19:58] [INFO ] Flatten gal took : 312 ms
[2023-03-23 20:19:58] [INFO ] Flatten gal took : 241 ms
[2023-03-23 20:19:59] [INFO ] Time to serialize gal into /tmp/LTL13343543312482611916.gal : 70 ms
[2023-03-23 20:19:59] [INFO ] Time to serialize properties into /tmp/LTL8983550320759675070.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/LTL13343543312482611916.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4537092882099226283.hoa' '-atoms' '/tmp/LTL8983550320759675070.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/LTL8983550320759675070.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4537092882099226283.hoa
Detected timeout of ITS tools.
[2023-03-23 20:20:14] [INFO ] Flatten gal took : 228 ms
[2023-03-23 20:20:15] [INFO ] Flatten gal took : 239 ms
[2023-03-23 20:20:15] [INFO ] Time to serialize gal into /tmp/LTL9295457464538508379.gal : 42 ms
[2023-03-23 20:20:15] [INFO ] Time to serialize properties into /tmp/LTL9922504895984116753.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/LTL9295457464538508379.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9922504895984116753.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(Node6ThinksNode10ShouldBeNodeMasterToReplaceNode11<=Node24HasAskedItsLeafSetToLx3ToReplaceNode11)"))))
Formula 0 simplified : GF!"(Node6ThinksNode10ShouldBeNodeMasterToReplaceNode11<=Node24HasAskedItsLeafSetToLx3ToReplaceNode11)"
Detected timeout of ITS tools.
[2023-03-23 20:20:30] [INFO ] Flatten gal took : 215 ms
[2023-03-23 20:20:30] [INFO ] Applying decomposition
[2023-03-23 20:20:30] [INFO ] Flatten gal took : 222 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/graph10639361421186314736.txt' '-o' '/tmp/graph10639361421186314736.bin' '-w' '/tmp/graph10639361421186314736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10639361421186314736.bin' '-l' '-1' '-v' '-w' '/tmp/graph10639361421186314736.weights' '-q' '0' '-e' '0.001'
[2023-03-23 20:20:31] [INFO ] Decomposing Gal with order
[2023-03-23 20:20:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 20:20:33] [INFO ] Removed a total of 7259 redundant transitions.
[2023-03-23 20:20:33] [INFO ] Flatten gal took : 1574 ms
[2023-03-23 20:20:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 918 labels/synchronizations in 275 ms.
[2023-03-23 20:20:35] [INFO ] Time to serialize gal into /tmp/LTL10203374093262315171.gal : 70 ms
[2023-03-23 20:20:35] [INFO ] Time to serialize properties into /tmp/LTL14039658324124834636.ltl : 11 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/LTL10203374093262315171.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14039658324124834636.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 : !((F(G("(gu409.Node6ThinksNode10ShouldBeNodeMasterToReplaceNode11<=gu409.Node24HasAskedItsLeafSetToLx3ToReplaceNode11)"))))
Formula 0 simplified : GF!"(gu409.Node6ThinksNode10ShouldBeNodeMasterToReplaceNode11<=gu409.Node24HasAskedItsLeafSetToLx3ToReplaceNode11)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15780031028697851365
[2023-03-23 20:20:50] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15780031028697851365
Running compilation step : cd /tmp/ltsmin15780031028697851365;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15780031028697851365;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15780031028697851365;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-09 finished in 283387 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((X(p0)&&(G(!p0)||F((G(F(p1))||(p2&&F(p1))))))))'
Support contains 5 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 506 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2023-03-23 20:20:53] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2023-03-23 20:20:56] [INFO ] Computed 1249 place invariants in 2352 ms
[2023-03-23 20:20:58] [INFO ] Implicit Places using invariants in 4081 ms returned []
Implicit Place search using SMT only with invariants took 4082 ms to find 0 implicit places.
[2023-03-23 20:20:58] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:20:58] [INFO ] Invariant cache hit.
[2023-03-23 20:20:59] [INFO ] Dead Transitions using invariants and state equation in 1767 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6357 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Stuttering acceptance computed with spot in 757 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ s7669 s4338), p1:(GT 1 s3254), p2:(GT s3580 s11846)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1788 reset in 2698 ms.
Product exploration explored 100000 steps with 1825 reset in 2462 ms.
Computed a total of 16580 stabilizing places and 22772 stable transitions
Computed a total of 16580 stabilizing places and 22772 stable transitions
Detected a total of 16580/19204 stabilizing places and 22772/27973 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 14 factoid took 812 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 20:21:07] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:21:07] [INFO ] Invariant cache hit.
[2023-03-23 20:21:10] [INFO ] [Real]Absence check using 47 positive place invariants in 223 ms returned sat
[2023-03-23 20:21:11] [INFO ] [Real]Absence check using 47 positive and 1202 generalized place invariants in 760 ms returned sat
[2023-03-23 20:21:32] [INFO ] After 21033ms SMT Verify possible using state equation in real domain returned unsat :0 sat :0 real:2
[2023-03-23 20:21:32] [INFO ] State equation strengthened by 8602 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 20:21:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:21:32] [INFO ] After 25118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 19204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6597 transitions
Trivial Post-agglo rules discarded 6597 transitions
Performed 6597 trivial Post agglomeration. Transition count delta: 6597
Iterating post reduction 0 with 6597 rules applied. Total rules applied 6597 place count 19204 transition count 21376
Reduce places removed 6597 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6599 rules applied. Total rules applied 13196 place count 12607 transition count 21374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13198 place count 12605 transition count 21374
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 550 Pre rules applied. Total rules applied 13198 place count 12605 transition count 20824
Deduced a syphon composed of 550 places in 18 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 3 with 1100 rules applied. Total rules applied 14298 place count 12055 transition count 20824
Discarding 6047 places :
Symmetric choice reduction at 3 with 6047 rule applications. Total rules 20345 place count 6008 transition count 14777
Iterating global reduction 3 with 6047 rules applied. Total rules applied 26392 place count 6008 transition count 14777
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 26392 place count 6008 transition count 14758
Deduced a syphon composed of 19 places in 10 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 26430 place count 5989 transition count 14758
Discarding 546 places :
Symmetric choice reduction at 3 with 546 rule applications. Total rules 26976 place count 5443 transition count 8752
Iterating global reduction 3 with 546 rules applied. Total rules applied 27522 place count 5443 transition count 8752
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27572 place count 5418 transition count 8727
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 3 with 337 rules applied. Total rules applied 27909 place count 5418 transition count 13740
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 3 with 337 rules applied. Total rules applied 28246 place count 5081 transition count 13740
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 4 with 75 rules applied. Total rules applied 28321 place count 5081 transition count 13740
Applied a total of 28321 rules in 4788 ms. Remains 5081 /19204 variables (removed 14123) and now considering 13740/27973 (removed 14233) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4788 ms. Remains : 5081/19204 places, 13740/27973 transitions.
Incomplete random walk after 10000 steps, including 146 resets, run finished after 771 ms. (steps per millisecond=12 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 20:21:38] [INFO ] Flow matrix only has 12855 transitions (discarded 885 similar events)
// Phase 1: matrix 12855 rows 5081 cols
[2023-03-23 20:21:38] [INFO ] Computed 1249 place invariants in 332 ms
[2023-03-23 20:21:39] [INFO ] After 599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 20:21:40] [INFO ] [Nat]Absence check using 49 positive place invariants in 67 ms returned sat
[2023-03-23 20:21:40] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 349 ms returned sat
[2023-03-23 20:21:40] [INFO ] After 965ms 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 p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND p0 (NOT p1))), (F p2)]
Knowledge based reduction with 16 factoid took 776 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 19204 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 430 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2023-03-23 20:21:41] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2023-03-23 20:21:44] [INFO ] Computed 1249 place invariants in 2368 ms
[2023-03-23 20:21:45] [INFO ] Implicit Places using invariants in 3939 ms returned []
Implicit Place search using SMT only with invariants took 3959 ms to find 0 implicit places.
[2023-03-23 20:21:45] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:21:45] [INFO ] Invariant cache hit.
[2023-03-23 20:21:47] [INFO ] Dead Transitions using invariants and state equation in 1530 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5922 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Computed a total of 16580 stabilizing places and 22772 stable transitions
Computed a total of 16580 stabilizing places and 22772 stable transitions
Detected a total of 16580/19204 stabilizing places and 22772/27973 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 5 factoid took 1176 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 20:21:49] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:21:49] [INFO ] Invariant cache hit.
[2023-03-23 20:21:51] [INFO ] [Real]Absence check using 47 positive place invariants in 220 ms returned sat
[2023-03-23 20:21:52] [INFO ] [Real]Absence check using 47 positive and 1202 generalized place invariants in 748 ms returned sat
[2023-03-23 20:22:14] [INFO ] After 25014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 19204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6599 transitions
Trivial Post-agglo rules discarded 6599 transitions
Performed 6599 trivial Post agglomeration. Transition count delta: 6599
Iterating post reduction 0 with 6599 rules applied. Total rules applied 6599 place count 19204 transition count 21374
Reduce places removed 6599 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13199 place count 12605 transition count 21373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 550 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20823
Deduced a syphon composed of 550 places in 18 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 3 with 1100 rules applied. Total rules applied 14300 place count 12054 transition count 20823
Discarding 6049 places :
Symmetric choice reduction at 3 with 6049 rule applications. Total rules 20349 place count 6005 transition count 14774
Iterating global reduction 3 with 6049 rules applied. Total rules applied 26398 place count 6005 transition count 14774
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 26398 place count 6005 transition count 14753
Deduced a syphon composed of 21 places in 12 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 26440 place count 5984 transition count 14753
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 26989 place count 5435 transition count 8714
Iterating global reduction 3 with 549 rules applied. Total rules applied 27538 place count 5435 transition count 8714
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27588 place count 5410 transition count 8689
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 3 with 337 rules applied. Total rules applied 27925 place count 5410 transition count 13842
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 3 with 337 rules applied. Total rules applied 28262 place count 5073 transition count 13842
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 28287 place count 5073 transition count 13842
Applied a total of 28287 rules in 4912 ms. Remains 5073 /19204 variables (removed 14131) and now considering 13842/27973 (removed 14131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4912 ms. Remains : 5073/19204 places, 13842/27973 transitions.
Finished random walk after 1187 steps, including 17 resets, run visited all 1 properties in 70 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 295 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 894 reset in 1730 ms.
Product exploration explored 100000 steps with 893 reset in 1852 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Performed 6600 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6600 rules applied. Total rules applied 6600 place count 19204 transition count 27973
Performed 575 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7175 places in 21 ms
Iterating global reduction 1 with 575 rules applied. Total rules applied 7175 place count 19204 transition count 27973
Deduced a syphon composed of 7175 places in 23 ms
Applied a total of 7175 rules in 5477 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2023-03-23 20:22:29] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2023-03-23 20:22:31] [INFO ] Computed 1249 place invariants in 2387 ms
[2023-03-23 20:22:33] [INFO ] Dead Transitions using invariants and state equation in 3942 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19204/19204 places, 27973/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9443 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Built C files in :
/tmp/ltsmin17293638630025014860
[2023-03-23 20:22:33] [INFO ] Built C files in 228ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17293638630025014860
Running compilation step : cd /tmp/ltsmin17293638630025014860;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17293638630025014860;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17293638630025014860;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 579 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2023-03-23 20:22:37] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2023-03-23 20:22:39] [INFO ] Computed 1249 place invariants in 2391 ms
[2023-03-23 20:22:41] [INFO ] Implicit Places using invariants in 3911 ms returned []
Implicit Place search using SMT only with invariants took 3933 ms to find 0 implicit places.
[2023-03-23 20:22:41] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:22:41] [INFO ] Invariant cache hit.
[2023-03-23 20:22:42] [INFO ] Dead Transitions using invariants and state equation in 1535 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6068 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Built C files in :
/tmp/ltsmin14315296751907835844
[2023-03-23 20:22:43] [INFO ] Built C files in 203ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14315296751907835844
Running compilation step : cd /tmp/ltsmin14315296751907835844;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14315296751907835844;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14315296751907835844;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-23 20:22:47] [INFO ] Flatten gal took : 942 ms
[2023-03-23 20:22:48] [INFO ] Flatten gal took : 729 ms
[2023-03-23 20:22:48] [INFO ] Time to serialize gal into /tmp/LTL9698961518320152447.gal : 221 ms
[2023-03-23 20:22:48] [INFO ] Time to serialize properties into /tmp/LTL15352456846125780108.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/LTL9698961518320152447.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8626469783784854718.hoa' '-atoms' '/tmp/LTL15352456846125780108.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/LTL15352456846125780108.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8626469783784854718.hoa
Detected timeout of ITS tools.
[2023-03-23 20:23:04] [INFO ] Flatten gal took : 693 ms
[2023-03-23 20:23:05] [INFO ] Flatten gal took : 716 ms
[2023-03-23 20:23:05] [INFO ] Time to serialize gal into /tmp/LTL14390508971874046875.gal : 133 ms
[2023-03-23 20:23:05] [INFO ] Time to serialize properties into /tmp/LTL11168139442375024244.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/LTL14390508971874046875.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11168139442375024244.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 : !((F((X("(Node10ManageTheCrashOfNode0<=Node5HasTheLeafSetOfLx10ToReplaceNode6)"))&&((G("(Node10ManageTheCrashOfNode0>Node5HasTheLeafSe...386
Formula 0 simplified : G(X!"(Node10ManageTheCrashOfNode0<=Node5HasTheLeafSetOfLx10ToReplaceNode6)" | (F!"(Node10ManageTheCrashOfNode0>Node5HasTheLeafSetOfL...370
Detected timeout of ITS tools.
[2023-03-23 20:23:21] [INFO ] Flatten gal took : 853 ms
[2023-03-23 20:23:21] [INFO ] Applying decomposition
[2023-03-23 20:23:22] [INFO ] Flatten gal took : 766 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/graph8324196155192776521.txt' '-o' '/tmp/graph8324196155192776521.bin' '-w' '/tmp/graph8324196155192776521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8324196155192776521.bin' '-l' '-1' '-v' '-w' '/tmp/graph8324196155192776521.weights' '-q' '0' '-e' '0.001'
[2023-03-23 20:23:23] [INFO ] Decomposing Gal with order
[2023-03-23 20:23:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 20:23:34] [INFO ] Removed a total of 17985 redundant transitions.
[2023-03-23 20:23:35] [INFO ] Flatten gal took : 6311 ms
[2023-03-23 20:23:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 255 labels/synchronizations in 192 ms.
[2023-03-23 20:23:37] [INFO ] Time to serialize gal into /tmp/LTL1303911826189091265.gal : 150 ms
[2023-03-23 20:23:37] [INFO ] Time to serialize properties into /tmp/LTL13708537453442205370.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/LTL1303911826189091265.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13708537453442205370.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((X("(gu250.Node10ManageTheCrashOfNode0<=gu250.Node5HasTheLeafSetOfLx10ToReplaceNode6)"))&&((G("(gu250.Node10ManageTheCrashOfNode0...450
Formula 0 simplified : G(X!"(gu250.Node10ManageTheCrashOfNode0<=gu250.Node5HasTheLeafSetOfLx10ToReplaceNode6)" | (F!"(gu250.Node10ManageTheCrashOfNode0>gu2...434
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4276029686812616428
[2023-03-23 20:23:53] [INFO ] Built C files in 313ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4276029686812616428
Running compilation step : cd /tmp/ltsmin4276029686812616428;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4276029686812616428;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4276029686812616428;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-11 finished in 182697 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)&&F(G(p1)))))'
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6598 transitions
Trivial Post-agglo rules discarded 6598 transitions
Performed 6598 trivial Post agglomeration. Transition count delta: 6598
Iterating post reduction 0 with 6598 rules applied. Total rules applied 6598 place count 19204 transition count 21375
Reduce places removed 6598 places and 0 transitions.
Iterating post reduction 1 with 6598 rules applied. Total rules applied 13196 place count 12606 transition count 21375
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 550 Pre rules applied. Total rules applied 13196 place count 12606 transition count 20825
Deduced a syphon composed of 550 places in 20 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 2 with 1100 rules applied. Total rules applied 14296 place count 12056 transition count 20825
Discarding 6048 places :
Symmetric choice reduction at 2 with 6048 rule applications. Total rules 20344 place count 6008 transition count 14777
Iterating global reduction 2 with 6048 rules applied. Total rules applied 26392 place count 6008 transition count 14777
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 26392 place count 6008 transition count 14757
Deduced a syphon composed of 20 places in 11 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 26432 place count 5988 transition count 14757
Discarding 547 places :
Symmetric choice reduction at 2 with 547 rule applications. Total rules 26979 place count 5441 transition count 8740
Iterating global reduction 2 with 547 rules applied. Total rules applied 27526 place count 5441 transition count 8740
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 27576 place count 5416 transition count 8715
Applied a total of 27576 rules in 3764 ms. Remains 5416 /19204 variables (removed 13788) and now considering 8715/27973 (removed 19258) transitions.
[2023-03-23 20:23:59] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
// Phase 1: matrix 8115 rows 5416 cols
[2023-03-23 20:24:00] [INFO ] Computed 1249 place invariants in 240 ms
[2023-03-23 20:24:04] [INFO ] Implicit Places using invariants in 5025 ms returned []
[2023-03-23 20:24:04] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2023-03-23 20:24:04] [INFO ] Invariant cache hit.
[2023-03-23 20:24:09] [INFO ] Implicit Places using invariants and state equation in 4411 ms returned []
Implicit Place search using SMT with State Equation took 9438 ms to find 0 implicit places.
[2023-03-23 20:24:10] [INFO ] Redundant transitions in 993 ms returned []
[2023-03-23 20:24:10] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2023-03-23 20:24:10] [INFO ] Invariant cache hit.
[2023-03-23 20:24:15] [INFO ] Dead Transitions using invariants and state equation in 5391 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5416/19204 places, 8715/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19599 ms. Remains : 5416/19204 places, 8715/27973 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s1187 s2743), p1:(LEQ s3239 s2079)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1254 reset in 1405 ms.
Product exploration explored 100000 steps with 1249 reset in 1428 ms.
Computed a total of 2817 stabilizing places and 3539 stable transitions
Computed a total of 2817 stabilizing places and 3539 stable transitions
Detected a total of 2817/5416 stabilizing places and 3539/8715 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 270 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 9820 steps, including 121 resets, run visited all 2 properties in 125 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 307 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 5416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5416/5416 places, 8715/8715 transitions.
Applied a total of 0 rules in 625 ms. Remains 5416 /5416 variables (removed 0) and now considering 8715/8715 (removed 0) transitions.
[2023-03-23 20:24:20] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2023-03-23 20:24:20] [INFO ] Invariant cache hit.
[2023-03-23 20:24:24] [INFO ] Implicit Places using invariants in 4190 ms returned []
[2023-03-23 20:24:24] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2023-03-23 20:24:24] [INFO ] Invariant cache hit.
[2023-03-23 20:24:29] [INFO ] Implicit Places using invariants and state equation in 4446 ms returned []
Implicit Place search using SMT with State Equation took 8638 ms to find 0 implicit places.
[2023-03-23 20:24:29] [INFO ] Redundant transitions in 781 ms returned []
[2023-03-23 20:24:29] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2023-03-23 20:24:29] [INFO ] Invariant cache hit.
[2023-03-23 20:24:35] [INFO ] Dead Transitions using invariants and state equation in 5386 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15439 ms. Remains : 5416/5416 places, 8715/8715 transitions.
Computed a total of 2817 stabilizing places and 3539 stable transitions
Computed a total of 2817 stabilizing places and 3539 stable transitions
Detected a total of 2817/5416 stabilizing places and 3539/8715 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 251 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 20:24:35] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2023-03-23 20:24:35] [INFO ] Invariant cache hit.
[2023-03-23 20:24:36] [INFO ] After 563ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:24:37] [INFO ] [Nat]Absence check using 49 positive place invariants in 90 ms returned sat
[2023-03-23 20:24:37] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 366 ms returned sat
[2023-03-23 20:24:43] [INFO ] After 5460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:24:43] [INFO ] State equation strengthened by 3132 read => feed constraints.
[2023-03-23 20:24:45] [INFO ] After 2821ms SMT Verify possible using 3132 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 20:24:46] [INFO ] After 3320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 313 ms.
[2023-03-23 20:24:46] [INFO ] After 10248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 5416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5416/5416 places, 8715/8715 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5415 transition count 8704
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5415 transition count 8704
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 0 with 338 rules applied. Total rules applied 340 place count 5415 transition count 13846
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 678 place count 5077 transition count 13846
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 1 with 50 rules applied. Total rules applied 728 place count 5077 transition count 13846
Applied a total of 728 rules in 3210 ms. Remains 5077 /5416 variables (removed 339) and now considering 13846/8715 (removed -5131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3211 ms. Remains : 5077/5416 places, 13846/8715 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 20106 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20106 steps, saw 9444 distinct states, run finished after 3003 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 20:24:53] [INFO ] Flow matrix only has 12960 transitions (discarded 886 similar events)
// Phase 1: matrix 12960 rows 5077 cols
[2023-03-23 20:24:54] [INFO ] Computed 1249 place invariants in 391 ms
[2023-03-23 20:24:54] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:24:55] [INFO ] [Nat]Absence check using 49 positive place invariants in 78 ms returned sat
[2023-03-23 20:24:55] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 333 ms returned sat
[2023-03-23 20:25:02] [INFO ] After 7065ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:25:02] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-23 20:25:07] [INFO ] After 4945ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 20:25:08] [INFO ] After 5617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 452 ms.
[2023-03-23 20:25:08] [INFO ] After 14264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 5077 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5077/5077 places, 13846/13846 transitions.
Applied a total of 0 rules in 933 ms. Remains 5077 /5077 variables (removed 0) and now considering 13846/13846 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 933 ms. Remains : 5077/5077 places, 13846/13846 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5077/5077 places, 13846/13846 transitions.
Applied a total of 0 rules in 921 ms. Remains 5077 /5077 variables (removed 0) and now considering 13846/13846 (removed 0) transitions.
[2023-03-23 20:25:10] [INFO ] Flow matrix only has 12960 transitions (discarded 886 similar events)
[2023-03-23 20:25:10] [INFO ] Invariant cache hit.
[2023-03-23 20:25:17] [INFO ] Implicit Places using invariants in 7055 ms returned []
Implicit Place search using SMT only with invariants took 7055 ms to find 0 implicit places.
[2023-03-23 20:25:17] [INFO ] Flow matrix only has 12960 transitions (discarded 886 similar events)
[2023-03-23 20:25:17] [INFO ] Invariant cache hit.
[2023-03-23 20:25:25] [INFO ] Dead Transitions using invariants and state equation in 8021 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16005 ms. Remains : 5077/5077 places, 13846/13846 transitions.
Graph (trivial) has 3579 edges and 5077 vertex of which 25 / 5077 are part of one of the 1 SCC in 3 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 51807 edges and 5053 vertex of which 5031 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4645 transition count 12117
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 4403 transition count 11636
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 4162 transition count 11196
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3922 transition count 10798
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3722 transition count 10438
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3524 transition count 10116
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 3362 transition count 9828
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 3202 transition count 9574
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 3074 transition count 9350
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2948 transition count 9156
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2850 transition count 8988
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2754 transition count 8846
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2682 transition count 8726
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2612 transition count 8628
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2562 transition count 8548
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2514 transition count 8486
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2482 transition count 8438
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 2452 transition count 8404
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 2434 transition count 8380
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 2418 transition count 8366
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 2410 transition count 8358
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 2403 transition count 8356
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2401 transition count 8356
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 550 Pre rules applied. Total rules applied 6250 place count 2401 transition count 7806
Deduced a syphon composed of 550 places in 2 ms
Ensure Unique test removed 548 places
Reduce places removed 1098 places and 0 transitions.
Iterating global reduction 23 with 1648 rules applied. Total rules applied 7898 place count 1303 transition count 7806
Discarding 550 places :
Symmetric choice reduction at 23 with 550 rule applications. Total rules 8448 place count 753 transition count 7256
Iterating global reduction 23 with 550 rules applied. Total rules applied 8998 place count 753 transition count 7256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8998 place count 753 transition count 7255
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9000 place count 752 transition count 7255
Discarding 528 places :
Symmetric choice reduction at 23 with 528 rule applications. Total rules 9528 place count 224 transition count 1447
Iterating global reduction 23 with 528 rules applied. Total rules applied 10056 place count 224 transition count 1447
Ensure Unique test removed 528 transitions
Reduce isomorphic transitions removed 528 transitions.
Iterating post reduction 23 with 528 rules applied. Total rules applied 10584 place count 224 transition count 919
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 10635 place count 198 transition count 894
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10657 place count 198 transition count 872
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10679 place count 176 transition count 872
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10701 place count 154 transition count 630
Ensure Unique test removed 11 places
Iterating global reduction 25 with 33 rules applied. Total rules applied 10734 place count 143 transition count 630
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10756 place count 143 transition count 608
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10767 place count 132 transition count 487
Iterating global reduction 26 with 11 rules applied. Total rules applied 10778 place count 132 transition count 487
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10789 place count 121 transition count 476
Iterating global reduction 26 with 11 rules applied. Total rules applied 10800 place count 121 transition count 476
Applied a total of 10800 rules in 9454 ms. Remains 121 /5077 variables (removed 4956) and now considering 476/13846 (removed 13370) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 476 rows 121 cols
[2023-03-23 20:25:35] [INFO ] Computed 39 place invariants in 3 ms
[2023-03-23 20:25:35] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:25:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 20:25:35] [INFO ] [Nat]Absence check using 3 positive and 36 generalized place invariants in 7 ms returned sat
[2023-03-23 20:25:35] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:25:35] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-23 20:25:35] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 323 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1254 reset in 1219 ms.
Product exploration explored 100000 steps with 1258 reset in 1228 ms.
Built C files in :
/tmp/ltsmin10350320627955685203
[2023-03-23 20:25:38] [INFO ] Too many transitions (8715) to apply POR reductions. Disabling POR matrices.
[2023-03-23 20:25:38] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10350320627955685203
Running compilation step : cd /tmp/ltsmin10350320627955685203;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10350320627955685203;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10350320627955685203;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 5416 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5416/5416 places, 8715/8715 transitions.
Applied a total of 0 rules in 645 ms. Remains 5416 /5416 variables (removed 0) and now considering 8715/8715 (removed 0) transitions.
[2023-03-23 20:25:42] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
// Phase 1: matrix 8115 rows 5416 cols
[2023-03-23 20:25:42] [INFO ] Computed 1249 place invariants in 229 ms
[2023-03-23 20:25:47] [INFO ] Implicit Places using invariants in 4999 ms returned []
[2023-03-23 20:25:47] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2023-03-23 20:25:47] [INFO ] Invariant cache hit.
[2023-03-23 20:25:51] [INFO ] Implicit Places using invariants and state equation in 4216 ms returned []
Implicit Place search using SMT with State Equation took 9256 ms to find 0 implicit places.
[2023-03-23 20:25:52] [INFO ] Redundant transitions in 758 ms returned []
[2023-03-23 20:25:52] [INFO ] Flow matrix only has 8115 transitions (discarded 600 similar events)
[2023-03-23 20:25:52] [INFO ] Invariant cache hit.
[2023-03-23 20:25:57] [INFO ] Dead Transitions using invariants and state equation in 5108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15793 ms. Remains : 5416/5416 places, 8715/8715 transitions.
Built C files in :
/tmp/ltsmin11032728928683201417
[2023-03-23 20:25:57] [INFO ] Too many transitions (8715) to apply POR reductions. Disabling POR matrices.
[2023-03-23 20:25:57] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11032728928683201417
Running compilation step : cd /tmp/ltsmin11032728928683201417;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11032728928683201417;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11032728928683201417;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-23 20:26:01] [INFO ] Flatten gal took : 218 ms
[2023-03-23 20:26:01] [INFO ] Flatten gal took : 231 ms
[2023-03-23 20:26:01] [INFO ] Time to serialize gal into /tmp/LTL5849899453849224695.gal : 41 ms
[2023-03-23 20:26:01] [INFO ] Time to serialize properties into /tmp/LTL607956300576725946.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/LTL5849899453849224695.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15914846080717927838.hoa' '-atoms' '/tmp/LTL607956300576725946.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...317
Loading property file /tmp/LTL607956300576725946.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15914846080717927838.hoa
Detected timeout of ITS tools.
[2023-03-23 20:26:17] [INFO ] Flatten gal took : 224 ms
[2023-03-23 20:26:17] [INFO ] Flatten gal took : 234 ms
[2023-03-23 20:26:17] [INFO ] Time to serialize gal into /tmp/LTL12916667948376884124.gal : 185 ms
[2023-03-23 20:26:17] [INFO ] Time to serialize properties into /tmp/LTL4459715069345828669.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/LTL12916667948376884124.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4459715069345828669.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(Node3HasDetectedCrashOfNode23<=Node15ManageTheCrashOfNode18)"))&&(F(G("(Node19HasTheLeafSetOfLx6ToReplaceNode5<=Node9HasTheL...189
Formula 0 simplified : F(G!"(Node3HasDetectedCrashOfNode23<=Node15ManageTheCrashOfNode18)" | GF!"(Node19HasTheLeafSetOfLx6ToReplaceNode5<=Node9HasTheLeafSe...179
Detected timeout of ITS tools.
[2023-03-23 20:26:32] [INFO ] Flatten gal took : 221 ms
[2023-03-23 20:26:32] [INFO ] Applying decomposition
[2023-03-23 20:26:33] [INFO ] Flatten gal took : 230 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/graph1019104833473280730.txt' '-o' '/tmp/graph1019104833473280730.bin' '-w' '/tmp/graph1019104833473280730.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1019104833473280730.bin' '-l' '-1' '-v' '-w' '/tmp/graph1019104833473280730.weights' '-q' '0' '-e' '0.001'
[2023-03-23 20:26:33] [INFO ] Decomposing Gal with order
[2023-03-23 20:26:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 20:26:35] [INFO ] Removed a total of 7136 redundant transitions.
[2023-03-23 20:26:35] [INFO ] Flatten gal took : 1197 ms
[2023-03-23 20:26:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1231 labels/synchronizations in 317 ms.
[2023-03-23 20:26:36] [INFO ] Time to serialize gal into /tmp/LTL15238167619413208432.gal : 67 ms
[2023-03-23 20:26:36] [INFO ] Time to serialize properties into /tmp/LTL6604537981526551323.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/LTL15238167619413208432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6604537981526551323.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(gu213.Node3HasDetectedCrashOfNode23<=gu213.Node15ManageTheCrashOfNode18)"))&&(F(G("(gu195.Node19HasTheLeafSetOfLx6ToReplaceN...213
Formula 0 simplified : F(G!"(gu213.Node3HasDetectedCrashOfNode23<=gu213.Node15ManageTheCrashOfNode18)" | GF!"(gu195.Node19HasTheLeafSetOfLx6ToReplaceNode5<...203
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8485822379486070125
[2023-03-23 20:26:51] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8485822379486070125
Running compilation step : cd /tmp/ltsmin8485822379486070125;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8485822379486070125;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8485822379486070125;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-13 finished in 178863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 576 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2023-03-23 20:26:55] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2023-03-23 20:26:58] [INFO ] Computed 1249 place invariants in 2584 ms
[2023-03-23 20:26:59] [INFO ] Implicit Places using invariants in 4135 ms returned []
Implicit Place search using SMT only with invariants took 4150 ms to find 0 implicit places.
[2023-03-23 20:26:59] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:26:59] [INFO ] Invariant cache hit.
[2023-03-23 20:27:01] [INFO ] Dead Transitions using invariants and state equation in 1582 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6337 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GT s14261 s13339) (GT 2 s12689)), p0:(OR (LEQ 2 s10239) (LEQ s14261 s13339))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 886 reset in 1813 ms.
Product exploration explored 100000 steps with 886 reset in 1952 ms.
Computed a total of 16580 stabilizing places and 22772 stable transitions
Computed a total of 16580 stabilizing places and 22772 stable transitions
Detected a total of 16580/19204 stabilizing places and 22772/27973 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 397 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 9279 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9279 steps, saw 4585 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 20:27:10] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:27:10] [INFO ] Invariant cache hit.
[2023-03-23 20:27:12] [INFO ] After 2891ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 20:27:15] [INFO ] [Nat]Absence check using 47 positive place invariants in 186 ms returned sat
[2023-03-23 20:27:16] [INFO ] [Nat]Absence check using 47 positive and 1202 generalized place invariants in 787 ms returned sat
[2023-03-23 20:27:37] [INFO ] After 20452ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-23 20:27:38] [INFO ] State equation strengthened by 8602 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 20:27:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:27:38] [INFO ] After 25096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6598 transitions
Trivial Post-agglo rules discarded 6598 transitions
Performed 6598 trivial Post agglomeration. Transition count delta: 6598
Iterating post reduction 0 with 6598 rules applied. Total rules applied 6598 place count 19204 transition count 21375
Reduce places removed 6598 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13198 place count 12606 transition count 21373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 550 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20823
Deduced a syphon composed of 550 places in 22 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 3 with 1100 rules applied. Total rules applied 14300 place count 12054 transition count 20823
Discarding 6048 places :
Symmetric choice reduction at 3 with 6048 rule applications. Total rules 20348 place count 6006 transition count 14775
Iterating global reduction 3 with 6048 rules applied. Total rules applied 26396 place count 6006 transition count 14775
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 26396 place count 6006 transition count 14755
Deduced a syphon composed of 20 places in 12 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 26436 place count 5986 transition count 14755
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 26984 place count 5438 transition count 8727
Iterating global reduction 3 with 548 rules applied. Total rules applied 27532 place count 5438 transition count 8727
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27582 place count 5413 transition count 8702
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 3 with 337 rules applied. Total rules applied 27919 place count 5413 transition count 13845
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 3 with 337 rules applied. Total rules applied 28256 place count 5076 transition count 13845
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 28306 place count 5076 transition count 13845
Applied a total of 28306 rules in 5797 ms. Remains 5076 /19204 variables (removed 14128) and now considering 13845/27973 (removed 14128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5797 ms. Remains : 5076/19204 places, 13845/27973 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 890 ms. (steps per millisecond=11 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 19575 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19575 steps, saw 9208 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 20:27:48] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
// Phase 1: matrix 12960 rows 5076 cols
[2023-03-23 20:27:48] [INFO ] Computed 1249 place invariants in 358 ms
[2023-03-23 20:27:49] [INFO ] After 638ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 20:27:49] [INFO ] [Nat]Absence check using 49 positive place invariants in 81 ms returned sat
[2023-03-23 20:27:50] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 329 ms returned sat
[2023-03-23 20:28:00] [INFO ] After 9714ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 20:28:00] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-23 20:28:05] [INFO ] After 5143ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 20:28:13] [INFO ] Deduced a trap composed of 546 places in 7051 ms of which 12 ms to minimize.
[2023-03-23 20:28:14] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 8397 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 20:28:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:28:14] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 5076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 853 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 853 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 849 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
[2023-03-23 20:28:15] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2023-03-23 20:28:15] [INFO ] Invariant cache hit.
[2023-03-23 20:28:20] [INFO ] Implicit Places using invariants in 4886 ms returned []
Implicit Place search using SMT only with invariants took 4904 ms to find 0 implicit places.
[2023-03-23 20:28:20] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2023-03-23 20:28:20] [INFO ] Invariant cache hit.
[2023-03-23 20:28:28] [INFO ] Dead Transitions using invariants and state equation in 7791 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13552 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Graph (trivial) has 3577 edges and 5076 vertex of which 25 / 5076 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 643 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 51807 edges and 5052 vertex of which 5030 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4644 transition count 12117
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 722 rules applied. Total rules applied 967 place count 4402 transition count 11637
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 39 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 679 rules applied. Total rules applied 1646 place count 4162 transition count 11198
Ensure Unique test removed 39 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 637 rules applied. Total rules applied 2283 place count 3923 transition count 10800
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2843 place count 3723 transition count 10440
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3363 place count 3525 transition count 10118
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3813 place count 3363 transition count 9830
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4227 place count 3203 transition count 9576
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4579 place count 3075 transition count 9352
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4899 place count 2949 transition count 9158
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5165 place count 2851 transition count 8990
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5403 place count 2755 transition count 8848
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5595 place count 2683 transition count 8728
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5763 place count 2613 transition count 8630
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5893 place count 2563 transition count 8550
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6003 place count 2515 transition count 8488
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6083 place count 2483 transition count 8440
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6147 place count 2453 transition count 8406
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6189 place count 2435 transition count 8382
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6219 place count 2419 transition count 8368
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6235 place count 2411 transition count 8360
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6244 place count 2405 transition count 8357
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6248 place count 2402 transition count 8356
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 549 Pre rules applied. Total rules applied 6248 place count 2402 transition count 7807
Deduced a syphon composed of 549 places in 2 ms
Ensure Unique test removed 547 places
Reduce places removed 1096 places and 0 transitions.
Iterating global reduction 23 with 1645 rules applied. Total rules applied 7893 place count 1306 transition count 7807
Discarding 549 places :
Symmetric choice reduction at 23 with 549 rule applications. Total rules 8442 place count 757 transition count 7258
Iterating global reduction 23 with 549 rules applied. Total rules applied 8991 place count 757 transition count 7258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8991 place count 757 transition count 7257
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8993 place count 756 transition count 7257
Discarding 515 places :
Symmetric choice reduction at 23 with 515 rule applications. Total rules 9508 place count 241 transition count 1592
Iterating global reduction 23 with 515 rules applied. Total rules applied 10023 place count 241 transition count 1592
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 23 with 515 rules applied. Total rules applied 10538 place count 241 transition count 1077
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 50 rules applied. Total rules applied 10588 place count 216 transition count 1052
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10610 place count 216 transition count 1030
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10632 place count 194 transition count 1030
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10654 place count 172 transition count 788
Iterating global reduction 25 with 22 rules applied. Total rules applied 10676 place count 172 transition count 788
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10698 place count 172 transition count 766
Applied a total of 10698 rules in 9185 ms. Remains 172 /5076 variables (removed 4904) and now considering 766/13845 (removed 13079) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 766 rows 172 cols
[2023-03-23 20:28:37] [INFO ] Computed 54 place invariants in 23 ms
[2023-03-23 20:28:37] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 20:28:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-23 20:28:37] [INFO ] [Nat]Absence check using 4 positive and 50 generalized place invariants in 6 ms returned sat
[2023-03-23 20:28:38] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 20:28:38] [INFO ] After 285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-23 20:28:38] [INFO ] After 416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 428 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 592 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2023-03-23 20:28:39] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2023-03-23 20:28:41] [INFO ] Computed 1249 place invariants in 2347 ms
[2023-03-23 20:28:43] [INFO ] Implicit Places using invariants in 3877 ms returned []
Implicit Place search using SMT only with invariants took 3896 ms to find 0 implicit places.
[2023-03-23 20:28:43] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:28:43] [INFO ] Invariant cache hit.
[2023-03-23 20:28:45] [INFO ] Dead Transitions using invariants and state equation in 1537 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6039 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Computed a total of 16580 stabilizing places and 22772 stable transitions
Computed a total of 16580 stabilizing places and 22772 stable transitions
Detected a total of 16580/19204 stabilizing places and 22772/27973 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 9600 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9600 steps, saw 4731 distinct states, run finished after 3003 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 20:28:48] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:28:49] [INFO ] Invariant cache hit.
[2023-03-23 20:28:51] [INFO ] After 2409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 20:28:54] [INFO ] [Nat]Absence check using 47 positive place invariants in 221 ms returned sat
[2023-03-23 20:28:54] [INFO ] [Nat]Absence check using 47 positive and 1202 generalized place invariants in 785 ms returned sat
[2023-03-23 20:29:16] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6598 transitions
Trivial Post-agglo rules discarded 6598 transitions
Performed 6598 trivial Post agglomeration. Transition count delta: 6598
Iterating post reduction 0 with 6598 rules applied. Total rules applied 6598 place count 19204 transition count 21375
Reduce places removed 6598 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13198 place count 12606 transition count 21373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 550 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20823
Deduced a syphon composed of 550 places in 19 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 3 with 1100 rules applied. Total rules applied 14300 place count 12054 transition count 20823
Discarding 6048 places :
Symmetric choice reduction at 3 with 6048 rule applications. Total rules 20348 place count 6006 transition count 14775
Iterating global reduction 3 with 6048 rules applied. Total rules applied 26396 place count 6006 transition count 14775
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 26396 place count 6006 transition count 14755
Deduced a syphon composed of 20 places in 11 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 26436 place count 5986 transition count 14755
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 26984 place count 5438 transition count 8727
Iterating global reduction 3 with 548 rules applied. Total rules applied 27532 place count 5438 transition count 8727
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27582 place count 5413 transition count 8702
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 3 with 337 rules applied. Total rules applied 27919 place count 5413 transition count 13845
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 3 with 337 rules applied. Total rules applied 28256 place count 5076 transition count 13845
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 28306 place count 5076 transition count 13845
Applied a total of 28306 rules in 5705 ms. Remains 5076 /19204 variables (removed 14128) and now considering 13845/27973 (removed 14128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5706 ms. Remains : 5076/19204 places, 13845/27973 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 680 ms. (steps per millisecond=14 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 19868 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19868 steps, saw 9337 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 20:29:26] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
// Phase 1: matrix 12960 rows 5076 cols
[2023-03-23 20:29:26] [INFO ] Computed 1249 place invariants in 333 ms
[2023-03-23 20:29:26] [INFO ] After 556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 20:29:27] [INFO ] [Nat]Absence check using 49 positive place invariants in 78 ms returned sat
[2023-03-23 20:29:27] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 336 ms returned sat
[2023-03-23 20:29:36] [INFO ] After 8523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 20:29:36] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-23 20:29:40] [INFO ] After 3767ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 20:29:47] [INFO ] Deduced a trap composed of 546 places in 6969 ms of which 5 ms to minimize.
[2023-03-23 20:29:56] [INFO ] Deduced a trap composed of 528 places in 6943 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 20:29:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:29:56] [INFO ] After 29393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 5076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 850 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 850 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 845 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
[2023-03-23 20:29:58] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2023-03-23 20:29:58] [INFO ] Invariant cache hit.
[2023-03-23 20:30:02] [INFO ] Implicit Places using invariants in 4827 ms returned []
Implicit Place search using SMT only with invariants took 4831 ms to find 0 implicit places.
[2023-03-23 20:30:02] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2023-03-23 20:30:02] [INFO ] Invariant cache hit.
[2023-03-23 20:30:10] [INFO ] Dead Transitions using invariants and state equation in 7737 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13427 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Graph (trivial) has 3577 edges and 5076 vertex of which 25 / 5076 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 643 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 51807 edges and 5052 vertex of which 5030 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4644 transition count 12117
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 722 rules applied. Total rules applied 967 place count 4402 transition count 11637
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 39 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 679 rules applied. Total rules applied 1646 place count 4162 transition count 11198
Ensure Unique test removed 39 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 637 rules applied. Total rules applied 2283 place count 3923 transition count 10800
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2843 place count 3723 transition count 10440
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3363 place count 3525 transition count 10118
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3813 place count 3363 transition count 9830
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4227 place count 3203 transition count 9576
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4579 place count 3075 transition count 9352
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4899 place count 2949 transition count 9158
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5165 place count 2851 transition count 8990
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5403 place count 2755 transition count 8848
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5595 place count 2683 transition count 8728
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5763 place count 2613 transition count 8630
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5893 place count 2563 transition count 8550
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6003 place count 2515 transition count 8488
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6083 place count 2483 transition count 8440
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6147 place count 2453 transition count 8406
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6189 place count 2435 transition count 8382
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6219 place count 2419 transition count 8368
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6235 place count 2411 transition count 8360
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6244 place count 2405 transition count 8357
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6248 place count 2402 transition count 8356
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 549 Pre rules applied. Total rules applied 6248 place count 2402 transition count 7807
Deduced a syphon composed of 549 places in 2 ms
Ensure Unique test removed 547 places
Reduce places removed 1096 places and 0 transitions.
Iterating global reduction 23 with 1645 rules applied. Total rules applied 7893 place count 1306 transition count 7807
Discarding 549 places :
Symmetric choice reduction at 23 with 549 rule applications. Total rules 8442 place count 757 transition count 7258
Iterating global reduction 23 with 549 rules applied. Total rules applied 8991 place count 757 transition count 7258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8991 place count 757 transition count 7257
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8993 place count 756 transition count 7257
Discarding 515 places :
Symmetric choice reduction at 23 with 515 rule applications. Total rules 9508 place count 241 transition count 1592
Iterating global reduction 23 with 515 rules applied. Total rules applied 10023 place count 241 transition count 1592
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 23 with 515 rules applied. Total rules applied 10538 place count 241 transition count 1077
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 50 rules applied. Total rules applied 10588 place count 216 transition count 1052
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10610 place count 216 transition count 1030
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10632 place count 194 transition count 1030
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10654 place count 172 transition count 788
Iterating global reduction 25 with 22 rules applied. Total rules applied 10676 place count 172 transition count 788
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10698 place count 172 transition count 766
Applied a total of 10698 rules in 9123 ms. Remains 172 /5076 variables (removed 4904) and now considering 766/13845 (removed 13079) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 766 rows 172 cols
[2023-03-23 20:30:19] [INFO ] Computed 54 place invariants in 21 ms
[2023-03-23 20:30:19] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 20:30:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-23 20:30:19] [INFO ] [Nat]Absence check using 4 positive and 50 generalized place invariants in 6 ms returned sat
[2023-03-23 20:30:20] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 20:30:20] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-23 20:30:20] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 886 reset in 1678 ms.
Product exploration explored 100000 steps with 885 reset in 1765 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Performed 6600 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6600 rules applied. Total rules applied 6600 place count 19204 transition count 27973
Performed 575 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7175 places in 21 ms
Iterating global reduction 1 with 575 rules applied. Total rules applied 7175 place count 19204 transition count 27973
Deduced a syphon composed of 7175 places in 22 ms
Applied a total of 7175 rules in 4445 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2023-03-23 20:30:28] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2023-03-23 20:30:31] [INFO ] Computed 1249 place invariants in 2419 ms
[2023-03-23 20:30:32] [INFO ] Dead Transitions using invariants and state equation in 3950 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19204/19204 places, 27973/27973 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8412 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Built C files in :
/tmp/ltsmin10437748623828236260
[2023-03-23 20:30:32] [INFO ] Built C files in 184ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10437748623828236260
Running compilation step : cd /tmp/ltsmin10437748623828236260;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10437748623828236260;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10437748623828236260;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Applied a total of 0 rules in 613 ms. Remains 19204 /19204 variables (removed 0) and now considering 27973/27973 (removed 0) transitions.
[2023-03-23 20:30:36] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
// Phase 1: matrix 27373 rows 19204 cols
[2023-03-23 20:30:38] [INFO ] Computed 1249 place invariants in 2331 ms
[2023-03-23 20:30:40] [INFO ] Implicit Places using invariants in 3876 ms returned []
Implicit Place search using SMT only with invariants took 3886 ms to find 0 implicit places.
[2023-03-23 20:30:40] [INFO ] Flow matrix only has 27373 transitions (discarded 600 similar events)
[2023-03-23 20:30:40] [INFO ] Invariant cache hit.
[2023-03-23 20:30:42] [INFO ] Dead Transitions using invariants and state equation in 1514 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6024 ms. Remains : 19204/19204 places, 27973/27973 transitions.
Built C files in :
/tmp/ltsmin6952316435575366122
[2023-03-23 20:30:42] [INFO ] Built C files in 187ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6952316435575366122
Running compilation step : cd /tmp/ltsmin6952316435575366122;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6952316435575366122;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6952316435575366122;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-23 20:30:46] [INFO ] Flatten gal took : 688 ms
[2023-03-23 20:30:47] [INFO ] Flatten gal took : 716 ms
[2023-03-23 20:30:47] [INFO ] Time to serialize gal into /tmp/LTL16313507486154190010.gal : 108 ms
[2023-03-23 20:30:47] [INFO ] Time to serialize properties into /tmp/LTL14091285030251615088.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/LTL16313507486154190010.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3797692147892976491.hoa' '-atoms' '/tmp/LTL14091285030251615088.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14091285030251615088.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3797692147892976491.hoa
Detected timeout of ITS tools.
[2023-03-23 20:31:03] [INFO ] Flatten gal took : 682 ms
[2023-03-23 20:31:04] [INFO ] Flatten gal took : 711 ms
[2023-03-23 20:31:04] [INFO ] Time to serialize gal into /tmp/LTL12219886496322953235.gal : 112 ms
[2023-03-23 20:31:04] [INFO ] Time to serialize properties into /tmp/LTL735572535290418050.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/LTL12219886496322953235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL735572535290418050.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("((RequestOfNode13IsSentToLx3>=2)||(Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=Node18HasAskedItsLeafSetToRx0ToReplaceNode1...323
Formula 0 simplified : XF(!"((RequestOfNode13IsSentToLx3>=2)||(Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=Node18HasAskedItsLeafSetToRx0ToReplaceNode13)...315
Detected timeout of ITS tools.
[2023-03-23 20:31:19] [INFO ] Flatten gal took : 689 ms
[2023-03-23 20:31:19] [INFO ] Applying decomposition
[2023-03-23 20:31:20] [INFO ] Flatten gal took : 711 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/graph17354339648261087332.txt' '-o' '/tmp/graph17354339648261087332.bin' '-w' '/tmp/graph17354339648261087332.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17354339648261087332.bin' '-l' '-1' '-v' '-w' '/tmp/graph17354339648261087332.weights' '-q' '0' '-e' '0.001'
[2023-03-23 20:31:22] [INFO ] Decomposing Gal with order
[2023-03-23 20:31:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 20:31:32] [INFO ] Removed a total of 17867 redundant transitions.
[2023-03-23 20:31:33] [INFO ] Flatten gal took : 6269 ms
[2023-03-23 20:31:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 307 labels/synchronizations in 144 ms.
[2023-03-23 20:31:35] [INFO ] Time to serialize gal into /tmp/LTL1989044498661722564.gal : 138 ms
[2023-03-23 20:31:35] [INFO ] Time to serialize properties into /tmp/LTL9076997344148075653.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/LTL1989044498661722564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9076997344148075653.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("((gi1.gi2.gu441.RequestOfNode13IsSentToLx3>=2)||(gu254.Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=gu254.Node18HasAskedIts...375
Formula 0 simplified : XF(!"((gi1.gi2.gu441.RequestOfNode13IsSentToLx3>=2)||(gu254.Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=gu254.Node18HasAskedItsLe...367
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6963798991786825003
[2023-03-23 20:31:50] [INFO ] Built C files in 186ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6963798991786825003
Running compilation step : cd /tmp/ltsmin6963798991786825003;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6963798991786825003;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6963798991786825003;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-15 finished in 298677 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)))'
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((X(p0)&&(G(!p0)||F((G(F(p1))||(p2&&F(p1))))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-11
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6597 transitions
Trivial Post-agglo rules discarded 6597 transitions
Performed 6597 trivial Post agglomeration. Transition count delta: 6597
Iterating post reduction 0 with 6597 rules applied. Total rules applied 6597 place count 19204 transition count 21376
Reduce places removed 6597 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6599 rules applied. Total rules applied 13196 place count 12607 transition count 21374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13198 place count 12605 transition count 21374
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 550 Pre rules applied. Total rules applied 13198 place count 12605 transition count 20824
Deduced a syphon composed of 550 places in 18 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 3 with 1100 rules applied. Total rules applied 14298 place count 12055 transition count 20824
Discarding 6047 places :
Symmetric choice reduction at 3 with 6047 rule applications. Total rules 20345 place count 6008 transition count 14777
Iterating global reduction 3 with 6047 rules applied. Total rules applied 26392 place count 6008 transition count 14777
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 26392 place count 6008 transition count 14758
Deduced a syphon composed of 19 places in 11 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 26430 place count 5989 transition count 14758
Discarding 546 places :
Symmetric choice reduction at 3 with 546 rule applications. Total rules 26976 place count 5443 transition count 8752
Iterating global reduction 3 with 546 rules applied. Total rules applied 27522 place count 5443 transition count 8752
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27572 place count 5418 transition count 8727
Applied a total of 27572 rules in 3739 ms. Remains 5418 /19204 variables (removed 13786) and now considering 8727/27973 (removed 19246) transitions.
[2023-03-23 20:31:57] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
// Phase 1: matrix 8127 rows 5418 cols
[2023-03-23 20:31:58] [INFO ] Computed 1249 place invariants in 237 ms
[2023-03-23 20:32:04] [INFO ] Implicit Places using invariants in 6236 ms returned []
[2023-03-23 20:32:04] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2023-03-23 20:32:04] [INFO ] Invariant cache hit.
[2023-03-23 20:32:10] [INFO ] Implicit Places using invariants and state equation in 5948 ms returned []
Implicit Place search using SMT with State Equation took 12231 ms to find 0 implicit places.
[2023-03-23 20:32:10] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2023-03-23 20:32:10] [INFO ] Invariant cache hit.
[2023-03-23 20:32:15] [INFO ] Dead Transitions using invariants and state equation in 5491 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 5418/19204 places, 8727/27973 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 21478 ms. Remains : 5418/19204 places, 8727/27973 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ s2163 s1461), p1:(GT 1 s1183), p2:(GT s1250 s2822)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2389 reset in 1340 ms.
Product exploration explored 100000 steps with 2435 reset in 1275 ms.
Computed a total of 2819 stabilizing places and 3551 stable transitions
Computed a total of 2819 stabilizing places and 3551 stable transitions
Detected a total of 2819/5418 stabilizing places and 3551/8727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 14 factoid took 656 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 20:32:19] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2023-03-23 20:32:19] [INFO ] Invariant cache hit.
[2023-03-23 20:32:20] [INFO ] After 585ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 20:32:20] [INFO ] [Nat]Absence check using 49 positive place invariants in 85 ms returned sat
[2023-03-23 20:32:21] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 332 ms returned sat
[2023-03-23 20:32:21] [INFO ] After 1011ms 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 p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND p0 (NOT p1))), (F p2)]
Knowledge based reduction with 16 factoid took 719 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 5418 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5418/5418 places, 8727/8727 transitions.
Applied a total of 0 rules in 462 ms. Remains 5418 /5418 variables (removed 0) and now considering 8727/8727 (removed 0) transitions.
[2023-03-23 20:32:22] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2023-03-23 20:32:22] [INFO ] Invariant cache hit.
[2023-03-23 20:32:28] [INFO ] Implicit Places using invariants in 6019 ms returned []
[2023-03-23 20:32:28] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2023-03-23 20:32:28] [INFO ] Invariant cache hit.
[2023-03-23 20:32:34] [INFO ] Implicit Places using invariants and state equation in 5973 ms returned []
Implicit Place search using SMT with State Equation took 12037 ms to find 0 implicit places.
[2023-03-23 20:32:34] [INFO ] Flow matrix only has 8127 transitions (discarded 600 similar events)
[2023-03-23 20:32:34] [INFO ] Invariant cache hit.
[2023-03-23 20:32:40] [INFO ] Dead Transitions using invariants and state equation in 5476 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17977 ms. Remains : 5418/5418 places, 8727/8727 transitions.
Computed a total of 2819 stabilizing places and 3551 stable transitions
Computed a total of 2819 stabilizing places and 3551 stable transitions
Detected a total of 2819/5418 stabilizing places and 3551/8727 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 5 factoid took 242 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 7003 steps, including 87 resets, run visited all 2 properties in 89 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 274 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1259 reset in 1222 ms.
Product exploration explored 100000 steps with 1253 reset in 1260 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 5418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5418/5418 places, 8727/8727 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5418 transition count 8727
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 5416 transition count 8715
Deduced a syphon composed of 1 places in 5 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5416 transition count 8715
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 5416 transition count 8715
Deduced a syphon composed of 2 places in 5 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 5416 transition count 8715
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 5415 transition count 8704
Deduced a syphon composed of 2 places in 5 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 5415 transition count 8704
Deduced a syphon composed of 2 places in 5 ms
Applied a total of 8 rules in 2005 ms. Remains 5415 /5418 variables (removed 3) and now considering 8704/8727 (removed 23) transitions.
[2023-03-23 20:32:46] [INFO ] Redundant transitions in 751 ms returned []
[2023-03-23 20:32:46] [INFO ] Flow matrix only has 8104 transitions (discarded 600 similar events)
// Phase 1: matrix 8104 rows 5415 cols
[2023-03-23 20:32:46] [INFO ] Computed 1249 place invariants in 234 ms
[2023-03-23 20:32:52] [INFO ] Dead Transitions using invariants and state equation in 5998 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5415/5418 places, 8704/8727 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8760 ms. Remains : 5415/5418 places, 8704/8727 transitions.
Built C files in :
/tmp/ltsmin8109400584569659054
[2023-03-23 20:32:52] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8109400584569659054
Running compilation step : cd /tmp/ltsmin8109400584569659054;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8109400584569659054;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8109400584569659054;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 5418 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5418/5418 places, 8727/8727 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5417 transition count 8716
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5417 transition count 8716
Applied a total of 2 rules in 816 ms. Remains 5417 /5418 variables (removed 1) and now considering 8716/8727 (removed 11) transitions.
[2023-03-23 20:32:56] [INFO ] Flow matrix only has 8116 transitions (discarded 600 similar events)
// Phase 1: matrix 8116 rows 5417 cols
[2023-03-23 20:32:56] [INFO ] Computed 1249 place invariants in 226 ms
[2023-03-23 20:33:01] [INFO ] Implicit Places using invariants in 4560 ms returned []
[2023-03-23 20:33:01] [INFO ] Flow matrix only has 8116 transitions (discarded 600 similar events)
[2023-03-23 20:33:01] [INFO ] Invariant cache hit.
[2023-03-23 20:33:05] [INFO ] Implicit Places using invariants and state equation in 4096 ms returned []
Implicit Place search using SMT with State Equation took 8702 ms to find 0 implicit places.
[2023-03-23 20:33:05] [INFO ] Flow matrix only has 8116 transitions (discarded 600 similar events)
[2023-03-23 20:33:05] [INFO ] Invariant cache hit.
[2023-03-23 20:33:10] [INFO ] Dead Transitions using invariants and state equation in 5179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5417/5418 places, 8716/8727 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14713 ms. Remains : 5417/5418 places, 8716/8727 transitions.
Built C files in :
/tmp/ltsmin500206319411239158
[2023-03-23 20:33:10] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin500206319411239158
Running compilation step : cd /tmp/ltsmin500206319411239158;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin500206319411239158;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin500206319411239158;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-23 20:33:14] [INFO ] Flatten gal took : 216 ms
[2023-03-23 20:33:14] [INFO ] Flatten gal took : 223 ms
[2023-03-23 20:33:14] [INFO ] Time to serialize gal into /tmp/LTL3769901352964004909.gal : 40 ms
[2023-03-23 20:33:14] [INFO ] Time to serialize properties into /tmp/LTL11589185214215924706.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/LTL3769901352964004909.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4757803421411826634.hoa' '-atoms' '/tmp/LTL11589185214215924706.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/LTL11589185214215924706.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4757803421411826634.hoa
Detected timeout of ITS tools.
[2023-03-23 20:33:30] [INFO ] Flatten gal took : 431 ms
[2023-03-23 20:33:30] [INFO ] Flatten gal took : 211 ms
[2023-03-23 20:33:30] [INFO ] Time to serialize gal into /tmp/LTL14274433762582684369.gal : 41 ms
[2023-03-23 20:33:30] [INFO ] Time to serialize properties into /tmp/LTL1738742939103353038.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/LTL14274433762582684369.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1738742939103353038.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((X("(Node10ManageTheCrashOfNode0<=Node5HasTheLeafSetOfLx10ToReplaceNode6)"))&&((G("(Node10ManageTheCrashOfNode0>Node5HasTheLeafSe...386
Formula 0 simplified : G(X!"(Node10ManageTheCrashOfNode0<=Node5HasTheLeafSetOfLx10ToReplaceNode6)" | (F!"(Node10ManageTheCrashOfNode0>Node5HasTheLeafSetOfL...370
Detected timeout of ITS tools.
[2023-03-23 20:33:46] [INFO ] Flatten gal took : 215 ms
[2023-03-23 20:33:46] [INFO ] Applying decomposition
[2023-03-23 20:33:46] [INFO ] Flatten gal took : 225 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/graph18161405335775173461.txt' '-o' '/tmp/graph18161405335775173461.bin' '-w' '/tmp/graph18161405335775173461.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18161405335775173461.bin' '-l' '-1' '-v' '-w' '/tmp/graph18161405335775173461.weights' '-q' '0' '-e' '0.001'
[2023-03-23 20:33:46] [INFO ] Decomposing Gal with order
[2023-03-23 20:33:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 20:33:48] [INFO ] Removed a total of 7605 redundant transitions.
[2023-03-23 20:33:48] [INFO ] Flatten gal took : 952 ms
[2023-03-23 20:33:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 894 labels/synchronizations in 201 ms.
[2023-03-23 20:33:49] [INFO ] Time to serialize gal into /tmp/LTL17860745579208066724.gal : 48 ms
[2023-03-23 20:33:49] [INFO ] Time to serialize properties into /tmp/LTL1580564187824098196.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/LTL17860745579208066724.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1580564187824098196.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((X("(gu180.Node10ManageTheCrashOfNode0<=gu180.Node5HasTheLeafSetOfLx10ToReplaceNode6)"))&&((G("(gu180.Node10ManageTheCrashOfNode0...450
Formula 0 simplified : G(X!"(gu180.Node10ManageTheCrashOfNode0<=gu180.Node5HasTheLeafSetOfLx10ToReplaceNode6)" | (F!"(gu180.Node10ManageTheCrashOfNode0>gu1...434
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14344883989885783597
[2023-03-23 20:34:04] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14344883989885783597
Running compilation step : cd /tmp/ltsmin14344883989885783597;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14344883989885783597;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14344883989885783597;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-11 finished in 133549 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)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-15
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 19204 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 19204/19204 places, 27973/27973 transitions.
Drop transitions removed 6598 transitions
Trivial Post-agglo rules discarded 6598 transitions
Performed 6598 trivial Post agglomeration. Transition count delta: 6598
Iterating post reduction 0 with 6598 rules applied. Total rules applied 6598 place count 19204 transition count 21375
Reduce places removed 6598 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6600 rules applied. Total rules applied 13198 place count 12606 transition count 21373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13200 place count 12604 transition count 21373
Performed 550 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 550 Pre rules applied. Total rules applied 13200 place count 12604 transition count 20823
Deduced a syphon composed of 550 places in 17 ms
Reduce places removed 550 places and 0 transitions.
Iterating global reduction 3 with 1100 rules applied. Total rules applied 14300 place count 12054 transition count 20823
Discarding 6048 places :
Symmetric choice reduction at 3 with 6048 rule applications. Total rules 20348 place count 6006 transition count 14775
Iterating global reduction 3 with 6048 rules applied. Total rules applied 26396 place count 6006 transition count 14775
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 26396 place count 6006 transition count 14755
Deduced a syphon composed of 20 places in 10 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 26436 place count 5986 transition count 14755
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 26984 place count 5438 transition count 8727
Iterating global reduction 3 with 548 rules applied. Total rules applied 27532 place count 5438 transition count 8727
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 27582 place count 5413 transition count 8702
Applied a total of 27582 rules in 2976 ms. Remains 5413 /19204 variables (removed 13791) and now considering 8702/27973 (removed 19271) transitions.
[2023-03-23 20:34:10] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
// Phase 1: matrix 8102 rows 5413 cols
[2023-03-23 20:34:10] [INFO ] Computed 1249 place invariants in 234 ms
[2023-03-23 20:34:14] [INFO ] Implicit Places using invariants in 4266 ms returned []
[2023-03-23 20:34:14] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2023-03-23 20:34:14] [INFO ] Invariant cache hit.
[2023-03-23 20:34:18] [INFO ] Implicit Places using invariants and state equation in 4068 ms returned []
Implicit Place search using SMT with State Equation took 8361 ms to find 0 implicit places.
[2023-03-23 20:34:18] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2023-03-23 20:34:18] [INFO ] Invariant cache hit.
[2023-03-23 20:34:24] [INFO ] Dead Transitions using invariants and state equation in 5209 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 5413/19204 places, 8702/27973 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 16571 ms. Remains : 5413/19204 places, 8702/27973 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GT s3360 s3145) (GT 2 s2999)), p0:(OR (LEQ 2 s2541) (LEQ s3360 s3145))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1246 reset in 1182 ms.
Product exploration explored 100000 steps with 1244 reset in 1177 ms.
Computed a total of 2814 stabilizing places and 3526 stable transitions
Computed a total of 2814 stabilizing places and 3526 stable transitions
Detected a total of 2814/5413 stabilizing places and 3526/8702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 383 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 23180 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23180 steps, saw 11032 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 20:34:30] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2023-03-23 20:34:30] [INFO ] Invariant cache hit.
[2023-03-23 20:34:31] [INFO ] After 752ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 20:34:32] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2023-03-23 20:34:32] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 332 ms returned sat
[2023-03-23 20:34:40] [INFO ] After 7132ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-23 20:34:40] [INFO ] State equation strengthened by 3122 read => feed constraints.
[2023-03-23 20:34:42] [INFO ] After 2313ms SMT Verify possible using 3122 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-23 20:34:48] [INFO ] Deduced a trap composed of 626 places in 5941 ms of which 5 ms to minimize.
[2023-03-23 20:34:55] [INFO ] Deduced a trap composed of 1060 places in 5910 ms of which 5 ms to minimize.
[2023-03-23 20:34:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 13548 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:722)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 20:34:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:34:56] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 5413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5413/5413 places, 8702/8702 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5413 transition count 13845
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5076 transition count 13845
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 1 with 50 rules applied. Total rules applied 724 place count 5076 transition count 13845
Applied a total of 724 rules in 2244 ms. Remains 5076 /5413 variables (removed 337) and now considering 13845/8702 (removed -5143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2244 ms. Remains : 5076/5413 places, 13845/8702 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 743 ms. (steps per millisecond=13 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 19410 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19410 steps, saw 9129 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 20:35:02] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
// Phase 1: matrix 12960 rows 5076 cols
[2023-03-23 20:35:03] [INFO ] Computed 1249 place invariants in 333 ms
[2023-03-23 20:35:03] [INFO ] After 601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 20:35:04] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2023-03-23 20:35:04] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 321 ms returned sat
[2023-03-23 20:35:14] [INFO ] After 9470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 20:35:14] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-23 20:35:19] [INFO ] After 4927ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 20:35:27] [INFO ] Deduced a trap composed of 546 places in 6982 ms of which 5 ms to minimize.
[2023-03-23 20:35:35] [INFO ] Deduced a trap composed of 528 places in 7069 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 20:35:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:35:35] [INFO ] After 32075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 5076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 802 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 802 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 755 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
[2023-03-23 20:35:37] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2023-03-23 20:35:37] [INFO ] Invariant cache hit.
[2023-03-23 20:35:42] [INFO ] Implicit Places using invariants in 4782 ms returned []
Implicit Place search using SMT only with invariants took 4792 ms to find 0 implicit places.
[2023-03-23 20:35:42] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2023-03-23 20:35:42] [INFO ] Invariant cache hit.
[2023-03-23 20:35:50] [INFO ] Dead Transitions using invariants and state equation in 7815 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13370 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Graph (trivial) has 3577 edges and 5076 vertex of which 25 / 5076 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 643 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 51807 edges and 5052 vertex of which 5030 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4644 transition count 12117
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 722 rules applied. Total rules applied 967 place count 4402 transition count 11637
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 39 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 679 rules applied. Total rules applied 1646 place count 4162 transition count 11198
Ensure Unique test removed 39 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 637 rules applied. Total rules applied 2283 place count 3923 transition count 10800
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2843 place count 3723 transition count 10440
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3363 place count 3525 transition count 10118
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3813 place count 3363 transition count 9830
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4227 place count 3203 transition count 9576
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4579 place count 3075 transition count 9352
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4899 place count 2949 transition count 9158
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5165 place count 2851 transition count 8990
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5403 place count 2755 transition count 8848
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5595 place count 2683 transition count 8728
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5763 place count 2613 transition count 8630
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5893 place count 2563 transition count 8550
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6003 place count 2515 transition count 8488
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6083 place count 2483 transition count 8440
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6147 place count 2453 transition count 8406
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6189 place count 2435 transition count 8382
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6219 place count 2419 transition count 8368
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6235 place count 2411 transition count 8360
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6244 place count 2405 transition count 8357
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6248 place count 2402 transition count 8356
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 549 Pre rules applied. Total rules applied 6248 place count 2402 transition count 7807
Deduced a syphon composed of 549 places in 2 ms
Ensure Unique test removed 547 places
Reduce places removed 1096 places and 0 transitions.
Iterating global reduction 23 with 1645 rules applied. Total rules applied 7893 place count 1306 transition count 7807
Discarding 549 places :
Symmetric choice reduction at 23 with 549 rule applications. Total rules 8442 place count 757 transition count 7258
Iterating global reduction 23 with 549 rules applied. Total rules applied 8991 place count 757 transition count 7258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8991 place count 757 transition count 7257
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8993 place count 756 transition count 7257
Discarding 515 places :
Symmetric choice reduction at 23 with 515 rule applications. Total rules 9508 place count 241 transition count 1592
Iterating global reduction 23 with 515 rules applied. Total rules applied 10023 place count 241 transition count 1592
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 23 with 515 rules applied. Total rules applied 10538 place count 241 transition count 1077
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 50 rules applied. Total rules applied 10588 place count 216 transition count 1052
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10610 place count 216 transition count 1030
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10632 place count 194 transition count 1030
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10654 place count 172 transition count 788
Iterating global reduction 25 with 22 rules applied. Total rules applied 10676 place count 172 transition count 788
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10698 place count 172 transition count 766
Applied a total of 10698 rules in 8972 ms. Remains 172 /5076 variables (removed 4904) and now considering 766/13845 (removed 13079) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 766 rows 172 cols
[2023-03-23 20:35:59] [INFO ] Computed 54 place invariants in 21 ms
[2023-03-23 20:35:59] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 20:35:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-23 20:35:59] [INFO ] [Nat]Absence check using 4 positive and 50 generalized place invariants in 7 ms returned sat
[2023-03-23 20:35:59] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 20:35:59] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-23 20:35:59] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 375 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5413/5413 places, 8702/8702 transitions.
Applied a total of 0 rules in 369 ms. Remains 5413 /5413 variables (removed 0) and now considering 8702/8702 (removed 0) transitions.
[2023-03-23 20:36:00] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
// Phase 1: matrix 8102 rows 5413 cols
[2023-03-23 20:36:00] [INFO ] Computed 1249 place invariants in 259 ms
[2023-03-23 20:36:05] [INFO ] Implicit Places using invariants in 4646 ms returned []
[2023-03-23 20:36:05] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2023-03-23 20:36:05] [INFO ] Invariant cache hit.
[2023-03-23 20:36:09] [INFO ] Implicit Places using invariants and state equation in 4058 ms returned []
Implicit Place search using SMT with State Equation took 8716 ms to find 0 implicit places.
[2023-03-23 20:36:09] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2023-03-23 20:36:09] [INFO ] Invariant cache hit.
[2023-03-23 20:36:14] [INFO ] Dead Transitions using invariants and state equation in 5130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14241 ms. Remains : 5413/5413 places, 8702/8702 transitions.
Computed a total of 2814 stabilizing places and 3526 stable transitions
Computed a total of 2814 stabilizing places and 3526 stable transitions
Detected a total of 2814/5413 stabilizing places and 3526/8702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 23942 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23942 steps, saw 11377 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 20:36:18] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2023-03-23 20:36:18] [INFO ] Invariant cache hit.
[2023-03-23 20:36:18] [INFO ] After 588ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 20:36:19] [INFO ] [Nat]Absence check using 49 positive place invariants in 84 ms returned sat
[2023-03-23 20:36:19] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 360 ms returned sat
[2023-03-23 20:36:26] [INFO ] After 5969ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 20:36:26] [INFO ] State equation strengthened by 3122 read => feed constraints.
[2023-03-23 20:36:28] [INFO ] After 2773ms SMT Verify possible using 3122 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 20:36:34] [INFO ] Deduced a trap composed of 515 places in 5806 ms of which 5 ms to minimize.
[2023-03-23 20:36:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6996 ms
[2023-03-23 20:36:36] [INFO ] After 10562ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 580 ms.
[2023-03-23 20:36:37] [INFO ] After 18377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 5413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5413/5413 places, 8702/8702 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5413 transition count 13845
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5076 transition count 13845
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 1 with 50 rules applied. Total rules applied 724 place count 5076 transition count 13845
Applied a total of 724 rules in 2246 ms. Remains 5076 /5413 variables (removed 337) and now considering 13845/8702 (removed -5143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2247 ms. Remains : 5076/5413 places, 13845/8702 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 671 ms. (steps per millisecond=14 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 20094 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20094 steps, saw 9439 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 20:36:43] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
// Phase 1: matrix 12960 rows 5076 cols
[2023-03-23 20:36:43] [INFO ] Computed 1249 place invariants in 337 ms
[2023-03-23 20:36:44] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 20:36:44] [INFO ] [Nat]Absence check using 49 positive place invariants in 76 ms returned sat
[2023-03-23 20:36:45] [INFO ] [Nat]Absence check using 49 positive and 1200 generalized place invariants in 333 ms returned sat
[2023-03-23 20:36:53] [INFO ] After 8442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 20:36:53] [INFO ] State equation strengthened by 8602 read => feed constraints.
[2023-03-23 20:36:57] [INFO ] After 3702ms SMT Verify possible using 8602 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 20:37:04] [INFO ] Deduced a trap composed of 546 places in 6921 ms of which 5 ms to minimize.
[2023-03-23 20:37:13] [INFO ] Deduced a trap composed of 528 places in 6837 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 20:37:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:37:13] [INFO ] After 29012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 5076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 814 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 814 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5076/5076 places, 13845/13845 transitions.
Applied a total of 0 rules in 760 ms. Remains 5076 /5076 variables (removed 0) and now considering 13845/13845 (removed 0) transitions.
[2023-03-23 20:37:14] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2023-03-23 20:37:14] [INFO ] Invariant cache hit.
[2023-03-23 20:37:19] [INFO ] Implicit Places using invariants in 4805 ms returned []
Implicit Place search using SMT only with invariants took 4806 ms to find 0 implicit places.
[2023-03-23 20:37:19] [INFO ] Flow matrix only has 12960 transitions (discarded 885 similar events)
[2023-03-23 20:37:19] [INFO ] Invariant cache hit.
[2023-03-23 20:37:27] [INFO ] Dead Transitions using invariants and state equation in 7659 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13229 ms. Remains : 5076/5076 places, 13845/13845 transitions.
Graph (trivial) has 3577 edges and 5076 vertex of which 25 / 5076 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 643 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1485 transitions.
Graph (complete) has 51807 edges and 5052 vertex of which 5030 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t11620.t13897 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4644 transition count 12117
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 722 rules applied. Total rules applied 967 place count 4402 transition count 11637
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 39 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 679 rules applied. Total rules applied 1646 place count 4162 transition count 11198
Ensure Unique test removed 39 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 637 rules applied. Total rules applied 2283 place count 3923 transition count 10800
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2843 place count 3723 transition count 10440
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3363 place count 3525 transition count 10118
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3813 place count 3363 transition count 9830
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4227 place count 3203 transition count 9576
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4579 place count 3075 transition count 9352
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4899 place count 2949 transition count 9158
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5165 place count 2851 transition count 8990
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5403 place count 2755 transition count 8848
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5595 place count 2683 transition count 8728
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5763 place count 2613 transition count 8630
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5893 place count 2563 transition count 8550
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6003 place count 2515 transition count 8488
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6083 place count 2483 transition count 8440
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6147 place count 2453 transition count 8406
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6189 place count 2435 transition count 8382
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6219 place count 2419 transition count 8368
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6235 place count 2411 transition count 8360
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 9 rules applied. Total rules applied 6244 place count 2405 transition count 8357
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 6248 place count 2402 transition count 8356
Performed 549 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 549 Pre rules applied. Total rules applied 6248 place count 2402 transition count 7807
Deduced a syphon composed of 549 places in 2 ms
Ensure Unique test removed 547 places
Reduce places removed 1096 places and 0 transitions.
Iterating global reduction 23 with 1645 rules applied. Total rules applied 7893 place count 1306 transition count 7807
Discarding 549 places :
Symmetric choice reduction at 23 with 549 rule applications. Total rules 8442 place count 757 transition count 7258
Iterating global reduction 23 with 549 rules applied. Total rules applied 8991 place count 757 transition count 7258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8991 place count 757 transition count 7257
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8993 place count 756 transition count 7257
Discarding 515 places :
Symmetric choice reduction at 23 with 515 rule applications. Total rules 9508 place count 241 transition count 1592
Iterating global reduction 23 with 515 rules applied. Total rules applied 10023 place count 241 transition count 1592
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 23 with 515 rules applied. Total rules applied 10538 place count 241 transition count 1077
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 24 with 50 rules applied. Total rules applied 10588 place count 216 transition count 1052
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 24 with 22 rules applied. Total rules applied 10610 place count 216 transition count 1030
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 24 with 22 rules applied. Total rules applied 10632 place count 194 transition count 1030
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 10654 place count 172 transition count 788
Iterating global reduction 25 with 22 rules applied. Total rules applied 10676 place count 172 transition count 788
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10698 place count 172 transition count 766
Applied a total of 10698 rules in 8965 ms. Remains 172 /5076 variables (removed 4904) and now considering 766/13845 (removed 13079) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 766 rows 172 cols
[2023-03-23 20:37:36] [INFO ] Computed 54 place invariants in 12 ms
[2023-03-23 20:37:36] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 20:37:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-23 20:37:36] [INFO ] [Nat]Absence check using 4 positive and 50 generalized place invariants in 8 ms returned sat
[2023-03-23 20:37:36] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 20:37:36] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-23 20:37:36] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1244 reset in 1175 ms.
Product exploration explored 100000 steps with 1245 reset in 1172 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5413/5413 places, 8702/8702 transitions.
Applied a total of 0 rules in 508 ms. Remains 5413 /5413 variables (removed 0) and now considering 8702/8702 (removed 0) transitions.
[2023-03-23 20:37:41] [INFO ] Redundant transitions in 787 ms returned []
[2023-03-23 20:37:41] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
// Phase 1: matrix 8102 rows 5413 cols
[2023-03-23 20:37:41] [INFO ] Computed 1249 place invariants in 243 ms
[2023-03-23 20:37:46] [INFO ] Dead Transitions using invariants and state equation in 5423 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6754 ms. Remains : 5413/5413 places, 8702/8702 transitions.
Built C files in :
/tmp/ltsmin17722321392318237610
[2023-03-23 20:37:46] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17722321392318237610
Running compilation step : cd /tmp/ltsmin17722321392318237610;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17722321392318237610;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17722321392318237610;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 5413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5413/5413 places, 8702/8702 transitions.
Applied a total of 0 rules in 349 ms. Remains 5413 /5413 variables (removed 0) and now considering 8702/8702 (removed 0) transitions.
[2023-03-23 20:37:50] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2023-03-23 20:37:50] [INFO ] Invariant cache hit.
[2023-03-23 20:37:54] [INFO ] Implicit Places using invariants in 4079 ms returned []
[2023-03-23 20:37:54] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2023-03-23 20:37:54] [INFO ] Invariant cache hit.
[2023-03-23 20:37:58] [INFO ] Implicit Places using invariants and state equation in 4216 ms returned []
Implicit Place search using SMT with State Equation took 8321 ms to find 0 implicit places.
[2023-03-23 20:37:58] [INFO ] Flow matrix only has 8102 transitions (discarded 600 similar events)
[2023-03-23 20:37:58] [INFO ] Invariant cache hit.
[2023-03-23 20:38:03] [INFO ] Dead Transitions using invariants and state equation in 5159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13840 ms. Remains : 5413/5413 places, 8702/8702 transitions.
Built C files in :
/tmp/ltsmin16487323680384940609
[2023-03-23 20:38:03] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16487323680384940609
Running compilation step : cd /tmp/ltsmin16487323680384940609;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16487323680384940609;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16487323680384940609;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-23 20:38:07] [INFO ] Flatten gal took : 228 ms
[2023-03-23 20:38:07] [INFO ] Flatten gal took : 226 ms
[2023-03-23 20:38:07] [INFO ] Time to serialize gal into /tmp/LTL1598934429574351385.gal : 38 ms
[2023-03-23 20:38:07] [INFO ] Time to serialize properties into /tmp/LTL8293261658185458121.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/LTL1598934429574351385.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14291992692486596590.hoa' '-atoms' '/tmp/LTL8293261658185458121.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/LTL8293261658185458121.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14291992692486596590.hoa
Detected timeout of ITS tools.
[2023-03-23 20:38:23] [INFO ] Flatten gal took : 211 ms
[2023-03-23 20:38:23] [INFO ] Flatten gal took : 220 ms
[2023-03-23 20:38:23] [INFO ] Time to serialize gal into /tmp/LTL17959886034510252892.gal : 41 ms
[2023-03-23 20:38:23] [INFO ] Time to serialize properties into /tmp/LTL13404421032755234662.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/LTL17959886034510252892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13404421032755234662.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((RequestOfNode13IsSentToLx3>=2)||(Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=Node18HasAskedItsLeafSetToRx0ToReplaceNode1...323
Formula 0 simplified : XF(!"((RequestOfNode13IsSentToLx3>=2)||(Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=Node18HasAskedItsLeafSetToRx0ToReplaceNode13)...315
Detected timeout of ITS tools.
[2023-03-23 20:38:38] [INFO ] Flatten gal took : 215 ms
[2023-03-23 20:38:38] [INFO ] Applying decomposition
[2023-03-23 20:38:38] [INFO ] Flatten gal took : 222 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/graph4774157914380302115.txt' '-o' '/tmp/graph4774157914380302115.bin' '-w' '/tmp/graph4774157914380302115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4774157914380302115.bin' '-l' '-1' '-v' '-w' '/tmp/graph4774157914380302115.weights' '-q' '0' '-e' '0.001'
[2023-03-23 20:38:39] [INFO ] Decomposing Gal with order
[2023-03-23 20:38:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 20:38:40] [INFO ] Removed a total of 7218 redundant transitions.
[2023-03-23 20:38:40] [INFO ] Flatten gal took : 1163 ms
[2023-03-23 20:38:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 913 labels/synchronizations in 156 ms.
[2023-03-23 20:38:41] [INFO ] Time to serialize gal into /tmp/LTL12595440942834668464.gal : 48 ms
[2023-03-23 20:38:41] [INFO ] Time to serialize properties into /tmp/LTL1359215207567113974.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/LTL12595440942834668464.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1359215207567113974.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((gi0.gi0.gu413.RequestOfNode13IsSentToLx3>=2)||(gu233.Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=gu233.Node18HasAskedIts...375
Formula 0 simplified : XF(!"((gi0.gi0.gu413.RequestOfNode13IsSentToLx3>=2)||(gu233.Node19HasAskedItsLeafSetToRx10ToReplaceNode20<=gu233.Node18HasAskedItsLe...367
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10179433861933246955
[2023-03-23 20:38:56] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10179433861933246955
Running compilation step : cd /tmp/ltsmin10179433861933246955;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10179433861933246955;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10179433861933246955;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S24C11-LTLCardinality-15 finished in 292533 ms.
[2023-03-23 20:39:00] [INFO ] Flatten gal took : 801 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9398805052045775091
[2023-03-23 20:39:01] [INFO ] Too many transitions (27973) to apply POR reductions. Disabling POR matrices.
[2023-03-23 20:39:01] [INFO ] Built C files in 183ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9398805052045775091
Running compilation step : cd /tmp/ltsmin9398805052045775091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' '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-23 20:39:01] [INFO ] Applying decomposition
[2023-03-23 20:39:02] [INFO ] Flatten gal took : 856 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/graph11512730092364903219.txt' '-o' '/tmp/graph11512730092364903219.bin' '-w' '/tmp/graph11512730092364903219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11512730092364903219.bin' '-l' '-1' '-v' '-w' '/tmp/graph11512730092364903219.weights' '-q' '0' '-e' '0.001'
[2023-03-23 20:39:04] [INFO ] Decomposing Gal with order
[2023-03-23 20:39:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 20:39:15] [INFO ] Removed a total of 17969 redundant transitions.
[2023-03-23 20:39:15] [INFO ] Flatten gal took : 6255 ms
[2023-03-23 20:39:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 309 labels/synchronizations in 174 ms.
[2023-03-23 20:39:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality2450331180285680552.gal : 140 ms
[2023-03-23 20:39:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality17243334467393777862.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/LTLCardinality2450331180285680552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17243334467393777862.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 4 LTL properties
Checking formula 0 : !((F(G("(gu454.Node6ThinksNode10ShouldBeNodeMasterToReplaceNode11<=gu454.Node24HasAskedItsLeafSetToLx3ToReplaceNode11)"))))
Formula 0 simplified : GF!"(gu454.Node6ThinksNode10ShouldBeNodeMasterToReplaceNode11<=gu454.Node24HasAskedItsLeafSetToLx3ToReplaceNode11)"
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9398805052045775091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' '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' killed by timeout after 180 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9398805052045775091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' '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' killed by timeout after 180 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
ITS-tools command line returned an error code 137
[2023-03-23 21:00:43] [INFO ] Flatten gal took : 1550 ms
[2023-03-23 21:00:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality3991187858899270983.gal : 134 ms
[2023-03-23 21:00:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality15906890153036929281.ltl : 7 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/LTLCardinality3991187858899270983.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15906890153036929281.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 4 LTL properties
Checking formula 0 : !((F(G("(Node6ThinksNode10ShouldBeNodeMasterToReplaceNode11<=Node24HasAskedItsLeafSetToLx3ToReplaceNode11)"))))
Formula 0 simplified : GF!"(Node6ThinksNode10ShouldBeNodeMasterToReplaceNode11<=Node24HasAskedItsLeafSetToLx3ToReplaceNode11)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9522120 kB
After kill :
MemTotal: 16393216 kB
MemFree: 10993416 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="MultiCrashLeafsetExtension-PT-S24C11"
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 MultiCrashLeafsetExtension-PT-S24C11, 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 r229-tall-167856413900875"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C11.tgz
mv MultiCrashLeafsetExtension-PT-S24C11 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 ;