About the Execution of ITS-Tools for DES-PT-50a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3156.936 | 1208381.00 | 2228586.00 | 2829.90 | FTFTFFFFFFFTFFTF | 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.r101-tall-167814475400476.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 DES-PT-50a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475400476
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 97K 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 DES-PT-50a-LTLFireability-00
FORMULA_NAME DES-PT-50a-LTLFireability-01
FORMULA_NAME DES-PT-50a-LTLFireability-02
FORMULA_NAME DES-PT-50a-LTLFireability-03
FORMULA_NAME DES-PT-50a-LTLFireability-04
FORMULA_NAME DES-PT-50a-LTLFireability-05
FORMULA_NAME DES-PT-50a-LTLFireability-06
FORMULA_NAME DES-PT-50a-LTLFireability-07
FORMULA_NAME DES-PT-50a-LTLFireability-08
FORMULA_NAME DES-PT-50a-LTLFireability-09
FORMULA_NAME DES-PT-50a-LTLFireability-10
FORMULA_NAME DES-PT-50a-LTLFireability-11
FORMULA_NAME DES-PT-50a-LTLFireability-12
FORMULA_NAME DES-PT-50a-LTLFireability-13
FORMULA_NAME DES-PT-50a-LTLFireability-14
FORMULA_NAME DES-PT-50a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678276541037
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 11:55:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 11:55:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 11:55:42] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-08 11:55:42] [INFO ] Transformed 314 places.
[2023-03-08 11:55:42] [INFO ] Transformed 271 transitions.
[2023-03-08 11:55:42] [INFO ] Found NUPN structural information;
[2023-03-08 11:55:42] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-50a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 39 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 314 cols
[2023-03-08 11:55:43] [INFO ] Computed 59 place invariants in 32 ms
[2023-03-08 11:55:43] [INFO ] Implicit Places using invariants in 426 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 624 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 313/314 places, 257/257 transitions.
Applied a total of 0 rules in 11 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 674 ms. Remains : 313/314 places, 257/257 transitions.
Support contains 40 out of 313 places after structural reductions.
[2023-03-08 11:55:43] [INFO ] Flatten gal took : 53 ms
[2023-03-08 11:55:43] [INFO ] Flatten gal took : 29 ms
[2023-03-08 11:55:43] [INFO ] Input system was already deterministic with 257 transitions.
Incomplete random walk after 10000 steps, including 215 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 22) seen :7
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 257 rows 313 cols
[2023-03-08 11:55:44] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-08 11:55:44] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-08 11:55:44] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 21 ms returned sat
[2023-03-08 11:55:44] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-08 11:55:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 11:55:44] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 152 ms returned sat
[2023-03-08 11:55:55] [INFO ] After 9642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-08 11:55:58] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 4 ms to minimize.
[2023-03-08 11:55:58] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-08 11:56:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3405 ms
[2023-03-08 11:56:08] [INFO ] After 23277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 665 ms.
[2023-03-08 11:56:09] [INFO ] After 25007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 8 properties in 933 ms.
Support contains 12 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 312 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 312 transition count 254
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 312 transition count 254
Applied a total of 8 rules in 49 ms. Remains 312 /313 variables (removed 1) and now considering 254/257 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 312/313 places, 254/257 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 760502 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :{}
Probabilistic random walk after 760502 steps, saw 109118 distinct states, run finished after 3002 ms. (steps per millisecond=253 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 11:56:14] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 11:56:14] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 11:56:14] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-08 11:56:14] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 11:56:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:56:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2023-03-08 11:56:15] [INFO ] After 621ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 11:56:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 11:56:15] [INFO ] After 439ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 11:56:16] [INFO ] After 804ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-03-08 11:56:16] [INFO ] After 2143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 393 ms.
Support contains 12 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 16 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 16 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 11:56:16] [INFO ] Invariant cache hit.
[2023-03-08 11:56:16] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 11:56:16] [INFO ] Invariant cache hit.
[2023-03-08 11:56:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 11:56:17] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2023-03-08 11:56:17] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-08 11:56:17] [INFO ] Invariant cache hit.
[2023-03-08 11:56:17] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 679 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-08 11:56:17] [INFO ] Invariant cache hit.
[2023-03-08 11:56:17] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:56:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2023-03-08 11:56:17] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 11:56:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:56:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 87 ms returned sat
[2023-03-08 11:56:18] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 11:56:18] [INFO ] After 739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 259 ms.
[2023-03-08 11:56:18] [INFO ] After 1325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Computed a total of 216 stabilizing places and 211 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 8 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 11:56:19] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 11:56:19] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-08 11:56:19] [INFO ] Invariant cache hit.
[2023-03-08 11:56:19] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2023-03-08 11:56:19] [INFO ] Invariant cache hit.
[2023-03-08 11:56:19] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 698 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-50a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s182 0) (EQ s204 0)), p0:(OR (AND (EQ s301 1) (EQ s306 1)) (AND (EQ s142 1) (EQ s228 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2212 reset in 359 ms.
Product exploration explored 100000 steps with 2261 reset in 281 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 294 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 198 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 216 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 11:56:21] [INFO ] Invariant cache hit.
[2023-03-08 11:56:21] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:56:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 11:56:21] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 35 ms returned sat
[2023-03-08 11:56:21] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:56:21] [INFO ] After 276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-08 11:56:21] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 312 transition count 254
Applied a total of 7 rules in 21 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1479636 steps, run timeout after 3001 ms. (steps per millisecond=493 ) properties seen :{}
Probabilistic random walk after 1479636 steps, saw 206423 distinct states, run finished after 3004 ms. (steps per millisecond=492 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 11:56:24] [INFO ] Computed 60 place invariants in 13 ms
[2023-03-08 11:56:24] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:56:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-08 11:56:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 95 ms returned sat
[2023-03-08 11:56:25] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:56:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 11:56:25] [INFO ] After 71ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 11:56:25] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-08 11:56:25] [INFO ] After 649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 11:56:25] [INFO ] Invariant cache hit.
[2023-03-08 11:56:25] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-08 11:56:25] [INFO ] Invariant cache hit.
[2023-03-08 11:56:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 11:56:26] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2023-03-08 11:56:26] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 11:56:26] [INFO ] Invariant cache hit.
[2023-03-08 11:56:26] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 695 ms. Remains : 312/312 places, 254/254 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 19 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 11:56:26] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 11:56:26] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:56:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:56:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 96 ms returned sat
[2023-03-08 11:56:26] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:56:26] [INFO ] After 334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 11:56:26] [INFO ] After 510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 8 factoid took 317 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 112 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 11:56:27] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 11:56:27] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 11:56:27] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-08 11:56:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:56:28] [INFO ] [Real]Absence check using state equation in 1302 ms returned sat
[2023-03-08 11:56:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:56:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 11:56:29] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 142 ms returned sat
[2023-03-08 11:56:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:56:29] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2023-03-08 11:56:29] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 16 ms.
[2023-03-08 11:56:30] [INFO ] Added : 120 causal constraints over 24 iterations in 845 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 11:56:30] [INFO ] Invariant cache hit.
[2023-03-08 11:56:30] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-08 11:56:30] [INFO ] Invariant cache hit.
[2023-03-08 11:56:31] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-08 11:56:31] [INFO ] Invariant cache hit.
[2023-03-08 11:56:31] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 301 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 11:56:31] [INFO ] Invariant cache hit.
[2023-03-08 11:56:31] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:56:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 11:56:32] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 38 ms returned sat
[2023-03-08 11:56:32] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:56:32] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-08 11:56:32] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 312 transition count 254
Applied a total of 7 rules in 27 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1408564 steps, run timeout after 3001 ms. (steps per millisecond=469 ) properties seen :{}
Probabilistic random walk after 1408564 steps, saw 196823 distinct states, run finished after 3001 ms. (steps per millisecond=469 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 11:56:35] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 11:56:35] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:56:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 11:56:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 101 ms returned sat
[2023-03-08 11:56:35] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:56:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 11:56:36] [INFO ] After 71ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 11:56:36] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-08 11:56:36] [INFO ] After 621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 11:56:36] [INFO ] Invariant cache hit.
[2023-03-08 11:56:36] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-08 11:56:36] [INFO ] Invariant cache hit.
[2023-03-08 11:56:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 11:56:36] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2023-03-08 11:56:36] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 11:56:36] [INFO ] Invariant cache hit.
[2023-03-08 11:56:36] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 698 ms. Remains : 312/312 places, 254/254 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 17 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 11:56:36] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 11:56:36] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:56:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:56:37] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 95 ms returned sat
[2023-03-08 11:56:37] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:56:37] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-08 11:56:37] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 8 factoid took 385 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 117 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 11:56:38] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 11:56:38] [INFO ] [Real]Absence check using 33 positive place invariants in 20 ms returned sat
[2023-03-08 11:56:38] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-08 11:56:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:56:39] [INFO ] [Real]Absence check using state equation in 1300 ms returned sat
[2023-03-08 11:56:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:56:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 11:56:39] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 139 ms returned sat
[2023-03-08 11:56:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:56:40] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2023-03-08 11:56:40] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 24 ms.
[2023-03-08 11:56:41] [INFO ] Added : 120 causal constraints over 24 iterations in 839 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 2229 reset in 212 ms.
Product exploration explored 100000 steps with 2229 reset in 233 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Support contains 6 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 35 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 11:56:42] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 11:56:42] [INFO ] Invariant cache hit.
[2023-03-08 11:56:42] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 312/312 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin8163537572497698585
[2023-03-08 11:56:42] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8163537572497698585
Running compilation step : cd /tmp/ltsmin8163537572497698585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 503 ms.
Running link step : cd /tmp/ltsmin8163537572497698585;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8163537572497698585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1632185379425318303.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 14 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 11:56:57] [INFO ] Invariant cache hit.
[2023-03-08 11:56:57] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-08 11:56:57] [INFO ] Invariant cache hit.
[2023-03-08 11:56:58] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-03-08 11:56:58] [INFO ] Invariant cache hit.
[2023-03-08 11:56:58] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 661 ms. Remains : 312/312 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin14512472939894748528
[2023-03-08 11:56:58] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14512472939894748528
Running compilation step : cd /tmp/ltsmin14512472939894748528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 423 ms.
Running link step : cd /tmp/ltsmin14512472939894748528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14512472939894748528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15682646944771366684.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 11:57:13] [INFO ] Flatten gal took : 25 ms
[2023-03-08 11:57:13] [INFO ] Flatten gal took : 19 ms
[2023-03-08 11:57:13] [INFO ] Time to serialize gal into /tmp/LTL16398671741863184109.gal : 4 ms
[2023-03-08 11:57:13] [INFO ] Time to serialize properties into /tmp/LTL17616344864540690593.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/LTL16398671741863184109.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15527489016906902023.hoa' '-atoms' '/tmp/LTL17616344864540690593.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17616344864540690593.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15527489016906902023.hoa
Detected timeout of ITS tools.
[2023-03-08 11:57:28] [INFO ] Flatten gal took : 18 ms
[2023-03-08 11:57:28] [INFO ] Flatten gal took : 16 ms
[2023-03-08 11:57:28] [INFO ] Time to serialize gal into /tmp/LTL2021222849932059473.gal : 3 ms
[2023-03-08 11:57:28] [INFO ] Time to serialize properties into /tmp/LTL3488332710547789731.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/LTL2021222849932059473.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3488332710547789731.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((F("(((p302==1)&&(p308==1))||((p142==1)&&(p229==1)))"))&&(G("((p182==0)||(p204==0))")))))
Formula 0 simplified : X(G!"(((p302==1)&&(p308==1))||((p142==1)&&(p229==1)))" | F!"((p182==0)||(p204==0))")
Detected timeout of ITS tools.
[2023-03-08 11:57:43] [INFO ] Flatten gal took : 16 ms
[2023-03-08 11:57:43] [INFO ] Applying decomposition
[2023-03-08 11:57:43] [INFO ] Flatten gal took : 16 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/graph3630413089263330790.txt' '-o' '/tmp/graph3630413089263330790.bin' '-w' '/tmp/graph3630413089263330790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3630413089263330790.bin' '-l' '-1' '-v' '-w' '/tmp/graph3630413089263330790.weights' '-q' '0' '-e' '0.001'
[2023-03-08 11:57:43] [INFO ] Decomposing Gal with order
[2023-03-08 11:57:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 11:57:43] [INFO ] Removed a total of 57 redundant transitions.
[2023-03-08 11:57:43] [INFO ] Flatten gal took : 54 ms
[2023-03-08 11:57:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 8 ms.
[2023-03-08 11:57:43] [INFO ] Time to serialize gal into /tmp/LTL13288391763279783567.gal : 5 ms
[2023-03-08 11:57:43] [INFO ] Time to serialize properties into /tmp/LTL14734282847438966295.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/LTL13288391763279783567.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14734282847438966295.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((F("(((i10.u47.p302==1)&&(i10.u48.p308==1))||((u13.p142==1)&&(u13.p229==1)))"))&&(G("((u2.p182==0)||(u2.p204==0))")))))
Formula 0 simplified : X(G!"(((i10.u47.p302==1)&&(i10.u48.p308==1))||((u13.p142==1)&&(u13.p229==1)))" | F!"((u2.p182==0)||(u2.p204==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9563216831824053567
[2023-03-08 11:57:58] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9563216831824053567
Running compilation step : cd /tmp/ltsmin9563216831824053567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 426 ms.
Running link step : cd /tmp/ltsmin9563216831824053567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9563216831824053567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-50a-LTLFireability-00 finished in 114821 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((G(p1)||p0))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 22 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 11:58:14] [INFO ] Invariant cache hit.
[2023-03-08 11:58:14] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-08 11:58:14] [INFO ] Invariant cache hit.
[2023-03-08 11:58:14] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2023-03-08 11:58:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 11:58:14] [INFO ] Invariant cache hit.
[2023-03-08 11:58:14] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 699 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-50a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s154 1) (NEQ s204 1)), p0:(OR (NEQ s114 1) (NEQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2236 reset in 265 ms.
Product exploration explored 100000 steps with 2251 reset in 223 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 970147 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 970147 steps, saw 139233 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 11:58:18] [INFO ] Invariant cache hit.
[2023-03-08 11:58:18] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 11:58:18] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 11:58:18] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:58:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 11:58:18] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 38 ms returned sat
[2023-03-08 11:58:19] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:58:19] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-08 11:58:19] [INFO ] After 560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 84 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 312 transition count 254
Applied a total of 6 rules in 14 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 936883 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 936883 steps, saw 133147 distinct states, run finished after 3002 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 11:58:22] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-08 11:58:22] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 11:58:22] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 11:58:22] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:58:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 11:58:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 63 ms returned sat
[2023-03-08 11:58:23] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:58:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 11:58:23] [INFO ] After 115ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 11:58:23] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-08 11:58:23] [INFO ] After 796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 94 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 11:58:23] [INFO ] Invariant cache hit.
[2023-03-08 11:58:23] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-08 11:58:23] [INFO ] Invariant cache hit.
[2023-03-08 11:58:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 11:58:24] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-08 11:58:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:58:24] [INFO ] Invariant cache hit.
[2023-03-08 11:58:24] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 664 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 11:58:24] [INFO ] Invariant cache hit.
[2023-03-08 11:58:24] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 11:58:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-08 11:58:24] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:58:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:58:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 101 ms returned sat
[2023-03-08 11:58:24] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:58:25] [INFO ] After 386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-08 11:58:25] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 224 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 11:58:25] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 11:58:25] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-08 11:58:25] [INFO ] Invariant cache hit.
[2023-03-08 11:58:25] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2023-03-08 11:58:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:58:25] [INFO ] Invariant cache hit.
[2023-03-08 11:58:26] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 631 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 199 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 947860 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 947860 steps, saw 136936 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 11:58:29] [INFO ] Invariant cache hit.
[2023-03-08 11:58:29] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 11:58:29] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 11:58:29] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:58:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 11:58:29] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-08 11:58:30] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:58:30] [INFO ] After 335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-08 11:58:30] [INFO ] After 536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 99 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 312 transition count 254
Applied a total of 6 rules in 13 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1001032 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :{}
Probabilistic random walk after 1001032 steps, saw 141664 distinct states, run finished after 3001 ms. (steps per millisecond=333 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 11:58:33] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 11:58:33] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:58:33] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 11:58:33] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:58:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:58:33] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 63 ms returned sat
[2023-03-08 11:58:34] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:58:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 11:58:34] [INFO ] After 114ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 11:58:34] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-08 11:58:34] [INFO ] After 822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 122 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 11:58:34] [INFO ] Invariant cache hit.
[2023-03-08 11:58:34] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 11:58:34] [INFO ] Invariant cache hit.
[2023-03-08 11:58:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 11:58:35] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2023-03-08 11:58:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:58:35] [INFO ] Invariant cache hit.
[2023-03-08 11:58:35] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 684 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 11:58:35] [INFO ] Invariant cache hit.
[2023-03-08 11:58:35] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 11:58:35] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-08 11:58:35] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:58:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 11:58:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 107 ms returned sat
[2023-03-08 11:58:35] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:58:35] [INFO ] After 375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-08 11:58:35] [INFO ] After 634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2228 reset in 209 ms.
Product exploration explored 100000 steps with 2219 reset in 227 ms.
Built C files in :
/tmp/ltsmin2607364543763564075
[2023-03-08 11:58:36] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2023-03-08 11:58:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:58:36] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2023-03-08 11:58:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:58:36] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2023-03-08 11:58:36] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:58:36] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2607364543763564075
Running compilation step : cd /tmp/ltsmin2607364543763564075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 527 ms.
Running link step : cd /tmp/ltsmin2607364543763564075;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2607364543763564075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6806777952445819561.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 11:58:51] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 11:58:52] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-08 11:58:52] [INFO ] Invariant cache hit.
[2023-03-08 11:58:52] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2023-03-08 11:58:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:58:52] [INFO ] Invariant cache hit.
[2023-03-08 11:58:52] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 643 ms. Remains : 312/312 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin4146478257901226061
[2023-03-08 11:58:52] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2023-03-08 11:58:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:58:52] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2023-03-08 11:58:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:58:52] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2023-03-08 11:58:52] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:58:52] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4146478257901226061
Running compilation step : cd /tmp/ltsmin4146478257901226061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 520 ms.
Running link step : cd /tmp/ltsmin4146478257901226061;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4146478257901226061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12332536606363272973.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 11:59:07] [INFO ] Flatten gal took : 17 ms
[2023-03-08 11:59:07] [INFO ] Flatten gal took : 15 ms
[2023-03-08 11:59:07] [INFO ] Time to serialize gal into /tmp/LTL2881979697356379307.gal : 2 ms
[2023-03-08 11:59:07] [INFO ] Time to serialize properties into /tmp/LTL9273837815061012804.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/LTL2881979697356379307.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5607299652722507942.hoa' '-atoms' '/tmp/LTL9273837815061012804.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/LTL9273837815061012804.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5607299652722507942.hoa
Detected timeout of ITS tools.
[2023-03-08 11:59:22] [INFO ] Flatten gal took : 14 ms
[2023-03-08 11:59:22] [INFO ] Flatten gal took : 13 ms
[2023-03-08 11:59:22] [INFO ] Time to serialize gal into /tmp/LTL16006725996238353039.gal : 2 ms
[2023-03-08 11:59:22] [INFO ] Time to serialize properties into /tmp/LTL11032958281277751276.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/LTL16006725996238353039.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11032958281277751276.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p114!=1)||(p229!=1))")||(G("((p154!=1)||(p204!=1))"))))))
Formula 0 simplified : G(F!"((p154!=1)||(p204!=1))" & FG!"((p114!=1)||(p229!=1))")
Detected timeout of ITS tools.
[2023-03-08 11:59:37] [INFO ] Flatten gal took : 15 ms
[2023-03-08 11:59:37] [INFO ] Applying decomposition
[2023-03-08 11:59:37] [INFO ] Flatten gal took : 11 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/graph7427073330421744223.txt' '-o' '/tmp/graph7427073330421744223.bin' '-w' '/tmp/graph7427073330421744223.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7427073330421744223.bin' '-l' '-1' '-v' '-w' '/tmp/graph7427073330421744223.weights' '-q' '0' '-e' '0.001'
[2023-03-08 11:59:38] [INFO ] Decomposing Gal with order
[2023-03-08 11:59:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 11:59:38] [INFO ] Removed a total of 54 redundant transitions.
[2023-03-08 11:59:38] [INFO ] Flatten gal took : 21 ms
[2023-03-08 11:59:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 4 ms.
[2023-03-08 11:59:38] [INFO ] Time to serialize gal into /tmp/LTL16428688285452580289.gal : 4 ms
[2023-03-08 11:59:38] [INFO ] Time to serialize properties into /tmp/LTL2878500080335623858.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/LTL16428688285452580289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2878500080335623858.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u12.p114!=1)||(u12.p229!=1))")||(G("((u2.p154!=1)||(u2.p204!=1))"))))))
Formula 0 simplified : G(F!"((u2.p154!=1)||(u2.p204!=1))" & FG!"((u12.p114!=1)||(u12.p229!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13815601980004877899
[2023-03-08 11:59:53] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13815601980004877899
Running compilation step : cd /tmp/ltsmin13815601980004877899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 433 ms.
Running link step : cd /tmp/ltsmin13815601980004877899;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13815601980004877899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-50a-LTLFireability-01 finished in 114228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p0)))))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 10 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 12:00:08] [INFO ] Invariant cache hit.
[2023-03-08 12:00:08] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-08 12:00:08] [INFO ] Invariant cache hit.
[2023-03-08 12:00:08] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-08 12:00:08] [INFO ] Invariant cache hit.
[2023-03-08 12:00:08] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 627 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s127 1) (EQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-02 finished in 774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 18 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 12:00:09] [INFO ] Invariant cache hit.
[2023-03-08 12:00:09] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-08 12:00:09] [INFO ] Invariant cache hit.
[2023-03-08 12:00:09] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2023-03-08 12:00:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:00:09] [INFO ] Invariant cache hit.
[2023-03-08 12:00:09] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 664 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s81 1) (EQ s307 1)), p1:(AND (EQ s28 1) (EQ s231 1) (EQ s233 1))], 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 34 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-05 finished in 764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(!p1) U p2)))'
Support contains 7 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 13 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 12:00:09] [INFO ] Invariant cache hit.
[2023-03-08 12:00:09] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 12:00:09] [INFO ] Invariant cache hit.
[2023-03-08 12:00:10] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-08 12:00:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:00:10] [INFO ] Invariant cache hit.
[2023-03-08 12:00:10] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 618 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), p1, (NOT p2)]
Running random walk in product with property : DES-PT-50a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s69 1) (EQ s307 1)), p1:(OR (AND (EQ s13 1) (EQ s231 1) (EQ s233 1)) (AND (EQ s110 1) (EQ s228 1))), p0:(AND (EQ s110 1) (EQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-07 finished in 804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 6 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2023-03-08 12:00:10] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 12:00:10] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-08 12:00:10] [INFO ] Invariant cache hit.
[2023-03-08 12:00:11] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
[2023-03-08 12:00:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:00:11] [INFO ] Invariant cache hit.
[2023-03-08 12:00:11] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1325 ms. Remains : 313/313 places, 257/257 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : DES-PT-50a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s236 1) (EQ s305 1))) (NOT (AND (EQ s73 1) (EQ s308 1)))), p0:(AND (EQ s189 1) (EQ s204 1)), p1:(AND (EQ s73 1) (EQ s308 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2193 reset in 211 ms.
Product exploration explored 100000 steps with 2226 reset in 230 ms.
Computed a total of 216 stabilizing places and 211 stable transitions
Computed a total of 216 stabilizing places and 211 stable transitions
Detected a total of 216/313 stabilizing places and 211/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 220 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:00:12] [INFO ] Invariant cache hit.
[2023-03-08 12:00:12] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:00:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:00:13] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 96 ms returned sat
[2023-03-08 12:00:18] [INFO ] After 5464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:00:18] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2023-03-08 12:00:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-03-08 12:00:18] [INFO ] After 5709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-08 12:00:18] [INFO ] After 6038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 312 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 312 transition count 254
Applied a total of 9 rules in 16 ms. Remains 312 /313 variables (removed 1) and now considering 254/257 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 312/313 places, 254/257 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1355052 steps, run timeout after 3001 ms. (steps per millisecond=451 ) properties seen :{}
Probabilistic random walk after 1355052 steps, saw 189491 distinct states, run finished after 3003 ms. (steps per millisecond=451 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 12:00:21] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 12:00:22] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:00:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 12:00:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 56 ms returned sat
[2023-03-08 12:00:22] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:00:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 12:00:22] [INFO ] After 54ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:00:22] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-08 12:00:22] [INFO ] After 725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 12:00:22] [INFO ] Invariant cache hit.
[2023-03-08 12:00:22] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-08 12:00:22] [INFO ] Invariant cache hit.
[2023-03-08 12:00:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 12:00:23] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2023-03-08 12:00:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:00:23] [INFO ] Invariant cache hit.
[2023-03-08 12:00:23] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 649 ms. Remains : 312/312 places, 254/254 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 12:00:23] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 12:00:23] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:00:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 12:00:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 54 ms returned sat
[2023-03-08 12:00:23] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:00:24] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-08 12:00:24] [INFO ] After 550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 7 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2023-03-08 12:00:24] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 12:00:24] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-08 12:00:24] [INFO ] Invariant cache hit.
[2023-03-08 12:00:25] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
[2023-03-08 12:00:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:00:25] [INFO ] Invariant cache hit.
[2023-03-08 12:00:25] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1333 ms. Remains : 313/313 places, 257/257 transitions.
Computed a total of 216 stabilizing places and 211 stable transitions
Computed a total of 216 stabilizing places and 211 stable transitions
Detected a total of 216/313 stabilizing places and 211/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:00:26] [INFO ] Invariant cache hit.
[2023-03-08 12:00:26] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:00:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:00:26] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 88 ms returned sat
[2023-03-08 12:00:31] [INFO ] After 5468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:00:32] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2023-03-08 12:00:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-08 12:00:32] [INFO ] After 5701ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-08 12:00:32] [INFO ] After 6032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 312 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 312 transition count 254
Applied a total of 9 rules in 14 ms. Remains 312 /313 variables (removed 1) and now considering 254/257 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 312/313 places, 254/257 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1394839 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :{}
Probabilistic random walk after 1394839 steps, saw 194759 distinct states, run finished after 3002 ms. (steps per millisecond=464 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 12:00:35] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 12:00:35] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:00:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 12:00:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 56 ms returned sat
[2023-03-08 12:00:35] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:00:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 12:00:36] [INFO ] After 54ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:00:36] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-08 12:00:36] [INFO ] After 724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 12:00:36] [INFO ] Invariant cache hit.
[2023-03-08 12:00:36] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 12:00:36] [INFO ] Invariant cache hit.
[2023-03-08 12:00:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 12:00:36] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2023-03-08 12:00:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:00:36] [INFO ] Invariant cache hit.
[2023-03-08 12:00:36] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 681 ms. Remains : 312/312 places, 254/254 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 14 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 12:00:36] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 12:00:36] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:00:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 12:00:37] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 55 ms returned sat
[2023-03-08 12:00:37] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:00:37] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-08 12:00:37] [INFO ] After 574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 2221 reset in 232 ms.
Product exploration explored 100000 steps with 2203 reset in 248 ms.
Built C files in :
/tmp/ltsmin16803094648220082650
[2023-03-08 12:00:38] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2023-03-08 12:00:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:00:38] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2023-03-08 12:00:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:00:38] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2023-03-08 12:00:38] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:00:38] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16803094648220082650
Running compilation step : cd /tmp/ltsmin16803094648220082650;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 561 ms.
Running link step : cd /tmp/ltsmin16803094648220082650;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16803094648220082650;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16851234453663064173.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 13 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2023-03-08 12:00:53] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 12:00:53] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-08 12:00:53] [INFO ] Invariant cache hit.
[2023-03-08 12:00:54] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
[2023-03-08 12:00:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:00:54] [INFO ] Invariant cache hit.
[2023-03-08 12:00:54] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1363 ms. Remains : 313/313 places, 257/257 transitions.
Built C files in :
/tmp/ltsmin16235100315820286427
[2023-03-08 12:00:54] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2023-03-08 12:00:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:00:54] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2023-03-08 12:00:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:00:54] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2023-03-08 12:00:54] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:00:54] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16235100315820286427
Running compilation step : cd /tmp/ltsmin16235100315820286427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 538 ms.
Running link step : cd /tmp/ltsmin16235100315820286427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16235100315820286427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10299951588671548359.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 12:01:10] [INFO ] Flatten gal took : 11 ms
[2023-03-08 12:01:10] [INFO ] Flatten gal took : 11 ms
[2023-03-08 12:01:10] [INFO ] Time to serialize gal into /tmp/LTL11302501293727164767.gal : 2 ms
[2023-03-08 12:01:10] [INFO ] Time to serialize properties into /tmp/LTL16478832131368735159.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/LTL11302501293727164767.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17539500623753439324.hoa' '-atoms' '/tmp/LTL16478832131368735159.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16478832131368735159.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17539500623753439324.hoa
Detected timeout of ITS tools.
[2023-03-08 12:01:25] [INFO ] Flatten gal took : 10 ms
[2023-03-08 12:01:25] [INFO ] Flatten gal took : 12 ms
[2023-03-08 12:01:25] [INFO ] Time to serialize gal into /tmp/LTL15907619660370981294.gal : 3 ms
[2023-03-08 12:01:25] [INFO ] Time to serialize properties into /tmp/LTL5192578647268325616.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/LTL15907619660370981294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5192578647268325616.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(((!("((p73==1)&&(p309==1))"))U(("((!((p237==1)&&(p306==1)))&&(!((p73==1)&&(p309==1))))")||(G(!("((p73==1)&&(p309==1))")))))||("...183
Formula 0 simplified : FG(!"((p189==1)&&(p204==1))" & ("((p73==1)&&(p309==1))" M !"((!((p237==1)&&(p306==1)))&&(!((p73==1)&&(p309==1))))"))
Detected timeout of ITS tools.
[2023-03-08 12:01:40] [INFO ] Flatten gal took : 13 ms
[2023-03-08 12:01:40] [INFO ] Applying decomposition
[2023-03-08 12:01:40] [INFO ] Flatten gal took : 11 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/graph3477980746430839927.txt' '-o' '/tmp/graph3477980746430839927.bin' '-w' '/tmp/graph3477980746430839927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3477980746430839927.bin' '-l' '-1' '-v' '-w' '/tmp/graph3477980746430839927.weights' '-q' '0' '-e' '0.001'
[2023-03-08 12:01:40] [INFO ] Decomposing Gal with order
[2023-03-08 12:01:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:01:40] [INFO ] Removed a total of 54 redundant transitions.
[2023-03-08 12:01:40] [INFO ] Flatten gal took : 18 ms
[2023-03-08 12:01:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 3 ms.
[2023-03-08 12:01:40] [INFO ] Time to serialize gal into /tmp/LTL9451511068955478981.gal : 3 ms
[2023-03-08 12:01:40] [INFO ] Time to serialize properties into /tmp/LTL12141470405756602862.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/LTL9451511068955478981.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12141470405756602862.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(((!("((u48.p73==1)&&(u48.p309==1))"))U(("((!((i12.u16.p237==1)&&(i12.u47.p306==1)))&&(!((u48.p73==1)&&(u48.p309==1))))")||(G(!(...229
Formula 0 simplified : FG(!"((u2.p189==1)&&(u2.p204==1))" & ("((u48.p73==1)&&(u48.p309==1))" M !"((!((i12.u16.p237==1)&&(i12.u47.p306==1)))&&(!((u48.p73==1...177
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13534199585426696629
[2023-03-08 12:01:55] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13534199585426696629
Running compilation step : cd /tmp/ltsmin13534199585426696629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 452 ms.
Running link step : cd /tmp/ltsmin13534199585426696629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13534199585426696629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))||(LTLAPp2==true))))' '--buchi-type=spotba'
LTSmin run took 2894 ms.
FORMULA DES-PT-50a-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50a-LTLFireability-08 finished in 108104 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 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 16 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 12:01:58] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 12:01:58] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-08 12:01:58] [INFO ] Invariant cache hit.
[2023-03-08 12:01:59] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2023-03-08 12:01:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:01:59] [INFO ] Invariant cache hit.
[2023-03-08 12:01:59] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 628 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-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:(OR (NEQ s144 1) (NEQ s228 1))], 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 2222 reset in 204 ms.
Product exploration explored 100000 steps with 2202 reset in 221 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 168 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 42 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 215 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1465344 steps, run timeout after 3001 ms. (steps per millisecond=488 ) properties seen :{}
Probabilistic random walk after 1465344 steps, saw 205011 distinct states, run finished after 3002 ms. (steps per millisecond=488 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:02:03] [INFO ] Invariant cache hit.
[2023-03-08 12:02:03] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:02:03] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 21 ms returned sat
[2023-03-08 12:02:03] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:02:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:02:03] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-08 12:02:03] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:03] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-08 12:02:03] [INFO ] After 335ms 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 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 312 transition count 254
Applied a total of 7 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1430116 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :{}
Probabilistic random walk after 1430116 steps, saw 199647 distinct states, run finished after 3001 ms. (steps per millisecond=476 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 12:02:06] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 12:02:06] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:02:06] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 12:02:06] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:02:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 12:02:06] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 80 ms returned sat
[2023-03-08 12:02:07] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 12:02:07] [INFO ] After 33ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:07] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-08 12:02:07] [INFO ] After 574ms 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 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 12:02:07] [INFO ] Invariant cache hit.
[2023-03-08 12:02:07] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-08 12:02:07] [INFO ] Invariant cache hit.
[2023-03-08 12:02:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 12:02:07] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2023-03-08 12:02:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 12:02:07] [INFO ] Invariant cache hit.
[2023-03-08 12:02:08] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 730 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 12:02:08] [INFO ] Invariant cache hit.
[2023-03-08 12:02:08] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 12:02:08] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 12:02:08] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:02:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:02:08] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 99 ms returned sat
[2023-03-08 12:02:08] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:08] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 12:02:08] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 12:02:08] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 12:02:08] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-08 12:02:08] [INFO ] Invariant cache hit.
[2023-03-08 12:02:09] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-08 12:02:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:02:09] [INFO ] Invariant cache hit.
[2023-03-08 12:02:09] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 604 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 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 216 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1470679 steps, run timeout after 3001 ms. (steps per millisecond=490 ) properties seen :{}
Probabilistic random walk after 1470679 steps, saw 205683 distinct states, run finished after 3001 ms. (steps per millisecond=490 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:02:12] [INFO ] Invariant cache hit.
[2023-03-08 12:02:12] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:02:12] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 12:02:12] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:02:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:02:12] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 44 ms returned sat
[2023-03-08 12:02:13] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:13] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-08 12:02:13] [INFO ] After 328ms 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 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 312 transition count 254
Applied a total of 7 rules in 14 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1439868 steps, run timeout after 3001 ms. (steps per millisecond=479 ) properties seen :{}
Probabilistic random walk after 1439868 steps, saw 200978 distinct states, run finished after 3001 ms. (steps per millisecond=479 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 12:02:16] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 12:02:16] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 12:02:16] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 12:02:16] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:02:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:02:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 82 ms returned sat
[2023-03-08 12:02:16] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 12:02:16] [INFO ] After 34ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:16] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-08 12:02:16] [INFO ] After 583ms 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 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 12:02:16] [INFO ] Invariant cache hit.
[2023-03-08 12:02:17] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-08 12:02:17] [INFO ] Invariant cache hit.
[2023-03-08 12:02:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 12:02:17] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2023-03-08 12:02:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 12:02:17] [INFO ] Invariant cache hit.
[2023-03-08 12:02:17] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 751 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 12:02:17] [INFO ] Invariant cache hit.
[2023-03-08 12:02:17] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:02:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 12:02:17] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:02:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 12:02:17] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 100 ms returned sat
[2023-03-08 12:02:18] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:18] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-08 12:02:18] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2221 reset in 205 ms.
Product exploration explored 100000 steps with 2237 reset in 223 ms.
Built C files in :
/tmp/ltsmin6073648956390831968
[2023-03-08 12:02:18] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2023-03-08 12:02:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:02:18] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2023-03-08 12:02:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:02:18] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2023-03-08 12:02:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:02:18] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6073648956390831968
Running compilation step : cd /tmp/ltsmin6073648956390831968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 534 ms.
Running link step : cd /tmp/ltsmin6073648956390831968;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6073648956390831968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5297497703193916967.hoa' '--buchi-type=spotba'
LTSmin run took 11077 ms.
FORMULA DES-PT-50a-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50a-LTLFireability-09 finished in 31811 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))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 9 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 12:02:30] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 12:02:30] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-08 12:02:30] [INFO ] Invariant cache hit.
[2023-03-08 12:02:31] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2023-03-08 12:02:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:02:31] [INFO ] Invariant cache hit.
[2023-03-08 12:02:31] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 674 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s215 1) (AND (EQ s81 1) (EQ s307 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 74 steps with 1 reset in 0 ms.
FORMULA DES-PT-50a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-10 finished in 721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 8 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 12:02:31] [INFO ] Invariant cache hit.
[2023-03-08 12:02:31] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-08 12:02:31] [INFO ] Invariant cache hit.
[2023-03-08 12:02:31] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2023-03-08 12:02:31] [INFO ] Invariant cache hit.
[2023-03-08 12:02:31] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 635 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s50 1) (EQ s307 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 558 ms.
Product exploration explored 100000 steps with 50000 reset in 521 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50a-LTLFireability-11 finished in 1920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 5 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 12:02:33] [INFO ] Invariant cache hit.
[2023-03-08 12:02:33] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 12:02:33] [INFO ] Invariant cache hit.
[2023-03-08 12:02:33] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-08 12:02:33] [INFO ] Invariant cache hit.
[2023-03-08 12:02:33] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 595 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s121 1) (NEQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2222 reset in 221 ms.
Product exploration explored 100000 steps with 2209 reset in 234 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 216 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1540037 steps, run timeout after 3001 ms. (steps per millisecond=513 ) properties seen :{}
Probabilistic random walk after 1540037 steps, saw 214009 distinct states, run finished after 3001 ms. (steps per millisecond=513 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:02:37] [INFO ] Invariant cache hit.
[2023-03-08 12:02:37] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:02:37] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 12:02:37] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:02:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 12:02:37] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-08 12:02:38] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:38] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2023-03-08 12:02:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-08 12:02:38] [INFO ] After 306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-08 12:02:38] [INFO ] After 428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 312 transition count 254
Applied a total of 7 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1493052 steps, run timeout after 3001 ms. (steps per millisecond=497 ) properties seen :{}
Probabilistic random walk after 1493052 steps, saw 208213 distinct states, run finished after 3001 ms. (steps per millisecond=497 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 12:02:41] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 12:02:41] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:02:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 12:02:41] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:02:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 12:02:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 81 ms returned sat
[2023-03-08 12:02:41] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 12:02:41] [INFO ] After 44ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:42] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-08 12:02:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-08 12:02:42] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-08 12:02:42] [INFO ] After 664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 12:02:42] [INFO ] Invariant cache hit.
[2023-03-08 12:02:42] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-08 12:02:42] [INFO ] Invariant cache hit.
[2023-03-08 12:02:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 12:02:42] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2023-03-08 12:02:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:02:42] [INFO ] Invariant cache hit.
[2023-03-08 12:02:42] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 788 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 13 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 12:02:42] [INFO ] Invariant cache hit.
[2023-03-08 12:02:42] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:02:42] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 12:02:42] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:02:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 12:02:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 109 ms returned sat
[2023-03-08 12:02:43] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:43] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-08 12:02:43] [INFO ] After 402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 12:02:43] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 12:02:43] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-08 12:02:43] [INFO ] Invariant cache hit.
[2023-03-08 12:02:44] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-08 12:02:44] [INFO ] Invariant cache hit.
[2023-03-08 12:02:44] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 617 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 234 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1535654 steps, run timeout after 3001 ms. (steps per millisecond=511 ) properties seen :{}
Probabilistic random walk after 1535654 steps, saw 213536 distinct states, run finished after 3001 ms. (steps per millisecond=511 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:02:47] [INFO ] Invariant cache hit.
[2023-03-08 12:02:47] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:02:47] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 12:02:47] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:02:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:02:47] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-08 12:02:48] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:48] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 3 ms to minimize.
[2023-03-08 12:02:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-08 12:02:48] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 12:02:48] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 312 transition count 254
Applied a total of 7 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1515704 steps, run timeout after 3001 ms. (steps per millisecond=505 ) properties seen :{}
Probabilistic random walk after 1515704 steps, saw 211955 distinct states, run finished after 3001 ms. (steps per millisecond=505 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 12:02:51] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-08 12:02:51] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 12:02:51] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 12:02:51] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:02:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 12:02:51] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 82 ms returned sat
[2023-03-08 12:02:51] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 12:02:51] [INFO ] After 41ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:52] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-08 12:02:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-08 12:02:52] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-08 12:02:52] [INFO ] After 676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 12:02:52] [INFO ] Invariant cache hit.
[2023-03-08 12:02:52] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-08 12:02:52] [INFO ] Invariant cache hit.
[2023-03-08 12:02:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 12:02:52] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2023-03-08 12:02:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:02:52] [INFO ] Invariant cache hit.
[2023-03-08 12:02:52] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 771 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 12:02:52] [INFO ] Invariant cache hit.
[2023-03-08 12:02:52] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 12:02:52] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 12:02:52] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:02:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 12:02:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 101 ms returned sat
[2023-03-08 12:02:53] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:02:53] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-08 12:02:53] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2220 reset in 206 ms.
Product exploration explored 100000 steps with 2267 reset in 218 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 12:02:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 12:02:54] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 12:02:54] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 312/312 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin9032044861766497565
[2023-03-08 12:02:54] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9032044861766497565
Running compilation step : cd /tmp/ltsmin9032044861766497565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 421 ms.
Running link step : cd /tmp/ltsmin9032044861766497565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9032044861766497565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2436503494491298111.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 12:03:09] [INFO ] Invariant cache hit.
[2023-03-08 12:03:09] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-08 12:03:09] [INFO ] Invariant cache hit.
[2023-03-08 12:03:10] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-03-08 12:03:10] [INFO ] Invariant cache hit.
[2023-03-08 12:03:10] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 662 ms. Remains : 312/312 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin17305881572256084099
[2023-03-08 12:03:10] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17305881572256084099
Running compilation step : cd /tmp/ltsmin17305881572256084099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 448 ms.
Running link step : cd /tmp/ltsmin17305881572256084099;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17305881572256084099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9704680159544788395.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 12:03:25] [INFO ] Flatten gal took : 15 ms
[2023-03-08 12:03:25] [INFO ] Flatten gal took : 10 ms
[2023-03-08 12:03:25] [INFO ] Time to serialize gal into /tmp/LTL6857505558828744440.gal : 2 ms
[2023-03-08 12:03:25] [INFO ] Time to serialize properties into /tmp/LTL18050585826685546062.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/LTL6857505558828744440.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16263423200879595853.hoa' '-atoms' '/tmp/LTL18050585826685546062.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/LTL18050585826685546062.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16263423200879595853.hoa
Detected timeout of ITS tools.
[2023-03-08 12:03:40] [INFO ] Flatten gal took : 10 ms
[2023-03-08 12:03:40] [INFO ] Flatten gal took : 10 ms
[2023-03-08 12:03:40] [INFO ] Time to serialize gal into /tmp/LTL7351673953486347773.gal : 2 ms
[2023-03-08 12:03:40] [INFO ] Time to serialize properties into /tmp/LTL7270972473717179810.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/LTL7351673953486347773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7270972473717179810.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("((p121!=1)||(p229!=1))"))))
Formula 0 simplified : XF!"((p121!=1)||(p229!=1))"
Detected timeout of ITS tools.
[2023-03-08 12:03:55] [INFO ] Flatten gal took : 15 ms
[2023-03-08 12:03:55] [INFO ] Applying decomposition
[2023-03-08 12:03:55] [INFO ] Flatten gal took : 9 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/graph9859708387938192470.txt' '-o' '/tmp/graph9859708387938192470.bin' '-w' '/tmp/graph9859708387938192470.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9859708387938192470.bin' '-l' '-1' '-v' '-w' '/tmp/graph9859708387938192470.weights' '-q' '0' '-e' '0.001'
[2023-03-08 12:03:55] [INFO ] Decomposing Gal with order
[2023-03-08 12:03:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:03:55] [INFO ] Removed a total of 59 redundant transitions.
[2023-03-08 12:03:55] [INFO ] Flatten gal took : 16 ms
[2023-03-08 12:03:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 2 ms.
[2023-03-08 12:03:55] [INFO ] Time to serialize gal into /tmp/LTL14332153229525181638.gal : 2 ms
[2023-03-08 12:03:55] [INFO ] Time to serialize properties into /tmp/LTL7131171121018332499.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/LTL14332153229525181638.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7131171121018332499.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("((u13.p121!=1)||(u13.p229!=1))"))))
Formula 0 simplified : XF!"((u13.p121!=1)||(u13.p229!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8893601891492490743
[2023-03-08 12:04:10] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8893601891492490743
Running compilation step : cd /tmp/ltsmin8893601891492490743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 433 ms.
Running link step : cd /tmp/ltsmin8893601891492490743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8893601891492490743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-50a-LTLFireability-12 finished in 112711 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(G(p0))&&(!p1 U (p2||G(!p1))))))'
Support contains 13 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 15 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 12:04:25] [INFO ] Invariant cache hit.
[2023-03-08 12:04:26] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-08 12:04:26] [INFO ] Invariant cache hit.
[2023-03-08 12:04:26] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-08 12:04:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:04:26] [INFO ] Invariant cache hit.
[2023-03-08 12:04:26] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 637 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : DES-PT-50a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p2 (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s294 1) (EQ s308 1))) (NOT (AND (EQ s238 1) (EQ s255 1)))), p1:(AND (EQ s238 1) (EQ s255 1)), p0:(OR (EQ s234 0) (EQ s239 0) (EQ s24...], nbAcceptance=2, 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 2226 reset in 306 ms.
Product exploration explored 100000 steps with 2242 reset in 305 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (OR p2 (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 624 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:04:28] [INFO ] Invariant cache hit.
[2023-03-08 12:04:28] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:04:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:04:28] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 87 ms returned sat
[2023-03-08 12:04:28] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (OR p2 (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 16 factoid took 708 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Support contains 13 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 12:04:29] [INFO ] Invariant cache hit.
[2023-03-08 12:04:29] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-08 12:04:29] [INFO ] Invariant cache hit.
[2023-03-08 12:04:29] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2023-03-08 12:04:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:04:29] [INFO ] Invariant cache hit.
[2023-03-08 12:04:29] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 670 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (OR (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 425 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Finished random walk after 1162 steps, including 26 resets, run visited all 5 properties in 18 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (OR (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 11 factoid took 505 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 2226 reset in 237 ms.
Product exploration explored 100000 steps with 2232 reset in 259 ms.
Built C files in :
/tmp/ltsmin4770710125312316733
[2023-03-08 12:04:31] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2023-03-08 12:04:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:04:31] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2023-03-08 12:04:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:04:31] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2023-03-08 12:04:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:04:31] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4770710125312316733
Running compilation step : cd /tmp/ltsmin4770710125312316733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 568 ms.
Running link step : cd /tmp/ltsmin4770710125312316733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4770710125312316733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5639019110959743634.hoa' '--buchi-type=spotba'
LTSmin run took 1448 ms.
FORMULA DES-PT-50a-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50a-LTLFireability-13 finished in 8134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0&&X((!p0 U (!p1||G(!p0))))))))'
Support contains 9 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 8 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 12:04:33] [INFO ] Invariant cache hit.
[2023-03-08 12:04:34] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 12:04:34] [INFO ] Invariant cache hit.
[2023-03-08 12:04:34] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2023-03-08 12:04:34] [INFO ] Invariant cache hit.
[2023-03-08 12:04:34] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 605 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 112 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : DES-PT-50a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s194 1) (EQ s204 1) (EQ s144 1) (EQ s228 1)), p1:(OR (AND (EQ s3 1) (EQ s231 1) (EQ s233 1)) (AND (EQ s73 1) (EQ s307 1)) (AND (EQ s144 1) (EQ...], nbAcceptance=1, 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 407 ms.
Product exploration explored 100000 steps with 33333 reset in 419 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (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) (NOT p1))
Knowledge based reduction with 6 factoid took 180 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50a-LTLFireability-14 finished in 1744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&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' '!(G(F((G(p1)||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' '!(X(G(p0)))'
Found a Lengthening insensitive property : DES-PT-50a-LTLFireability-12
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 28 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 12:04:36] [INFO ] Invariant cache hit.
[2023-03-08 12:04:36] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-08 12:04:36] [INFO ] Invariant cache hit.
[2023-03-08 12:04:36] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2023-03-08 12:04:36] [INFO ] Invariant cache hit.
[2023-03-08 12:04:36] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 663 ms. Remains : 312/313 places, 256/257 transitions.
Running random walk in product with property : DES-PT-50a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s121 1) (NEQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2215 reset in 210 ms.
Product exploration explored 100000 steps with 2248 reset in 236 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1438001 steps, run timeout after 3001 ms. (steps per millisecond=479 ) properties seen :{}
Probabilistic random walk after 1438001 steps, saw 201421 distinct states, run finished after 3001 ms. (steps per millisecond=479 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:04:40] [INFO ] Invariant cache hit.
[2023-03-08 12:04:40] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:04:40] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 12:04:40] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:04:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:04:40] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-08 12:04:40] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:04:41] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2023-03-08 12:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-08 12:04:41] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-08 12:04:41] [INFO ] After 425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 312 transition count 254
Applied a total of 7 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1403131 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :{}
Probabilistic random walk after 1403131 steps, saw 196052 distinct states, run finished after 3001 ms. (steps per millisecond=467 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 12:04:44] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 12:04:44] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:04:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 12:04:44] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:04:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:04:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 81 ms returned sat
[2023-03-08 12:04:44] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:04:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 12:04:44] [INFO ] After 40ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:04:44] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2023-03-08 12:04:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-08 12:04:44] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-08 12:04:44] [INFO ] After 665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 12:04:44] [INFO ] Invariant cache hit.
[2023-03-08 12:04:45] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-08 12:04:45] [INFO ] Invariant cache hit.
[2023-03-08 12:04:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 12:04:45] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2023-03-08 12:04:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:04:45] [INFO ] Invariant cache hit.
[2023-03-08 12:04:45] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 766 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 12:04:45] [INFO ] Invariant cache hit.
[2023-03-08 12:04:45] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:04:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 12:04:45] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:04:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:04:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 99 ms returned sat
[2023-03-08 12:04:46] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:04:46] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-08 12:04:46] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 163 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 12:04:46] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 12:04:46] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-08 12:04:46] [INFO ] Invariant cache hit.
[2023-03-08 12:04:47] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2023-03-08 12:04:47] [INFO ] Invariant cache hit.
[2023-03-08 12:04:47] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 616 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1506666 steps, run timeout after 3001 ms. (steps per millisecond=502 ) properties seen :{}
Probabilistic random walk after 1506666 steps, saw 209790 distinct states, run finished after 3002 ms. (steps per millisecond=501 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:04:50] [INFO ] Invariant cache hit.
[2023-03-08 12:04:50] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:04:50] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 12:04:50] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:04:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:04:50] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-08 12:04:50] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:04:51] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2023-03-08 12:04:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-08 12:04:51] [INFO ] After 283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-08 12:04:51] [INFO ] After 394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 312 transition count 254
Applied a total of 7 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1407637 steps, run timeout after 3001 ms. (steps per millisecond=469 ) properties seen :{}
Probabilistic random walk after 1407637 steps, saw 196686 distinct states, run finished after 3001 ms. (steps per millisecond=469 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 12:04:54] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 12:04:54] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 12:04:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2023-03-08 12:04:54] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:04:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 12:04:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 83 ms returned sat
[2023-03-08 12:04:54] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:04:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 12:04:54] [INFO ] After 39ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:04:54] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-08 12:04:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-08 12:04:54] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-08 12:04:54] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 7 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 12:04:54] [INFO ] Invariant cache hit.
[2023-03-08 12:04:55] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-08 12:04:55] [INFO ] Invariant cache hit.
[2023-03-08 12:04:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 12:04:55] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-08 12:04:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:04:55] [INFO ] Invariant cache hit.
[2023-03-08 12:04:55] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 758 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 12:04:55] [INFO ] Invariant cache hit.
[2023-03-08 12:04:55] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:04:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 12:04:55] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:04:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 12:04:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 106 ms returned sat
[2023-03-08 12:04:56] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:04:56] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-08 12:04:56] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2254 reset in 223 ms.
Product exploration explored 100000 steps with 2248 reset in 228 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 12:04:57] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 12:04:57] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 12:04:57] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 312/312 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin7410765044033891910
[2023-03-08 12:04:57] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7410765044033891910
Running compilation step : cd /tmp/ltsmin7410765044033891910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 416 ms.
Running link step : cd /tmp/ltsmin7410765044033891910;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7410765044033891910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13476829659978373449.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 12:05:12] [INFO ] Invariant cache hit.
[2023-03-08 12:05:12] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-08 12:05:12] [INFO ] Invariant cache hit.
[2023-03-08 12:05:12] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-08 12:05:12] [INFO ] Invariant cache hit.
[2023-03-08 12:05:13] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 624 ms. Remains : 312/312 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin3578547896736438083
[2023-03-08 12:05:13] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3578547896736438083
Running compilation step : cd /tmp/ltsmin3578547896736438083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 444 ms.
Running link step : cd /tmp/ltsmin3578547896736438083;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3578547896736438083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4423822811125927000.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 12:05:28] [INFO ] Flatten gal took : 12 ms
[2023-03-08 12:05:28] [INFO ] Flatten gal took : 9 ms
[2023-03-08 12:05:28] [INFO ] Time to serialize gal into /tmp/LTL1212530180389986186.gal : 2 ms
[2023-03-08 12:05:28] [INFO ] Time to serialize properties into /tmp/LTL5098248920693934211.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/LTL1212530180389986186.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9853202169120684515.hoa' '-atoms' '/tmp/LTL5098248920693934211.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/LTL5098248920693934211.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9853202169120684515.hoa
Detected timeout of ITS tools.
[2023-03-08 12:05:43] [INFO ] Flatten gal took : 9 ms
[2023-03-08 12:05:43] [INFO ] Flatten gal took : 9 ms
[2023-03-08 12:05:43] [INFO ] Time to serialize gal into /tmp/LTL15587332304321577978.gal : 2 ms
[2023-03-08 12:05:43] [INFO ] Time to serialize properties into /tmp/LTL15234276163640208116.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/LTL15587332304321577978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15234276163640208116.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("((p121!=1)||(p229!=1))"))))
Formula 0 simplified : XF!"((p121!=1)||(p229!=1))"
Detected timeout of ITS tools.
[2023-03-08 12:05:58] [INFO ] Flatten gal took : 14 ms
[2023-03-08 12:05:58] [INFO ] Applying decomposition
[2023-03-08 12:05:58] [INFO ] Flatten gal took : 9 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/graph12812851400290852766.txt' '-o' '/tmp/graph12812851400290852766.bin' '-w' '/tmp/graph12812851400290852766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12812851400290852766.bin' '-l' '-1' '-v' '-w' '/tmp/graph12812851400290852766.weights' '-q' '0' '-e' '0.001'
[2023-03-08 12:05:58] [INFO ] Decomposing Gal with order
[2023-03-08 12:05:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:05:58] [INFO ] Removed a total of 14 redundant transitions.
[2023-03-08 12:05:58] [INFO ] Flatten gal took : 23 ms
[2023-03-08 12:05:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-08 12:05:58] [INFO ] Time to serialize gal into /tmp/LTL9480951206235465639.gal : 2 ms
[2023-03-08 12:05:58] [INFO ] Time to serialize properties into /tmp/LTL6896032602578795158.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/LTL9480951206235465639.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6896032602578795158.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G("((u12.p121!=1)||(u12.p229!=1))"))))
Formula 0 simplified : XF!"((u12.p121!=1)||(u12.p229!=1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t216, t217, t250, u2.t8, u2.t110, u2.t114, u2.t115, u2.t116, u2.t117, u2.t118, u2.t119, u...749
Computing Next relation with stutter on 5.75047e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6030047836646761808
[2023-03-08 12:06:13] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6030047836646761808
Running compilation step : cd /tmp/ltsmin6030047836646761808;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 434 ms.
Running link step : cd /tmp/ltsmin6030047836646761808;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6030047836646761808;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-50a-LTLFireability-12 finished in 112670 ms.
[2023-03-08 12:06:28] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3625952571734045363
[2023-03-08 12:06:28] [INFO ] Applying decomposition
[2023-03-08 12:06:28] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2023-03-08 12:06:28] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:06:28] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2023-03-08 12:06:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:06:28] [INFO ] Flatten gal took : 8 ms
[2023-03-08 12:06:28] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2023-03-08 12:06:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:06:28] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3625952571734045363
Running compilation step : cd /tmp/ltsmin3625952571734045363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' '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'
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/graph13236652883537305251.txt' '-o' '/tmp/graph13236652883537305251.bin' '-w' '/tmp/graph13236652883537305251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13236652883537305251.bin' '-l' '-1' '-v' '-w' '/tmp/graph13236652883537305251.weights' '-q' '0' '-e' '0.001'
[2023-03-08 12:06:28] [INFO ] Decomposing Gal with order
[2023-03-08 12:06:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:06:28] [INFO ] Removed a total of 13 redundant transitions.
[2023-03-08 12:06:28] [INFO ] Flatten gal took : 32 ms
[2023-03-08 12:06:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 1 ms.
[2023-03-08 12:06:28] [INFO ] Time to serialize gal into /tmp/LTLFireability17273549072803762379.gal : 20 ms
[2023-03-08 12:06:28] [INFO ] Time to serialize properties into /tmp/LTLFireability15432112551761256219.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/LTLFireability17273549072803762379.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15432112551761256219.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((X((F("(((i12.u43.p302==1)&&(i12.u44.p308==1))||((u12.p142==1)&&(u12.p229==1)))"))&&(G("((u2.p182==0)||(u2.p204==0))")))))
Formula 0 simplified : X(G!"(((i12.u43.p302==1)&&(i12.u44.p308==1))||((u12.p142==1)&&(u12.p229==1)))" | F!"((u2.p182==0)||(u2.p204==0))")
Compilation finished in 529 ms.
Running link step : cd /tmp/ltsmin3625952571734045363;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin3625952571734045363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t216, t217, t250, u2.t8, u2.t110, u2.t114, u2.t115, u2.t116, u2.t117, u2.t118, u2.t119, u...756
Computing Next relation with stutter on 6.30884e+06 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: LTL layer: formula: X((<>((LTLAPp0==true))&&[]((LTLAPp1==true))))
pins2lts-mc-linux64( 0/ 8), 0.008: "X((<>((LTLAPp0==true))&&[]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.008: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: buchi has 4 states
pins2lts-mc-linux64( 0/ 8), 0.043: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.138: DFS-FIFO for weak LTL, using special progress label 263
pins2lts-mc-linux64( 0/ 8), 0.138: There are 264 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.138: State length is 314, there are 264 groups
pins2lts-mc-linux64( 0/ 8), 0.138: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.138: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.138: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.138: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.199: ~26 levels ~960 states ~3440 transitions
pins2lts-mc-linux64( 1/ 8), 0.283: ~25 levels ~1920 states ~7328 transitions
pins2lts-mc-linux64( 2/ 8), 0.371: ~26 levels ~3840 states ~16752 transitions
pins2lts-mc-linux64( 2/ 8), 0.629: ~26 levels ~7680 states ~35288 transitions
pins2lts-mc-linux64( 2/ 8), 1.073: ~52 levels ~15360 states ~72720 transitions
pins2lts-mc-linux64( 2/ 8), 1.494: ~52 levels ~30720 states ~170000 transitions
pins2lts-mc-linux64( 2/ 8), 2.085: ~52 levels ~61440 states ~385416 transitions
pins2lts-mc-linux64( 5/ 8), 3.246: ~49 levels ~122880 states ~825408 transitions
pins2lts-mc-linux64( 7/ 8), 5.365: ~50 levels ~245760 states ~1787248 transitions
pins2lts-mc-linux64( 2/ 8), 8.049: ~52 levels ~491520 states ~3824088 transitions
pins2lts-mc-linux64( 1/ 8), 14.152: ~53 levels ~983040 states ~8153896 transitions
pins2lts-mc-linux64( 7/ 8), 25.134: ~53 levels ~1966080 states ~16116424 transitions
pins2lts-mc-linux64( 7/ 8), 46.138: ~53 levels ~3932160 states ~32771528 transitions
pins2lts-mc-linux64( 7/ 8), 88.549: ~53 levels ~7864320 states ~67877584 transitions
pins2lts-mc-linux64( 3/ 8), 106.083: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 106.185:
pins2lts-mc-linux64( 0/ 8), 106.185: mean standard work distribution: 3.9% (states) 3.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 106.185:
pins2lts-mc-linux64( 0/ 8), 106.185: Explored 8558906 states 79313736 transitions, fanout: 9.267
pins2lts-mc-linux64( 0/ 8), 106.185: Total exploration time 106.010 sec (105.940 sec minimum, 105.973 sec on average)
pins2lts-mc-linux64( 0/ 8), 106.185: States per second: 80737, Transitions per second: 748172
pins2lts-mc-linux64( 0/ 8), 106.185:
pins2lts-mc-linux64( 0/ 8), 106.185: Progress states detected: 9712787
pins2lts-mc-linux64( 0/ 8), 106.185: Redundant explorations: -53.1500
pins2lts-mc-linux64( 0/ 8), 106.185:
pins2lts-mc-linux64( 0/ 8), 106.185: Queue width: 8B, total height: 9713489, memory: 74.11MB
pins2lts-mc-linux64( 0/ 8), 106.185: Tree memory: 395.4MB, 22.7 B/state, compr.: 1.8%
pins2lts-mc-linux64( 0/ 8), 106.185: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 106.185: Stored 258 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 106.185: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 106.185: Est. total memory use: 469.5MB (~1098.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3625952571734045363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3625952571734045363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
56 unique states visited
56 strongly connected components in search stack
57 transitions explored
56 items max in DFS search stack
12014 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,120.181,2202560,1,0,5.01843e+06,234135,785,5.16757e+06,1729,1.53e+06,461950
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DES-PT-50a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(("((u12.p114!=1)||(u12.p229!=1))")||(G("((u2.p154!=1)||(u2.p204!=1))"))))))
Formula 1 simplified : G(F!"((u2.p154!=1)||(u2.p204!=1))" & FG!"((u12.p114!=1)||(u12.p229!=1))")
Computing Next relation with stutter on 6.30884e+06 deadlock states
60 unique states visited
0 strongly connected components in search stack
118 transitions explored
60 items max in DFS search stack
3614 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,156.323,2202748,1,0,5.01843e+06,234135,961,5.16757e+06,2216,1.53e+06,2098394
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DES-PT-50a-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G("((u12.p121!=1)||(u12.p229!=1))"))))
Formula 2 simplified : XF!"((u12.p121!=1)||(u12.p229!=1))"
Computing Next relation with stutter on 6.30884e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
33396 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,490.288,2690448,1,0,6.57974e+06,234135,773,6.49444e+06,1727,1.53e+06,3185495
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DES-PT-50a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1206005 ms.
BK_STOP 1678277749418
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-50a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DES-PT-50a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814475400476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;