About the Execution of 2023-gold for ResIsolation-PT-N09P1
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16163.896 | 3428708.00 | 5001698.00 | 26718.90 | FTFFFFTFTFTFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r649-smll-171774451500028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ResIsolation-PT-N09P1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r649-smll-171774451500028
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.6M
-rw-r--r-- 1 mcc users 9.6K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 9.1M Jun 7 06:26 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 ResIsolation-PT-N09P1-LTLFireability-00
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-01
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-02
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-03
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-04
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-05
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-06
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-07
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-08
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-09
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-10
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-11
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-12
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-13
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-14
FORMULA_NAME ResIsolation-PT-N09P1-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717771601042
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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResIsolation-PT-N09P1
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-07 14:46:44] [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]
[2024-06-07 14:46:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 14:46:45] [INFO ] Load time of PNML (sax parser for PT used): 1083 ms
[2024-06-07 14:46:45] [INFO ] Transformed 299 places.
[2024-06-07 14:46:45] [INFO ] Transformed 9484 transitions.
[2024-06-07 14:46:45] [INFO ] Found NUPN structural information;
[2024-06-07 14:46:45] [INFO ] Parsed PT model containing 299 places and 9484 transitions and 184865 arcs in 1380 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ResIsolation-PT-N09P1-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 9484/9484 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 289 transition count 9484
Discarding 167 places :
Symmetric choice reduction at 1 with 167 rule applications. Total rules 177 place count 122 transition count 9317
Iterating global reduction 1 with 167 rules applied. Total rules applied 344 place count 122 transition count 9317
Ensure Unique test removed 1285 transitions
Reduce isomorphic transitions removed 1285 transitions.
Iterating post reduction 1 with 1285 rules applied. Total rules applied 1629 place count 122 transition count 8032
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1647 place count 104 transition count 8014
Iterating global reduction 2 with 18 rules applied. Total rules applied 1665 place count 104 transition count 8014
Applied a total of 1665 rules in 428 ms. Remains 104 /299 variables (removed 195) and now considering 8014/9484 (removed 1470) transitions.
// Phase 1: matrix 8014 rows 104 cols
[2024-06-07 14:46:47] [INFO ] Computed 0 invariants in 304 ms
[2024-06-07 14:46:47] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-06-07 14:46:47] [INFO ] Invariant cache hit.
[2024-06-07 14:46:49] [INFO ] Implicit Places using invariants and state equation in 1762 ms returned []
Implicit Place search using SMT with State Equation took 2334 ms to find 0 implicit places.
[2024-06-07 14:46:49] [INFO ] Invariant cache hit.
[2024-06-07 14:46:53] [INFO ] Dead Transitions using invariants and state equation in 4209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/299 places, 8014/9484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6979 ms. Remains : 104/299 places, 8014/9484 transitions.
Support contains 44 out of 104 places after structural reductions.
[2024-06-07 14:46:55] [INFO ] Flatten gal took : 1941 ms
[2024-06-07 14:46:57] [INFO ] Flatten gal took : 1468 ms
[2024-06-07 14:47:00] [INFO ] Input system was already deterministic with 8014 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 968 ms. (steps per millisecond=10 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Interrupted probabilistic random walk after 104769 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104769 steps, saw 30375 distinct states, run finished after 3005 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 38 properties.
[2024-06-07 14:47:04] [INFO ] Invariant cache hit.
[2024-06-07 14:47:06] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:38
[2024-06-07 14:47:20] [INFO ] After 13763ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :36
[2024-06-07 14:47:31] [INFO ] After 24616ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :36
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-06-07 14:47:31] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :36
Fused 38 Parikh solutions to 28 different solutions.
Parikh walk visited 21 properties in 30955 ms.
Support contains 40 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Graph (complete) has 840 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.90 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 102 transition count 7986
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 43 place count 86 transition count 7986
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 97 place count 59 transition count 7959
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 59 transition count 7956
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 103 place count 56 transition count 7956
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 56 transition count 7955
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 55 transition count 7954
Applied a total of 105 rules in 3918 ms. Remains 55 /104 variables (removed 49) and now considering 7954/8014 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3921 ms. Remains : 55/104 places, 7954/8014 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1457 ms. (steps per millisecond=6 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 7954 rows 55 cols
[2024-06-07 14:48:08] [INFO ] Computed 10 invariants in 57 ms
[2024-06-07 14:48:08] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-06-07 14:48:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-07 14:48:15] [INFO ] After 6345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-06-07 14:48:21] [INFO ] After 13081ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 3791 ms.
[2024-06-07 14:48:25] [INFO ] After 17024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 9 properties in 192 ms.
Support contains 25 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 7954/7954 transitions.
Graph (trivial) has 4 edges and 55 vertex of which 2 / 55 are part of one of the 1 SCC in 9 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 53 transition count 7951
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 53 transition count 7951
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 258 place count 53 transition count 7696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 259 place count 53 transition count 7695
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 261 place count 53 transition count 7693
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1024 transitions
Reduce isomorphic transitions removed 1024 transitions.
Iterating post reduction 1 with 1026 rules applied. Total rules applied 1287 place count 51 transition count 6669
Applied a total of 1287 rules in 9989 ms. Remains 51 /55 variables (removed 4) and now considering 6669/7954 (removed 1285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9989 ms. Remains : 51/55 places, 6669/7954 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1097 ms. (steps per millisecond=9 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 107232 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107232 steps, saw 17675 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6669 rows 51 cols
[2024-06-07 14:48:40] [INFO ] Computed 10 invariants in 43 ms
[2024-06-07 14:48:40] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-07 14:48:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-07 14:48:43] [INFO ] After 2961ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-07 14:48:44] [INFO ] After 3951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 578 ms.
[2024-06-07 14:48:44] [INFO ] After 4584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=3 )
Parikh walk visited 4 properties in 22 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 35 stabilizing places and 45 stable transitions
Graph (complete) has 840 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.198 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((G(p2)||p1))))'
Support contains 17 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Graph (complete) has 840 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.182 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 101 transition count 8004
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 94 transition count 8004
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 15 place count 94 transition count 7994
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 35 place count 84 transition count 7994
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 82 transition count 7481
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 82 transition count 7481
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 2 with 257 rules applied. Total rules applied 296 place count 82 transition count 7224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 296 place count 82 transition count 7223
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 298 place count 81 transition count 7223
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 299 place count 80 transition count 6711
Iterating global reduction 3 with 1 rules applied. Total rules applied 300 place count 80 transition count 6711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 301 place count 80 transition count 6710
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 301 place count 80 transition count 6709
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 303 place count 79 transition count 6709
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 337 place count 62 transition count 6692
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 343 place count 59 transition count 6700
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 344 place count 59 transition count 6699
Applied a total of 344 rules in 2549 ms. Remains 59 /104 variables (removed 45) and now considering 6699/8014 (removed 1315) transitions.
// Phase 1: matrix 6699 rows 59 cols
[2024-06-07 14:48:48] [INFO ] Computed 0 invariants in 57 ms
[2024-06-07 14:48:48] [INFO ] Implicit Places using invariants in 782 ms returned []
[2024-06-07 14:48:49] [INFO ] Invariant cache hit.
[2024-06-07 14:48:50] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1795 ms to find 0 implicit places.
[2024-06-07 14:49:15] [INFO ] Redundant transitions in 25808 ms returned []
[2024-06-07 14:49:15] [INFO ] Invariant cache hit.
[2024-06-07 14:49:19] [INFO ] Dead Transitions using invariants and state equation in 3370 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/104 places, 6699/8014 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33537 ms. Remains : 59/104 places, 6699/8014 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s7 0) (EQ s12 0) (EQ s17 0) (EQ s22 0) (EQ s28 0) (EQ s34 0) (EQ s40 0) (EQ s46 0) (EQ s52 0) (EQ s58 0)), p0:(OR (EQ s7 0) (EQ s12 0) (EQ s17 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 3859 ms.
Product exploration explored 100000 steps with 0 reset in 3680 ms.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p2))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 194 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 874 ms. (steps per millisecond=11 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 189347 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{0=1, 3=1, 4=1}
Probabilistic random walk after 189347 steps, saw 27490 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :3
Running SMT prover for 4 properties.
[2024-06-07 14:49:32] [INFO ] Invariant cache hit.
[2024-06-07 14:49:32] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-07 14:49:35] [INFO ] After 2703ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2024-06-07 14:49:35] [INFO ] After 3117ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 188 ms.
[2024-06-07 14:49:35] [INFO ] After 3349ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 6 ms.
Support contains 10 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 6699/6699 transitions.
Graph (trivial) has 20 edges and 59 vertex of which 12 / 59 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 53 transition count 6680
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 52 transition count 6680
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 13 place count 47 transition count 6675
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 47 transition count 6674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 46 transition count 6674
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 45 transition count 6673
Applied a total of 16 rules in 22524 ms. Remains 45 /59 variables (removed 14) and now considering 6673/6699 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22530 ms. Remains : 45/59 places, 6673/6699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1151 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
Finished probabilistic random walk after 42586 steps, run visited all 1 properties in 1730 ms. (steps per millisecond=24 )
Probabilistic random walk after 42586 steps, saw 11668 distinct states, run finished after 1733 ms. (steps per millisecond=24 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p2))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p2 (NOT p1))), (F (NOT p2)), (F (NOT p1)), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p2) (NOT p0) (NOT p1)))
Knowledge based reduction with 18 factoid took 499 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N09P1-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N09P1-LTLFireability-00 finished in 76439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 14 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Graph (trivial) has 59 edges and 104 vertex of which 9 / 104 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 831 edges and 98 vertex of which 96 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.45 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 95 transition count 7998
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 88 transition count 7998
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 88 transition count 7988
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 78 transition count 7988
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 76 transition count 6964
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 76 transition count 6964
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 76 transition count 6962
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 42 place count 76 transition count 6960
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 46 place count 74 transition count 6960
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 76 place count 59 transition count 6945
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 332 place count 59 transition count 6689
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 338 place count 56 transition count 6697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 339 place count 56 transition count 6696
Applied a total of 339 rules in 11056 ms. Remains 56 /104 variables (removed 48) and now considering 6696/8014 (removed 1318) transitions.
[2024-06-07 14:50:13] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
// Phase 1: matrix 6694 rows 56 cols
[2024-06-07 14:50:13] [INFO ] Computed 0 invariants in 40 ms
[2024-06-07 14:50:13] [INFO ] Implicit Places using invariants in 890 ms returned []
[2024-06-07 14:50:14] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 14:50:14] [INFO ] Invariant cache hit.
[2024-06-07 14:50:15] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
[2024-06-07 14:50:39] [INFO ] Redundant transitions in 24095 ms returned []
[2024-06-07 14:50:39] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 14:50:39] [INFO ] Invariant cache hit.
[2024-06-07 14:50:44] [INFO ] Dead Transitions using invariants and state equation in 4886 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/104 places, 6696/8014 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42128 ms. Remains : 56/104 places, 6696/8014 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s10 0) (EQ s17 0) (EQ s20 0) (EQ s27 0) (EQ s33 0) (EQ s37 0) (EQ s43 0) (EQ s50 0) (EQ s54 0)), p1:(OR (EQ s7 0) (EQ s12 0) (EQ s17 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 3005 ms.
Product exploration explored 100000 steps with 0 reset in 3642 ms.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 838 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 168187 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 168187 steps, saw 25432 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 2 properties.
[2024-06-07 14:50:55] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 14:50:55] [INFO ] Invariant cache hit.
[2024-06-07 14:50:55] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 14:50:58] [INFO ] After 2639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 14:51:01] [INFO ] State equation strengthened by 5819 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-07 14:51:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 14:51:20] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 15 ms.
Support contains 14 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 6696/6696 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 56 transition count 6687
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 19 place count 51 transition count 6682
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 51 transition count 6681
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 50 transition count 6681
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 49 transition count 6680
Applied a total of 22 rules in 15426 ms. Remains 49 /56 variables (removed 7) and now considering 6680/6696 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15428 ms. Remains : 49/56 places, 6680/6696 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 640 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 106961 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106961 steps, saw 21155 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6680 rows 49 cols
[2024-06-07 14:51:40] [INFO ] Computed 6 invariants in 67 ms
[2024-06-07 14:51:40] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 14:51:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-07 14:51:42] [INFO ] After 2443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 14:51:44] [INFO ] State equation strengthened by 4986 read => feed constraints.
[2024-06-07 14:52:01] [INFO ] After 17436ms SMT Verify possible using 4986 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-07 14:52:02] [INFO ] After 18475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 577 ms.
[2024-06-07 14:52:03] [INFO ] After 23074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=3 )
Parikh walk visited 2 properties in 16 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 14 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 6696/6696 transitions.
Applied a total of 0 rules in 5195 ms. Remains 56 /56 variables (removed 0) and now considering 6696/6696 (removed 0) transitions.
[2024-06-07 14:52:09] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
// Phase 1: matrix 6694 rows 56 cols
[2024-06-07 14:52:09] [INFO ] Computed 0 invariants in 65 ms
[2024-06-07 14:52:10] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2024-06-07 14:52:10] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 14:52:10] [INFO ] Invariant cache hit.
[2024-06-07 14:52:11] [INFO ] Implicit Places using invariants and state equation in 1293 ms returned []
Implicit Place search using SMT with State Equation took 2400 ms to find 0 implicit places.
[2024-06-07 14:52:39] [INFO ] Redundant transitions in 27699 ms returned []
[2024-06-07 14:52:39] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 14:52:39] [INFO ] Invariant cache hit.
[2024-06-07 14:52:42] [INFO ] Dead Transitions using invariants and state equation in 3760 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39065 ms. Remains : 56/56 places, 6696/6696 transitions.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 652 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 167587 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167587 steps, saw 25327 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 2 properties.
[2024-06-07 14:52:47] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 14:52:47] [INFO ] Invariant cache hit.
[2024-06-07 14:52:47] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 14:52:50] [INFO ] After 2600ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 14:52:53] [INFO ] State equation strengthened by 5819 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-07 14:53:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 14:53:12] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 15 ms.
Support contains 14 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 6696/6696 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 56 transition count 6687
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 19 place count 51 transition count 6682
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 51 transition count 6681
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 50 transition count 6681
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 49 transition count 6680
Applied a total of 22 rules in 16047 ms. Remains 49 /56 variables (removed 7) and now considering 6680/6696 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16050 ms. Remains : 49/56 places, 6680/6696 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 907 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 81162 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81162 steps, saw 16827 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6680 rows 49 cols
[2024-06-07 14:53:32] [INFO ] Computed 6 invariants in 67 ms
[2024-06-07 14:53:32] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 14:53:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-07 14:53:35] [INFO ] After 2618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 14:53:37] [INFO ] State equation strengthened by 4986 read => feed constraints.
[2024-06-07 14:53:51] [INFO ] After 13998ms SMT Verify possible using 4986 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-07 14:53:52] [INFO ] After 15009ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 560 ms.
[2024-06-07 14:53:52] [INFO ] After 19974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=3 )
Parikh walk visited 2 properties in 12 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 2915 ms.
Product exploration explored 100000 steps with 0 reset in 3108 ms.
Built C files in :
/tmp/ltsmin7264086501114201505
[2024-06-07 14:53:59] [INFO ] Too many transitions (6696) to apply POR reductions. Disabling POR matrices.
[2024-06-07 14:53:59] [INFO ] Built C files in 228ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7264086501114201505
Running compilation step : cd /tmp/ltsmin7264086501114201505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7264086501114201505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7264086501114201505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 14 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 6696/6696 transitions.
Applied a total of 0 rules in 5810 ms. Remains 56 /56 variables (removed 0) and now considering 6696/6696 (removed 0) transitions.
[2024-06-07 14:54:08] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
// Phase 1: matrix 6694 rows 56 cols
[2024-06-07 14:54:08] [INFO ] Computed 0 invariants in 40 ms
[2024-06-07 14:54:09] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-06-07 14:54:09] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 14:54:09] [INFO ] Invariant cache hit.
[2024-06-07 14:54:10] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
[2024-06-07 14:54:37] [INFO ] Redundant transitions in 26735 ms returned []
[2024-06-07 14:54:37] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 14:54:37] [INFO ] Invariant cache hit.
[2024-06-07 14:54:41] [INFO ] Dead Transitions using invariants and state equation in 3873 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38440 ms. Remains : 56/56 places, 6696/6696 transitions.
Built C files in :
/tmp/ltsmin14175633256246808800
[2024-06-07 14:54:41] [INFO ] Too many transitions (6696) to apply POR reductions. Disabling POR matrices.
[2024-06-07 14:54:41] [INFO ] Built C files in 206ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14175633256246808800
Running compilation step : cd /tmp/ltsmin14175633256246808800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14175633256246808800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14175633256246808800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 14:54:47] [INFO ] Flatten gal took : 1329 ms
[2024-06-07 14:54:48] [INFO ] Flatten gal took : 974 ms
[2024-06-07 14:54:48] [INFO ] Time to serialize gal into /tmp/LTL16352464082502288125.gal : 209 ms
[2024-06-07 14:54:48] [INFO ] Time to serialize properties into /tmp/LTL15577226520091369202.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16352464082502288125.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10856921234003192112.hoa' '-atoms' '/tmp/LTL15577226520091369202.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15577226520091369202.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10856921234003192112.hoa
Detected timeout of ITS tools.
[2024-06-07 14:55:05] [INFO ] Flatten gal took : 1154 ms
[2024-06-07 14:55:06] [INFO ] Flatten gal took : 1046 ms
[2024-06-07 14:55:06] [INFO ] Time to serialize gal into /tmp/LTL852753531583186417.gal : 118 ms
[2024-06-07 14:55:06] [INFO ] Time to serialize properties into /tmp/LTL16693263949702432351.ltl : 3 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL852753531583186417.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16693263949702432351.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((p27==0)||(p64==0))||((p96==0)||(p120==0)))||(((p152==0)||(p180==0))||((p204==0)||(p232==0))))||((p264==0)||(p288==0)))")...291
Formula 0 simplified : F(G!"(((((p27==0)||(p64==0))||((p96==0)||(p120==0)))||(((p152==0)||(p180==0))||((p204==0)||(p232==0))))||((p264==0)||(p288==0)))" | ...283
Detected timeout of ITS tools.
[2024-06-07 14:55:22] [INFO ] Flatten gal took : 1005 ms
[2024-06-07 14:55:22] [INFO ] Applying decomposition
[2024-06-07 14:55:23] [INFO ] Flatten gal took : 997 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14747498346255634229.txt' '-o' '/tmp/graph14747498346255634229.bin' '-w' '/tmp/graph14747498346255634229.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14747498346255634229.bin' '-l' '-1' '-v' '-w' '/tmp/graph14747498346255634229.weights' '-q' '0' '-e' '0.001'
[2024-06-07 14:55:26] [INFO ] Decomposing Gal with order
[2024-06-07 14:55:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 14:55:29] [INFO ] Removed a total of 59742 redundant transitions.
[2024-06-07 14:55:29] [INFO ] Flatten gal took : 2505 ms
[2024-06-07 14:55:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 544 ms.
[2024-06-07 14:55:31] [INFO ] Time to serialize gal into /tmp/LTL11318836744657598483.gal : 51 ms
[2024-06-07 14:55:31] [INFO ] Time to serialize properties into /tmp/LTL14731189955981830066.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11318836744657598483.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14731189955981830066.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((u6.p27==0)||(i3.u4.p64==0))||((i1.u2.p96==0)||(i1.u3.p120==0)))||(((i3.u4.p152==0)||(i3.u5.p180==0))||((i1.u8.p204==0)||...405
Formula 0 simplified : F(G!"(((((u6.p27==0)||(i3.u4.p64==0))||((i1.u2.p96==0)||(i1.u3.p120==0)))||(((i3.u4.p152==0)||(i3.u5.p180==0))||((i1.u8.p204==0)||(i...397
Reverse transition relation is NOT exact ! Due to transitions t13_t15, t31_t33_t8006, t25_t27_t8010, t19_t21_t8005, t7_t9_t8004, t6_t12_t18_t24_t30_t36_t43...1474
Computing Next relation with stutter on 2 deadlock states
11 unique states visited
0 strongly connected components in search stack
27 transitions explored
10 items max in DFS search stack
306 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,4.34694,56232,1,0,43834,6776,50281,63131,788,45875,214604
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResIsolation-PT-N09P1-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ResIsolation-PT-N09P1-LTLFireability-01 finished in 333479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((G(p1)&&(X(!p2) U ((!p2&&X(!p2))||X(G(!p2)))))))))'
Support contains 18 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 102 transition count 7501
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 7501
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 261 place count 102 transition count 7244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 262 place count 101 transition count 6732
Iterating global reduction 1 with 1 rules applied. Total rules applied 263 place count 101 transition count 6732
Applied a total of 263 rules in 122 ms. Remains 101 /104 variables (removed 3) and now considering 6732/8014 (removed 1282) transitions.
// Phase 1: matrix 6732 rows 101 cols
[2024-06-07 14:55:35] [INFO ] Computed 0 invariants in 96 ms
[2024-06-07 14:55:36] [INFO ] Implicit Places using invariants in 718 ms returned []
[2024-06-07 14:55:36] [INFO ] Invariant cache hit.
[2024-06-07 14:55:37] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1706 ms to find 0 implicit places.
[2024-06-07 14:55:37] [INFO ] Invariant cache hit.
[2024-06-07 14:55:41] [INFO ] Dead Transitions using invariants and state equation in 3655 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/104 places, 6732/8014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5484 ms. Remains : 101/104 places, 6732/8014 transitions.
Stuttering acceptance computed with spot in 380 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p1), p2, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={} source=1 dest: 6}, { cond=(AND p0 p1), acceptance={} source=1 dest: 7}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 8}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=p1, acceptance={1} source=2 dest: 3}, { cond=p1, acceptance={0, 1} source=2 dest: 4}, { cond=(AND p1 p2), acceptance={0, 1} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 2}, { cond=p1, acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 p2), acceptance={1} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0, 1} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1 p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 p1 p2), acceptance={} source=7 dest: 8}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=8 dest: 5}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (EQ s21 0) (EQ s35 0) (EQ s43 0) (EQ s51 0) (EQ s59 0) (EQ s67 0) (EQ s75 0) (EQ s83 0) (EQ s91 0) (EQ s99 0)), p1:(OR (EQ s12 0) (EQ s32 0) (EQ s4...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 2667 ms.
Product exploration explored 100000 steps with 0 reset in 2716 ms.
Computed a total of 35 stabilizing places and 45 stable transitions
Graph (complete) has 799 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.77 ms
Computed a total of 35 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 325 ms. Reduced automaton from 9 states, 38 edges and 3 AP (stutter sensitive) to 9 states, 38 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p1), p2, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=14 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 437297 steps, run timeout after 9001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 437297 steps, saw 63430 distinct states, run finished after 9001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 14 properties.
[2024-06-07 14:55:59] [INFO ] Invariant cache hit.
[2024-06-07 14:56:00] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:11
[2024-06-07 14:56:05] [INFO ] After 4917ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :9
[2024-06-07 14:56:09] [INFO ] After 9010ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :9
Attempting to minimize the solution found.
Minimization took 2042 ms.
[2024-06-07 14:56:11] [INFO ] After 11157ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :9
Fused 14 Parikh solutions to 2 different solutions.
Finished Parikh walk after 58 steps, including 0 resets, run visited all 9 properties in 6 ms. (steps per millisecond=9 )
Parikh walk visited 5 properties in 7 ms.
Support contains 18 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 6732/6732 transitions.
Graph (complete) has 799 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 99 transition count 6704
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 44 place count 83 transition count 6703
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 44 place count 83 transition count 6701
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 81 transition count 6701
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 102 place count 54 transition count 6674
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 54 transition count 6673
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 54 transition count 6671
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 52 transition count 6671
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 51 transition count 6670
Applied a total of 108 rules in 3419 ms. Remains 51 /101 variables (removed 50) and now considering 6670/6732 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3420 ms. Remains : 51/101 places, 6670/6732 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1473 ms. (steps per millisecond=6 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6670 rows 51 cols
[2024-06-07 14:56:16] [INFO ] Computed 10 invariants in 37 ms
[2024-06-07 14:56:16] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-07 14:56:19] [INFO ] After 2784ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-06-07 14:56:19] [INFO ] After 3135ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 198 ms.
[2024-06-07 14:56:20] [INFO ] After 3369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2024-06-07 14:56:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-07 14:56:23] [INFO ] After 3028ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 14:56:23] [INFO ] After 3574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 310 ms.
[2024-06-07 14:56:24] [INFO ] After 3926ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 14 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=2 )
Parikh walk visited 2 properties in 5 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND p1 p2)), (F p2), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1 p2)), (F (NOT p1)), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (AND p0 p1 p2)), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 22 factoid took 1636 ms. Reduced automaton from 9 states, 38 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 414 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p1), p2, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2)]
Stuttering acceptance computed with spot in 414 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p1), p2, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2)]
Support contains 18 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 6732/6732 transitions.
Applied a total of 0 rules in 37 ms. Remains 101 /101 variables (removed 0) and now considering 6732/6732 (removed 0) transitions.
// Phase 1: matrix 6732 rows 101 cols
[2024-06-07 14:56:26] [INFO ] Computed 0 invariants in 112 ms
[2024-06-07 14:56:27] [INFO ] Implicit Places using invariants in 815 ms returned []
[2024-06-07 14:56:27] [INFO ] Invariant cache hit.
[2024-06-07 14:56:28] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1786 ms to find 0 implicit places.
[2024-06-07 14:56:28] [INFO ] Invariant cache hit.
[2024-06-07 14:56:33] [INFO ] Dead Transitions using invariants and state equation in 4829 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6654 ms. Remains : 101/101 places, 6732/6732 transitions.
Computed a total of 35 stabilizing places and 45 stable transitions
Graph (complete) has 799 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.74 ms
Computed a total of 35 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 309 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 405 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p1), p2, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 798 ms. (steps per millisecond=12 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 473261 steps, run timeout after 9001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 473261 steps, saw 68932 distinct states, run finished after 9001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 13 properties.
[2024-06-07 14:56:46] [INFO ] Invariant cache hit.
[2024-06-07 14:56:46] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:10
[2024-06-07 14:56:50] [INFO ] After 4105ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :8
[2024-06-07 14:56:52] [INFO ] After 6272ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :8
Attempting to minimize the solution found.
Minimization took 1263 ms.
[2024-06-07 14:56:54] [INFO ] After 7640ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :8
Fused 13 Parikh solutions to 2 different solutions.
Finished Parikh walk after 58 steps, including 0 resets, run visited all 8 properties in 4 ms. (steps per millisecond=14 )
Parikh walk visited 4 properties in 5 ms.
Support contains 18 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 6732/6732 transitions.
Graph (complete) has 799 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 99 transition count 6704
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 44 place count 83 transition count 6703
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 44 place count 83 transition count 6701
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 81 transition count 6701
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 102 place count 54 transition count 6674
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 54 transition count 6673
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 54 transition count 6671
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 52 transition count 6671
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 51 transition count 6670
Applied a total of 108 rules in 3109 ms. Remains 51 /101 variables (removed 50) and now considering 6670/6732 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3110 ms. Remains : 51/101 places, 6670/6732 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1135 ms. (steps per millisecond=8 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6670 rows 51 cols
[2024-06-07 14:56:58] [INFO ] Computed 10 invariants in 40 ms
[2024-06-07 14:56:58] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-07 14:57:01] [INFO ] After 2887ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-07 14:57:02] [INFO ] After 3455ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 322 ms.
[2024-06-07 14:57:02] [INFO ] After 3824ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 14 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=2 )
Parikh walk visited 2 properties in 5 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND p1 p2)), (F p2), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1 p2)), (F (NOT p1)), (F (AND p0 p1 p2)), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) p2)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) p1 p2))
Knowledge based reduction with 21 factoid took 688 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N09P1-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N09P1-LTLFireability-02 finished in 87677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 16 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Graph (trivial) has 56 edges and 104 vertex of which 6 / 104 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 834 edges and 100 vertex of which 98 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.37 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 97 transition count 8000
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 90 transition count 8000
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 90 transition count 7990
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 80 transition count 7990
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 77 transition count 6965
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 77 transition count 6965
Ensure Unique test removed 258 transitions
Reduce isomorphic transitions removed 258 transitions.
Iterating post reduction 2 with 258 rules applied. Total rules applied 300 place count 77 transition count 6707
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 300 place count 77 transition count 6705
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 304 place count 75 transition count 6705
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 334 place count 60 transition count 6690
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 340 place count 57 transition count 6698
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 341 place count 57 transition count 6697
Applied a total of 341 rules in 9091 ms. Remains 57 /104 variables (removed 47) and now considering 6697/8014 (removed 1317) transitions.
[2024-06-07 14:57:12] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
// Phase 1: matrix 6696 rows 57 cols
[2024-06-07 14:57:12] [INFO ] Computed 0 invariants in 63 ms
[2024-06-07 14:57:13] [INFO ] Implicit Places using invariants in 795 ms returned []
[2024-06-07 14:57:13] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
[2024-06-07 14:57:13] [INFO ] Invariant cache hit.
[2024-06-07 14:57:14] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
[2024-06-07 14:57:40] [INFO ] Redundant transitions in 26380 ms returned []
[2024-06-07 14:57:40] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
[2024-06-07 14:57:40] [INFO ] Invariant cache hit.
[2024-06-07 14:57:46] [INFO ] Dead Transitions using invariants and state equation in 6038 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/104 places, 6697/8014 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43268 ms. Remains : 57/104 places, 6697/8014 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s11 1) (EQ s17 1) (EQ s21 1) (EQ s27 1) (EQ s33 1) (EQ s39 1) (EQ s45 1) (EQ s51 1) (EQ s56 1)), p1:(OR (NEQ s3 1) (NEQ s12 1) (NEQ ...], nbAcceptance=2, 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 0 reset in 3405 ms.
Product exploration explored 100000 steps with 0 reset in 3537 ms.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 782 ms. (steps per millisecond=12 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 173186 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 173186 steps, saw 25205 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :2
Running SMT prover for 2 properties.
[2024-06-07 14:57:58] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
[2024-06-07 14:57:58] [INFO ] Invariant cache hit.
[2024-06-07 14:58:01] [INFO ] After 2452ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-06-07 14:58:03] [INFO ] After 2548ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-06-07 14:58:05] [INFO ] State equation strengthened by 4987 read => feed constraints.
[2024-06-07 14:58:17] [INFO ] After 12394ms SMT Verify possible using 4987 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-06-07 14:58:17] [INFO ] After 12713ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 181 ms.
[2024-06-07 14:58:18] [INFO ] After 17061ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 16 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 6697/6697 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 57 transition count 6689
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 18 place count 52 transition count 6684
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 52 transition count 6683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 51 transition count 6683
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 50 transition count 6682
Applied a total of 21 rules in 12557 ms. Remains 50 /57 variables (removed 7) and now considering 6682/6697 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12561 ms. Remains : 50/57 places, 6682/6697 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 119934 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119934 steps, saw 21784 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6682 rows 50 cols
[2024-06-07 14:58:34] [INFO ] Computed 6 invariants in 63 ms
[2024-06-07 14:58:34] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-07 14:58:36] [INFO ] After 2596ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 14:58:37] [INFO ] State equation strengthened by 3322 read => feed constraints.
[2024-06-07 14:58:44] [INFO ] After 6907ms SMT Verify possible using 3322 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-06-07 14:58:44] [INFO ] After 7219ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 177 ms.
[2024-06-07 14:58:45] [INFO ] After 10774ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 5 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 231 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Support contains 10 out of 57 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 6697/6697 transitions.
Applied a total of 0 rules in 4530 ms. Remains 57 /57 variables (removed 0) and now considering 6697/6697 (removed 0) transitions.
[2024-06-07 14:58:49] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
// Phase 1: matrix 6696 rows 57 cols
[2024-06-07 14:58:50] [INFO ] Computed 0 invariants in 88 ms
[2024-06-07 14:58:50] [INFO ] Implicit Places using invariants in 829 ms returned []
[2024-06-07 14:58:50] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
[2024-06-07 14:58:50] [INFO ] Invariant cache hit.
[2024-06-07 14:58:51] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
[2024-06-07 14:59:17] [INFO ] Redundant transitions in 25327 ms returned []
[2024-06-07 14:59:17] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
[2024-06-07 14:59:17] [INFO ] Invariant cache hit.
[2024-06-07 14:59:20] [INFO ] Dead Transitions using invariants and state equation in 3624 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35351 ms. Remains : 57/57 places, 6697/6697 transitions.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 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 36 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 187767 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187767 steps, saw 27422 distinct states, run finished after 3003 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-07 14:59:24] [INFO ] Flow matrix only has 6696 transitions (discarded 1 similar events)
[2024-06-07 14:59:24] [INFO ] Invariant cache hit.
[2024-06-07 14:59:27] [INFO ] After 2880ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 14:59:28] [INFO ] State equation strengthened by 4987 read => feed constraints.
[2024-06-07 14:59:41] [INFO ] After 12645ms SMT Verify possible using 4987 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-06-07 14:59:41] [INFO ] After 13022ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 192 ms.
[2024-06-07 14:59:41] [INFO ] After 17304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 10 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 6697/6697 transitions.
Graph (trivial) has 12 edges and 57 vertex of which 2 / 57 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 56 transition count 6686
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 55 transition count 6686
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 13 place count 50 transition count 6681
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 50 transition count 6680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 49 transition count 6680
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 48 transition count 6679
Applied a total of 16 rules in 19160 ms. Remains 48 /57 variables (removed 9) and now considering 6679/6697 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19160 ms. Remains : 48/57 places, 6679/6697 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 110279 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110279 steps, saw 22083 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6679 rows 48 cols
[2024-06-07 15:00:04] [INFO ] Computed 6 invariants in 51 ms
[2024-06-07 15:00:04] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-07 15:00:07] [INFO ] After 2542ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 15:00:09] [INFO ] State equation strengthened by 5754 read => feed constraints.
[2024-06-07 15:00:27] [INFO ] After 17132ms SMT Verify possible using 5754 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 15:00:27] [INFO ] After 22172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 15:00:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-07 15:00:29] [INFO ] After 2475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 15:00:46] [INFO ] After 17029ms SMT Verify possible using 5754 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-07 15:00:46] [INFO ] After 17323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 189 ms.
[2024-06-07 15:00:47] [INFO ] After 20020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 105 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 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 3021 ms.
Product exploration explored 100000 steps with 0 reset in 2693 ms.
Built C files in :
/tmp/ltsmin4766414782381776554
[2024-06-07 15:00:53] [INFO ] Too many transitions (6697) to apply POR reductions. Disabling POR matrices.
[2024-06-07 15:00:53] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4766414782381776554
Running compilation step : cd /tmp/ltsmin4766414782381776554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4766414782381776554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4766414782381776554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 10 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 6697/6697 transitions.
Graph (trivial) has 12 edges and 57 vertex of which 2 / 57 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 56 transition count 6695
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 55 transition count 6695
Applied a total of 3 rules in 6346 ms. Remains 55 /57 variables (removed 2) and now considering 6695/6697 (removed 2) transitions.
[2024-06-07 15:01:02] [INFO ] Flow matrix only has 6693 transitions (discarded 2 similar events)
// Phase 1: matrix 6693 rows 55 cols
[2024-06-07 15:01:02] [INFO ] Computed 0 invariants in 83 ms
[2024-06-07 15:01:03] [INFO ] Implicit Places using invariants in 1054 ms returned []
[2024-06-07 15:01:03] [INFO ] Flow matrix only has 6693 transitions (discarded 2 similar events)
[2024-06-07 15:01:03] [INFO ] Invariant cache hit.
[2024-06-07 15:01:04] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
[2024-06-07 15:01:29] [INFO ] Redundant transitions in 25245 ms returned []
[2024-06-07 15:01:29] [INFO ] Flow matrix only has 6693 transitions (discarded 2 similar events)
[2024-06-07 15:01:29] [INFO ] Invariant cache hit.
[2024-06-07 15:01:33] [INFO ] Dead Transitions using invariants and state equation in 3843 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/57 places, 6695/6697 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37427 ms. Remains : 55/57 places, 6695/6697 transitions.
Built C files in :
/tmp/ltsmin2342339380533764102
[2024-06-07 15:01:33] [INFO ] Too many transitions (6695) to apply POR reductions. Disabling POR matrices.
[2024-06-07 15:01:33] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2342339380533764102
Running compilation step : cd /tmp/ltsmin2342339380533764102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2342339380533764102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2342339380533764102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 15:01:38] [INFO ] Flatten gal took : 984 ms
[2024-06-07 15:01:39] [INFO ] Flatten gal took : 762 ms
[2024-06-07 15:01:39] [INFO ] Time to serialize gal into /tmp/LTL9392772223460066697.gal : 110 ms
[2024-06-07 15:01:39] [INFO ] Time to serialize properties into /tmp/LTL1727512546196090089.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9392772223460066697.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13845551125505540180.hoa' '-atoms' '/tmp/LTL1727512546196090089.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1727512546196090089.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13845551125505540180.hoa
Detected timeout of ITS tools.
[2024-06-07 15:01:56] [INFO ] Flatten gal took : 1194 ms
[2024-06-07 15:01:57] [INFO ] Flatten gal took : 1018 ms
[2024-06-07 15:01:57] [INFO ] Time to serialize gal into /tmp/LTL14934508876640292499.gal : 138 ms
[2024-06-07 15:01:57] [INFO ] Time to serialize properties into /tmp/LTL8486050182157877188.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14934508876640292499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8486050182157877188.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((p37==1)&&(p67==1))&&((p96==1)&&(p123==1)))&&(((p151==1)&&(p180==1))&&((p208==1)&&(p236==1))))&&((p264==1)&&(p291==1)))")...291
Formula 0 simplified : G(F!"(((((p37==1)&&(p67==1))&&((p96==1)&&(p123==1)))&&(((p151==1)&&(p180==1))&&((p208==1)&&(p236==1))))&&((p264==1)&&(p291==1)))" & ...283
Detected timeout of ITS tools.
[2024-06-07 15:02:13] [INFO ] Flatten gal took : 1021 ms
[2024-06-07 15:02:13] [INFO ] Applying decomposition
[2024-06-07 15:02:14] [INFO ] Flatten gal took : 1026 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13154325494410095715.txt' '-o' '/tmp/graph13154325494410095715.bin' '-w' '/tmp/graph13154325494410095715.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13154325494410095715.bin' '-l' '-1' '-v' '-w' '/tmp/graph13154325494410095715.weights' '-q' '0' '-e' '0.001'
[2024-06-07 15:02:16] [INFO ] Decomposing Gal with order
[2024-06-07 15:02:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 15:02:18] [INFO ] Removed a total of 64603 redundant transitions.
[2024-06-07 15:02:19] [INFO ] Flatten gal took : 1669 ms
[2024-06-07 15:02:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 396 ms.
[2024-06-07 15:02:19] [INFO ] Time to serialize gal into /tmp/LTL5570835573140708150.gal : 33 ms
[2024-06-07 15:02:19] [INFO ] Time to serialize properties into /tmp/LTL7635834227491619228.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5570835573140708150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7635834227491619228.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((i1.u5.p37==1)&&(i2.u7.p67==1))&&((i1.u2.p96==1)&&(i1.u3.p123==1)))&&(((i2.u0.p151==1)&&(i2.u7.p180==1))&&((i1.u8.p208==1...412
Formula 0 simplified : G(F!"(((((i1.u5.p37==1)&&(i2.u7.p67==1))&&((i1.u2.p96==1)&&(i1.u3.p123==1)))&&(((i2.u0.p151==1)&&(i2.u7.p180==1))&&((i1.u8.p208==1)&...404
Reverse transition relation is NOT exact ! Due to transitions t31_t33, t25_t27_t8010, t19_t21_t8005, t13_t15_t8011, t7_t9_t8004, t6_t12_t18_t24_t30_t36_t43...1516
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13884052721216634804
[2024-06-07 15:02:34] [INFO ] Built C files in 136ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13884052721216634804
Running compilation step : cd /tmp/ltsmin13884052721216634804;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13884052721216634804;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13884052721216634804;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ResIsolation-PT-N09P1-LTLFireability-03 finished in 334795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 6989
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 6989
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 263 place count 101 transition count 6732
Applied a total of 263 rules in 96 ms. Remains 101 /104 variables (removed 3) and now considering 6732/8014 (removed 1282) transitions.
// Phase 1: matrix 6732 rows 101 cols
[2024-06-07 15:02:38] [INFO ] Computed 0 invariants in 92 ms
[2024-06-07 15:02:39] [INFO ] Implicit Places using invariants in 926 ms returned []
[2024-06-07 15:02:39] [INFO ] Invariant cache hit.
[2024-06-07 15:02:40] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
[2024-06-07 15:02:40] [INFO ] Invariant cache hit.
[2024-06-07 15:02:43] [INFO ] Dead Transitions using invariants and state equation in 3510 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/104 places, 6732/8014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5595 ms. Remains : 101/104 places, 6732/8014 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-04 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 s16 1) (EQ s33 1) (EQ s43 1) (EQ s49 1) (EQ s57 1) (EQ s67 1) (EQ s73 1) (EQ s81 1) (EQ s89 1) (EQ s99 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 0 reset in 2776 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 3 ms.
FORMULA ResIsolation-PT-N09P1-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N09P1-LTLFireability-04 finished in 8515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X(p2)&&p1)||p0))))'
Support contains 21 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 6989
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 6989
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 263 place count 101 transition count 6732
Applied a total of 263 rules in 86 ms. Remains 101 /104 variables (removed 3) and now considering 6732/8014 (removed 1282) transitions.
[2024-06-07 15:02:46] [INFO ] Invariant cache hit.
[2024-06-07 15:02:47] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-06-07 15:02:47] [INFO ] Invariant cache hit.
[2024-06-07 15:02:48] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1646 ms to find 0 implicit places.
[2024-06-07 15:02:48] [INFO ] Invariant cache hit.
[2024-06-07 15:02:52] [INFO ] Dead Transitions using invariants and state equation in 4070 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/104 places, 6732/8014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5805 ms. Remains : 101/104 places, 6732/8014 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s21 0) (EQ s32 0) (EQ s40 0) (EQ s48 0) (EQ s56 0) (EQ s67 0) (EQ s75 0) (EQ s83 0) (EQ s91 0) (EQ s99 0)), p1:(AND (OR (EQ s21 0) (EQ s35 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3027 ms.
Product exploration explored 100000 steps with 0 reset in 2772 ms.
Computed a total of 35 stabilizing places and 45 stable transitions
Graph (complete) has 799 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.77 ms
Computed a total of 35 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1 p2)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 157 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 653 ms. (steps per millisecond=15 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 142071 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142071 steps, saw 38609 distinct states, run finished after 3004 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 6 properties.
[2024-06-07 15:03:03] [INFO ] Invariant cache hit.
[2024-06-07 15:03:03] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-07 15:03:07] [INFO ] After 3588ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-06-07 15:03:08] [INFO ] After 4968ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 804 ms.
[2024-06-07 15:03:09] [INFO ] After 5852ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=15 )
Parikh walk visited 4 properties in 11 ms.
Support contains 21 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 6732/6732 transitions.
Graph (complete) has 799 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 99 transition count 6704
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 44 place count 83 transition count 6703
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 44 place count 83 transition count 6701
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 81 transition count 6701
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 102 place count 54 transition count 6674
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 54 transition count 6673
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 54 transition count 6671
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 52 transition count 6671
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 51 transition count 6670
Applied a total of 108 rules in 3019 ms. Remains 51 /101 variables (removed 50) and now considering 6670/6732 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3020 ms. Remains : 51/101 places, 6670/6732 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 992 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 135487 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135487 steps, saw 21463 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6670 rows 51 cols
[2024-06-07 15:03:16] [INFO ] Computed 10 invariants in 43 ms
[2024-06-07 15:03:16] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 15:03:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-07 15:03:19] [INFO ] After 2642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 15:03:19] [INFO ] After 2912ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 162 ms.
[2024-06-07 15:03:19] [INFO ] After 3108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1 p2)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p2 p0))), (F (OR (NOT p2) (AND (NOT p0) (NOT p1)))), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 11 factoid took 287 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N09P1-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N09P1-LTLFireability-05 finished in 33528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((F(!p1)||G(!p2)))||p0))))'
Support contains 20 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 102 transition count 7501
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 7501
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 261 place count 102 transition count 7244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 262 place count 101 transition count 6732
Iterating global reduction 1 with 1 rules applied. Total rules applied 263 place count 101 transition count 6732
Applied a total of 263 rules in 119 ms. Remains 101 /104 variables (removed 3) and now considering 6732/8014 (removed 1282) transitions.
// Phase 1: matrix 6732 rows 101 cols
[2024-06-07 15:03:20] [INFO ] Computed 0 invariants in 98 ms
[2024-06-07 15:03:20] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-06-07 15:03:20] [INFO ] Invariant cache hit.
[2024-06-07 15:03:21] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1530 ms to find 0 implicit places.
[2024-06-07 15:03:21] [INFO ] Invariant cache hit.
[2024-06-07 15:03:25] [INFO ] Dead Transitions using invariants and state equation in 3920 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/104 places, 6732/8014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5574 ms. Remains : 101/104 places, 6732/8014 transitions.
Stuttering acceptance computed with spot in 191 ms :[p1, (AND p1 (NOT p0) p2), (AND p1 p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2)]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(AND (EQ s21 1) (EQ s35 1) (EQ s40 1) (EQ s48 1) (EQ s59 1) (EQ s67 1) (EQ s72 1) (EQ s83 1) (EQ s91 1) (EQ s96 1)), p0:(OR (EQ s21 0) (EQ s35 0) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 633 ms.
Product exploration explored 100000 steps with 33333 reset in 662 ms.
Computed a total of 35 stabilizing places and 45 stable transitions
Graph (complete) has 799 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.79 ms
Computed a total of 35 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N09P1-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N09P1-LTLFireability-06 finished in 7239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G((X((p2&&F(p0)))&&p1)))))'
Support contains 17 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 6989
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 6989
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 263 place count 101 transition count 6732
Applied a total of 263 rules in 87 ms. Remains 101 /104 variables (removed 3) and now considering 6732/8014 (removed 1282) transitions.
// Phase 1: matrix 6732 rows 101 cols
[2024-06-07 15:03:27] [INFO ] Computed 0 invariants in 86 ms
[2024-06-07 15:03:28] [INFO ] Implicit Places using invariants in 769 ms returned []
[2024-06-07 15:03:28] [INFO ] Invariant cache hit.
[2024-06-07 15:03:29] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
[2024-06-07 15:03:29] [INFO ] Invariant cache hit.
[2024-06-07 15:03:32] [INFO ] Dead Transitions using invariants and state equation in 3277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/104 places, 6732/8014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5112 ms. Remains : 101/104 places, 6732/8014 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p0), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), true, (OR (AND p1 (NOT p2)) (AND (NOT p0) p2)), (NOT p0), (NOT p0), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 6}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s33 1) (EQ s43 1) (EQ s51 1) (EQ s59 1) (EQ s65 1) (EQ s75 1) (EQ s83 1) (EQ s91 1) (EQ s99 1)), p1:(AND (EQ s16 1) (EQ s33 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResIsolation-PT-N09P1-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N09P1-LTLFireability-07 finished in 5471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(!p0)))) U ((!p0&&X(X(X(X(!p0))))&&F(!p1))||X(X(X(X(G(!p0))))))))'
Support contains 15 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 6989
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 6989
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 263 place count 101 transition count 6732
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 264 place count 100 transition count 6220
Iterating global reduction 1 with 1 rules applied. Total rules applied 265 place count 100 transition count 6220
Applied a total of 265 rules in 126 ms. Remains 100 /104 variables (removed 4) and now considering 6220/8014 (removed 1794) transitions.
// Phase 1: matrix 6220 rows 100 cols
[2024-06-07 15:03:33] [INFO ] Computed 0 invariants in 95 ms
[2024-06-07 15:03:33] [INFO ] Implicit Places using invariants in 775 ms returned []
[2024-06-07 15:03:33] [INFO ] Invariant cache hit.
[2024-06-07 15:03:34] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
[2024-06-07 15:03:34] [INFO ] Invariant cache hit.
[2024-06-07 15:03:37] [INFO ] Dead Transitions using invariants and state equation in 3103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/104 places, 6220/8014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4964 ms. Remains : 100/104 places, 6220/8014 transitions.
Stuttering acceptance computed with spot in 441 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, true, (AND p1 p0), p1]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 9}], [{ cond=p1, acceptance={} source=6 dest: 10}], [{ cond=p1, acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={0} source=8 dest: 8}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=(AND p0 p1), acceptance={} source=10 dest: 11}], [{ cond=p1, acceptance={0} source=11 dest: 11}]], initial=8, aps=[p1:(AND (EQ s20 1) (EQ s31 1) (EQ s39 1) (EQ s47 1) (EQ s58 1) (EQ s66 1) (EQ s74 1) (EQ s79 1) (EQ s90 1) (EQ s95 1)), p0:(AND (EQ s20 1) (EQ s34 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 420 ms.
Product exploration explored 100000 steps with 20000 reset in 452 ms.
Computed a total of 35 stabilizing places and 45 stable transitions
Graph (complete) has 789 edges and 100 vertex of which 98 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.73 ms
Computed a total of 35 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 118 ms. Reduced automaton from 12 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[p0, p0, p0, p0, true, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 206363 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206363 steps, saw 45169 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-07 15:03:42] [INFO ] Invariant cache hit.
[2024-06-07 15:03:45] [INFO ] After 2422ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 15:03:45] [INFO ] After 2684ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 154 ms.
[2024-06-07 15:03:45] [INFO ] After 2874ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 10 factoid took 147 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 191 ms :[p0, p0, p0, p0, true, p0]
Support contains 10 out of 100 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 6220/6220 transitions.
Applied a total of 0 rules in 36 ms. Remains 100 /100 variables (removed 0) and now considering 6220/6220 (removed 0) transitions.
[2024-06-07 15:03:46] [INFO ] Invariant cache hit.
[2024-06-07 15:03:47] [INFO ] Implicit Places using invariants in 647 ms returned []
[2024-06-07 15:03:47] [INFO ] Invariant cache hit.
[2024-06-07 15:03:47] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1553 ms to find 0 implicit places.
[2024-06-07 15:03:47] [INFO ] Invariant cache hit.
[2024-06-07 15:03:51] [INFO ] Dead Transitions using invariants and state equation in 3142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4734 ms. Remains : 100/100 places, 6220/6220 transitions.
Computed a total of 35 stabilizing places and 45 stable transitions
Graph (complete) has 789 edges and 100 vertex of which 98 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.70 ms
Computed a total of 35 stabilizing places and 45 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[p0, p0, p0, p0, true, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 207783 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207783 steps, saw 45177 distinct states, run finished after 3003 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-07 15:03:54] [INFO ] Invariant cache hit.
[2024-06-07 15:03:57] [INFO ] After 2412ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 15:03:57] [INFO ] After 2685ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 155 ms.
[2024-06-07 15:03:57] [INFO ] After 2875ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 192 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 189 ms :[p0, p0, p0, p0, true, p0]
Product exploration explored 100000 steps with 20000 reset in 467 ms.
Product exploration explored 100000 steps with 20000 reset in 594 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 195 ms :[p0, p0, p0, p0, true, p0]
Support contains 10 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 6220/6220 transitions.
Graph (complete) has 789 edges and 100 vertex of which 98 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.27 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 98 transition count 6218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 98 transition count 6216
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 10 place count 98 transition count 6226
Deduced a syphon composed of 17 places in 4 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 98 transition count 6226
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 24 place count 94 transition count 6222
Deduced a syphon composed of 13 places in 4 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 94 transition count 6222
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 34 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 49 place count 94 transition count 6223
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 91 transition count 6219
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 91 transition count 6219
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 34 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 91 transition count 6255
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 88 transition count 6249
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 88 transition count 6249
Deduced a syphon composed of 31 places in 1 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 88 transition count 6248
Deduced a syphon composed of 31 places in 2 ms
Applied a total of 65 rules in 1911 ms. Remains 88 /100 variables (removed 12) and now considering 6248/6220 (removed -28) transitions.
[2024-06-07 15:04:26] [INFO ] Redundant transitions in 24914 ms returned []
// Phase 1: matrix 6248 rows 88 cols
[2024-06-07 15:04:26] [INFO ] Computed 0 invariants in 82 ms
[2024-06-07 15:04:31] [INFO ] Dead Transitions using invariants and state equation in 4675 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/100 places, 6248/6220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31512 ms. Remains : 88/100 places, 6248/6220 transitions.
Built C files in :
/tmp/ltsmin5486588423465683903
[2024-06-07 15:04:31] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5486588423465683903
Running compilation step : cd /tmp/ltsmin5486588423465683903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5486588423465683903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5486588423465683903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 10 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 6220/6220 transitions.
Applied a total of 0 rules in 70 ms. Remains 100 /100 variables (removed 0) and now considering 6220/6220 (removed 0) transitions.
// Phase 1: matrix 6220 rows 100 cols
[2024-06-07 15:04:34] [INFO ] Computed 0 invariants in 95 ms
[2024-06-07 15:04:35] [INFO ] Implicit Places using invariants in 889 ms returned []
[2024-06-07 15:04:35] [INFO ] Invariant cache hit.
[2024-06-07 15:04:36] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1772 ms to find 0 implicit places.
[2024-06-07 15:04:36] [INFO ] Invariant cache hit.
[2024-06-07 15:04:40] [INFO ] Dead Transitions using invariants and state equation in 4365 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6211 ms. Remains : 100/100 places, 6220/6220 transitions.
Built C files in :
/tmp/ltsmin8075624643313002981
[2024-06-07 15:04:41] [INFO ] Built C files in 152ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8075624643313002981
Running compilation step : cd /tmp/ltsmin8075624643313002981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8075624643313002981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8075624643313002981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 15:04:45] [INFO ] Flatten gal took : 1109 ms
[2024-06-07 15:04:47] [INFO ] Flatten gal took : 1044 ms
[2024-06-07 15:04:47] [INFO ] Time to serialize gal into /tmp/LTL9187039676116096550.gal : 121 ms
[2024-06-07 15:04:47] [INFO ] Time to serialize properties into /tmp/LTL3409203545829662543.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9187039676116096550.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2582509387091977923.hoa' '-atoms' '/tmp/LTL3409203545829662543.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3409203545829662543.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2582509387091977923.hoa
Detected timeout of ITS tools.
[2024-06-07 15:05:03] [INFO ] Flatten gal took : 1091 ms
[2024-06-07 15:05:05] [INFO ] Flatten gal took : 1119 ms
[2024-06-07 15:05:05] [INFO ] Time to serialize gal into /tmp/LTL11630705466001531780.gal : 115 ms
[2024-06-07 15:05:05] [INFO ] Time to serialize properties into /tmp/LTL13434311578978931073.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11630705466001531780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13434311578978931073.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(X(!("(((((p37==1)&&(p68==1))&&((p96==1)&&(p124==1)))&&(((p152==1)&&(p180==1))&&((p208==1)&&(p236==1))))&&((p264==1)&&(p292==...731
Formula 0 simplified : XXXX"(((((p37==1)&&(p68==1))&&((p96==1)&&(p124==1)))&&(((p152==1)&&(p180==1))&&((p208==1)&&(p236==1))))&&((p264==1)&&(p292==1)))" R ...678
Detected timeout of ITS tools.
[2024-06-07 15:05:21] [INFO ] Flatten gal took : 997 ms
[2024-06-07 15:05:21] [INFO ] Applying decomposition
[2024-06-07 15:05:22] [INFO ] Flatten gal took : 987 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6379175818524844609.txt' '-o' '/tmp/graph6379175818524844609.bin' '-w' '/tmp/graph6379175818524844609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6379175818524844609.bin' '-l' '-1' '-v' '-w' '/tmp/graph6379175818524844609.weights' '-q' '0' '-e' '0.001'
[2024-06-07 15:05:25] [INFO ] Decomposing Gal with order
[2024-06-07 15:05:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 15:05:27] [INFO ] Removed a total of 64321 redundant transitions.
[2024-06-07 15:05:27] [INFO ] Flatten gal took : 1667 ms
[2024-06-07 15:05:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 145 ms.
[2024-06-07 15:05:27] [INFO ] Time to serialize gal into /tmp/LTL7062875394455673334.gal : 48 ms
[2024-06-07 15:05:27] [INFO ] Time to serialize properties into /tmp/LTL10090783763392062880.ltl : 3 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7062875394455673334.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10090783763392062880.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(X(!("(((((i2.i0.u10.p37==1)&&(i2.i0.u27.p68==1))&&((i2.i0.u13.p96==1)&&(i2.i0.u14.p124==1)))&&(((i2.i0.u17.p152==1)&&(i2.i0....1227
Formula 0 simplified : XXXX"(((((i2.i0.u10.p37==1)&&(i2.i0.u27.p68==1))&&((i2.i0.u13.p96==1)&&(i2.i0.u14.p124==1)))&&(((i2.i0.u17.p152==1)&&(i2.i0.u19.p180...1174
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10163869573344615051
[2024-06-07 15:05:42] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10163869573344615051
Running compilation step : cd /tmp/ltsmin10163869573344615051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10163869573344615051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10163869573344615051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ResIsolation-PT-N09P1-LTLFireability-08 finished in 133166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p2)||p1)&&p0)))'
Support contains 20 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 6989
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 6989
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 263 place count 101 transition count 6732
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 264 place count 100 transition count 6220
Iterating global reduction 1 with 1 rules applied. Total rules applied 265 place count 100 transition count 6220
Applied a total of 265 rules in 145 ms. Remains 100 /104 variables (removed 4) and now considering 6220/8014 (removed 1794) transitions.
[2024-06-07 15:05:46] [INFO ] Invariant cache hit.
[2024-06-07 15:05:46] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-06-07 15:05:46] [INFO ] Invariant cache hit.
[2024-06-07 15:05:47] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
[2024-06-07 15:05:47] [INFO ] Invariant cache hit.
[2024-06-07 15:05:52] [INFO ] Dead Transitions using invariants and state equation in 4991 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/104 places, 6220/8014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6644 ms. Remains : 100/104 places, 6220/8014 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(OR (EQ s20 0) (EQ s33 0) (EQ s42 0) (EQ s49 0) (EQ s57 0) (EQ s66 0) (EQ s73 0) (EQ s81 0) (EQ s89 0) (EQ s97 0)), p0:(AND (EQ s20 1) (EQ s34 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResIsolation-PT-N09P1-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N09P1-LTLFireability-09 finished in 6816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 102 transition count 7501
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 7501
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 260 place count 102 transition count 7245
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 261 place count 101 transition count 6733
Iterating global reduction 1 with 1 rules applied. Total rules applied 262 place count 101 transition count 6733
Applied a total of 262 rules in 175 ms. Remains 101 /104 variables (removed 3) and now considering 6733/8014 (removed 1281) transitions.
// Phase 1: matrix 6733 rows 101 cols
[2024-06-07 15:05:53] [INFO ] Computed 0 invariants in 97 ms
[2024-06-07 15:05:53] [INFO ] Implicit Places using invariants in 1011 ms returned []
[2024-06-07 15:05:53] [INFO ] Invariant cache hit.
[2024-06-07 15:05:54] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
[2024-06-07 15:05:54] [INFO ] Invariant cache hit.
[2024-06-07 15:05:58] [INFO ] Dead Transitions using invariants and state equation in 3491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/104 places, 6733/8014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5576 ms. Remains : 101/104 places, 6733/8014 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s35 0) (EQ s42 0) (EQ s50 0) (EQ s59 0) (EQ s67 0) (EQ s74 0) (EQ s82 0) (EQ s91 0) (EQ s99 0))], 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 568 ms.
Product exploration explored 100000 steps with 50000 reset in 566 ms.
Computed a total of 35 stabilizing places and 45 stable transitions
Graph (complete) has 800 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.78 ms
Computed a total of 35 stabilizing places and 45 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N09P1-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N09P1-LTLFireability-10 finished in 6947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&F(G(p1))))'
Support contains 15 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Graph (complete) has 840 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.36 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 101 transition count 8004
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 94 transition count 8004
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 15 place count 94 transition count 7994
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 35 place count 84 transition count 7994
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 81 transition count 6969
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 81 transition count 6969
Ensure Unique test removed 258 transitions
Reduce isomorphic transitions removed 258 transitions.
Iterating post reduction 2 with 258 rules applied. Total rules applied 299 place count 81 transition count 6711
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 299 place count 81 transition count 6709
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 303 place count 79 transition count 6709
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 304 place count 78 transition count 6197
Iterating global reduction 3 with 1 rules applied. Total rules applied 305 place count 78 transition count 6197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 306 place count 78 transition count 6196
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 306 place count 78 transition count 6195
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 308 place count 77 transition count 6195
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 342 place count 60 transition count 6178
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 348 place count 57 transition count 6186
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 349 place count 57 transition count 6185
Applied a total of 349 rules in 2134 ms. Remains 57 /104 variables (removed 47) and now considering 6185/8014 (removed 1829) transitions.
// Phase 1: matrix 6185 rows 57 cols
[2024-06-07 15:06:01] [INFO ] Computed 0 invariants in 56 ms
[2024-06-07 15:06:02] [INFO ] Implicit Places using invariants in 767 ms returned []
[2024-06-07 15:06:02] [INFO ] Invariant cache hit.
[2024-06-07 15:06:03] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1750 ms to find 0 implicit places.
[2024-06-07 15:06:27] [INFO ] Redundant transitions in 24145 ms returned []
[2024-06-07 15:06:27] [INFO ] Invariant cache hit.
[2024-06-07 15:06:32] [INFO ] Dead Transitions using invariants and state equation in 5155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/104 places, 6185/8014 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33203 ms. Remains : 57/104 places, 6185/8014 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s10 1) (EQ s15 1) (EQ s20 1) (EQ s26 1) (EQ s32 1) (EQ s38 1) (EQ s44 1) (EQ s50 1) (EQ s56 1)), p1:(OR (NEQ s5 1) (NEQ s10 1) (NEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 3720 ms.
Product exploration explored 100000 steps with 0 reset in 3672 ms.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 205342 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205342 steps, saw 29765 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-07 15:06:44] [INFO ] Invariant cache hit.
[2024-06-07 15:06:46] [INFO ] After 2405ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 15:06:46] [INFO ] After 2667ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 150 ms.
[2024-06-07 15:06:47] [INFO ] After 2846ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 109 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 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Support contains 10 out of 57 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 6185/6185 transitions.
Applied a total of 0 rules in 596 ms. Remains 57 /57 variables (removed 0) and now considering 6185/6185 (removed 0) transitions.
[2024-06-07 15:06:47] [INFO ] Invariant cache hit.
[2024-06-07 15:06:48] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-06-07 15:06:48] [INFO ] Invariant cache hit.
[2024-06-07 15:06:49] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
[2024-06-07 15:07:13] [INFO ] Redundant transitions in 23670 ms returned []
[2024-06-07 15:07:13] [INFO ] Invariant cache hit.
[2024-06-07 15:07:17] [INFO ] Dead Transitions using invariants and state equation in 4428 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30253 ms. Remains : 57/57 places, 6185/6185 transitions.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 203732 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203732 steps, saw 29487 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-07 15:07:21] [INFO ] Invariant cache hit.
[2024-06-07 15:07:23] [INFO ] After 2410ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-07 15:07:24] [INFO ] After 2675ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 148 ms.
[2024-06-07 15:07:24] [INFO ] After 2851ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 100 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 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 3665 ms.
Product exploration explored 100000 steps with 0 reset in 3789 ms.
Built C files in :
/tmp/ltsmin10628132261623891091
[2024-06-07 15:07:31] [INFO ] Too many transitions (6185) to apply POR reductions. Disabling POR matrices.
[2024-06-07 15:07:32] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10628132261623891091
Running compilation step : cd /tmp/ltsmin10628132261623891091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10628132261623891091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10628132261623891091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 10 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 6185/6185 transitions.
Graph (trivial) has 16 edges and 57 vertex of which 10 / 57 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 5310 ms. Remains 52 /57 variables (removed 5) and now considering 6180/6185 (removed 5) transitions.
[2024-06-07 15:07:40] [INFO ] Flow matrix only has 6176 transitions (discarded 4 similar events)
// Phase 1: matrix 6176 rows 52 cols
[2024-06-07 15:07:40] [INFO ] Computed 0 invariants in 48 ms
[2024-06-07 15:07:41] [INFO ] Implicit Places using invariants in 826 ms returned []
[2024-06-07 15:07:41] [INFO ] Flow matrix only has 6176 transitions (discarded 4 similar events)
[2024-06-07 15:07:41] [INFO ] Invariant cache hit.
[2024-06-07 15:07:42] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1700 ms to find 0 implicit places.
[2024-06-07 15:08:03] [INFO ] Redundant transitions in 21830 ms returned []
[2024-06-07 15:08:03] [INFO ] Flow matrix only has 6176 transitions (discarded 4 similar events)
[2024-06-07 15:08:03] [INFO ] Invariant cache hit.
[2024-06-07 15:08:08] [INFO ] Dead Transitions using invariants and state equation in 5044 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/57 places, 6180/6185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33899 ms. Remains : 52/57 places, 6180/6185 transitions.
Built C files in :
/tmp/ltsmin16233037635152377550
[2024-06-07 15:08:08] [INFO ] Too many transitions (6180) to apply POR reductions. Disabling POR matrices.
[2024-06-07 15:08:09] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16233037635152377550
Running compilation step : cd /tmp/ltsmin16233037635152377550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16233037635152377550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16233037635152377550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 15:08:13] [INFO ] Flatten gal took : 815 ms
[2024-06-07 15:08:14] [INFO ] Flatten gal took : 913 ms
[2024-06-07 15:08:14] [INFO ] Time to serialize gal into /tmp/LTL9471415863735340691.gal : 91 ms
[2024-06-07 15:08:14] [INFO ] Time to serialize properties into /tmp/LTL15674864690861016799.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9471415863735340691.gal' '-t' 'CGAL' '-hoa' '/tmp/aut117354834154626535.hoa' '-atoms' '/tmp/LTL15674864690861016799.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL15674864690861016799.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut117354834154626535.hoa
Detected timeout of ITS tools.
[2024-06-07 15:08:31] [INFO ] Flatten gal took : 1024 ms
[2024-06-07 15:08:32] [INFO ] Flatten gal took : 1019 ms
[2024-06-07 15:08:32] [INFO ] Time to serialize gal into /tmp/LTL14607730875376305140.gal : 114 ms
[2024-06-07 15:08:32] [INFO ] Time to serialize properties into /tmp/LTL1756135034610497695.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14607730875376305140.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1756135034610497695.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(((((p37!=1)||(p68!=1))||((p96!=1)||(p124!=1)))||(((p152!=1)||(p180!=1))||((p208!=1)||(p236!=1))))||((p264!=1)||(p292!=1)))"))&...291
Formula 0 simplified : G!"(((((p37!=1)||(p68!=1))||((p96!=1)||(p124!=1)))||(((p152!=1)||(p180!=1))||((p208!=1)||(p236!=1))))||((p264!=1)||(p292!=1)))" | GF...281
Detected timeout of ITS tools.
[2024-06-07 15:08:48] [INFO ] Flatten gal took : 1015 ms
[2024-06-07 15:08:48] [INFO ] Applying decomposition
[2024-06-07 15:08:49] [INFO ] Flatten gal took : 1181 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11480826945457332627.txt' '-o' '/tmp/graph11480826945457332627.bin' '-w' '/tmp/graph11480826945457332627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11480826945457332627.bin' '-l' '-1' '-v' '-w' '/tmp/graph11480826945457332627.weights' '-q' '0' '-e' '0.001'
[2024-06-07 15:08:51] [INFO ] Decomposing Gal with order
[2024-06-07 15:08:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 15:08:53] [INFO ] Removed a total of 61251 redundant transitions.
[2024-06-07 15:08:54] [INFO ] Flatten gal took : 1796 ms
[2024-06-07 15:08:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 141 ms.
[2024-06-07 15:08:54] [INFO ] Time to serialize gal into /tmp/LTL16671175251104818988.gal : 47 ms
[2024-06-07 15:08:54] [INFO ] Time to serialize properties into /tmp/LTL12097016698825580861.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16671175251104818988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12097016698825580861.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((F("(((((i4.u1.p37!=1)||(u2.p68!=1))||((u3.p96!=1)||(u4.p124!=1)))||(((i4.u5.p152!=1)||(u6.p180!=1))||((u7.p208!=1)||(u8.p236!=1)))...363
Formula 0 simplified : G!"(((((i4.u1.p37!=1)||(u2.p68!=1))||((u3.p96!=1)||(u4.p124!=1)))||(((i4.u5.p152!=1)||(u6.p180!=1))||((u7.p208!=1)||(u8.p236!=1))))|...353
Reverse transition relation is NOT exact ! Due to transitions t31_t33_t8006, t25_t27_t8010, t19_t21_t8005, t13_t15_t8011, t7_t9_t8004, t6_t12_t18_t24_t30_t...1524
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
590 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,7.77055,101884,1,0,76781,2575,116540,64494,499,10787,747987
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResIsolation-PT-N09P1-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ResIsolation-PT-N09P1-LTLFireability-11 finished in 182775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X((F(p1) U p2)))&&p0) U X(p3)))'
Support contains 15 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 102 transition count 6990
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 6990
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 102 transition count 6989
Applied a total of 5 rules in 118 ms. Remains 102 /104 variables (removed 2) and now considering 6989/8014 (removed 1025) transitions.
// Phase 1: matrix 6989 rows 102 cols
[2024-06-07 15:09:02] [INFO ] Computed 0 invariants in 74 ms
[2024-06-07 15:09:03] [INFO ] Implicit Places using invariants in 949 ms returned []
[2024-06-07 15:09:03] [INFO ] Invariant cache hit.
[2024-06-07 15:09:04] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2024-06-07 15:09:04] [INFO ] Invariant cache hit.
[2024-06-07 15:09:09] [INFO ] Dead Transitions using invariants and state equation in 5102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/104 places, 6989/8014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7218 ms. Remains : 102/104 places, 6989/8014 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p3), (NOT p3), (NOT p3), true, (NOT p2), (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s35 1) (EQ s40 1) (EQ s49 1) (EQ s60 1) (EQ s65 1) (EQ s73 1) (EQ s84 1) (EQ s92 1) (EQ s100 1)), p3:(AND (EQ s21 1) (EQ s35 1) (EQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResIsolation-PT-N09P1-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N09P1-LTLFireability-12 finished in 7484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U p1))||(X(p3)&&p2))))'
Support contains 28 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 8013
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 8013
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 258 place count 103 transition count 7757
Applied a total of 258 rules in 96 ms. Remains 103 /104 variables (removed 1) and now considering 7757/8014 (removed 257) transitions.
// Phase 1: matrix 7757 rows 103 cols
[2024-06-07 15:09:10] [INFO ] Computed 0 invariants in 136 ms
[2024-06-07 15:09:10] [INFO ] Implicit Places using invariants in 853 ms returned []
[2024-06-07 15:09:10] [INFO ] Invariant cache hit.
[2024-06-07 15:09:12] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 2017 ms to find 0 implicit places.
[2024-06-07 15:09:12] [INFO ] Invariant cache hit.
[2024-06-07 15:09:16] [INFO ] Dead Transitions using invariants and state equation in 4711 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 103/104 places, 7757/8014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6832 ms. Remains : 103/104 places, 7757/8014 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p3) p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p2 (NOT p3) p0)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p3) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p3) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s11 1) (EQ s34 1) (EQ s42 1) (EQ s50 1) (EQ s61 1) (EQ s69 1) (EQ s77 1) (EQ s82 1) (EQ s93 1) (EQ s101 1)), p1:(AND (EQ s21 1) (EQ s37 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3135 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 1 ms.
FORMULA ResIsolation-PT-N09P1-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N09P1-LTLFireability-14 finished in 10189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((F(p0)||X(p1))))||(X(p3)&&p2))))'
Support contains 20 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 8014/8014 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 102 transition count 7501
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 7501
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 260 place count 102 transition count 7245
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 261 place count 101 transition count 6733
Iterating global reduction 1 with 1 rules applied. Total rules applied 262 place count 101 transition count 6733
Applied a total of 262 rules in 146 ms. Remains 101 /104 variables (removed 3) and now considering 6733/8014 (removed 1281) transitions.
// Phase 1: matrix 6733 rows 101 cols
[2024-06-07 15:09:20] [INFO ] Computed 0 invariants in 95 ms
[2024-06-07 15:09:20] [INFO ] Implicit Places using invariants in 712 ms returned []
[2024-06-07 15:09:21] [INFO ] Invariant cache hit.
[2024-06-07 15:09:22] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1738 ms to find 0 implicit places.
[2024-06-07 15:09:22] [INFO ] Invariant cache hit.
[2024-06-07 15:09:27] [INFO ] Dead Transitions using invariants and state equation in 5008 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/104 places, 6733/8014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6893 ms. Remains : 101/104 places, 6733/8014 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : ResIsolation-PT-N09P1-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p2:(AND (EQ s21 1) (EQ s35 1) (EQ s43 1) (EQ s51 1) (EQ s59 1) (EQ s67 1) (EQ s75 1) (EQ s83 1) (EQ s91 1) (EQ s99 1)), p1:(OR (EQ s19 0) (EQ s34 0) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2716 ms.
Product exploration explored 100000 steps with 0 reset in 2696 ms.
Computed a total of 35 stabilizing places and 45 stable transitions
Graph (complete) has 800 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.76 ms
Computed a total of 35 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0 (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 98 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 533 ms. (steps per millisecond=18 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 162834 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 162834 steps, saw 38675 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 2 properties.
[2024-06-07 15:09:36] [INFO ] Invariant cache hit.
[2024-06-07 15:09:36] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 15:09:39] [INFO ] After 2648ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-06-07 15:09:39] [INFO ] After 2920ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 158 ms.
[2024-06-07 15:09:39] [INFO ] After 3120ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 59 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 3 ms.
Support contains 17 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 6733/6733 transitions.
Graph (trivial) has 58 edges and 101 vertex of which 9 / 101 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 788 edges and 95 vertex of which 93 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.24 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 93 transition count 6695
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 48 place count 76 transition count 6693
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 48 place count 76 transition count 6691
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 74 transition count 6691
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 100 place count 50 transition count 6667
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 50 transition count 6666
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 50 transition count 6665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 49 transition count 6665
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 48 transition count 6664
Applied a total of 104 rules in 20690 ms. Remains 48 /101 variables (removed 53) and now considering 6664/6733 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20690 ms. Remains : 48/101 places, 6664/6733 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1245 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 111996 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111996 steps, saw 21932 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6664 rows 48 cols
[2024-06-07 15:10:04] [INFO ] Computed 10 invariants in 36 ms
[2024-06-07 15:10:05] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 15:10:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-07 15:10:07] [INFO ] After 2456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 15:10:07] [INFO ] After 2717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 150 ms.
[2024-06-07 15:10:07] [INFO ] After 2895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 17 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 6664/6664 transitions.
Applied a total of 0 rules in 5092 ms. Remains 48 /48 variables (removed 0) and now considering 6664/6664 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5092 ms. Remains : 48/48 places, 6664/6664 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 6664/6664 transitions.
Applied a total of 0 rules in 5046 ms. Remains 48 /48 variables (removed 0) and now considering 6664/6664 (removed 0) transitions.
[2024-06-07 15:10:18] [INFO ] Invariant cache hit.
[2024-06-07 15:10:19] [INFO ] Implicit Places using invariants in 1102 ms returned []
[2024-06-07 15:10:19] [INFO ] Invariant cache hit.
[2024-06-07 15:10:20] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 2085 ms to find 0 implicit places.
[2024-06-07 15:10:41] [INFO ] Redundant transitions in 21124 ms returned []
[2024-06-07 15:10:41] [INFO ] Invariant cache hit.
[2024-06-07 15:10:47] [INFO ] Dead Transitions using invariants and state equation in 6150 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34419 ms. Remains : 48/48 places, 6664/6664 transitions.
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 21 place count 48 transition count 6643
Applied a total of 21 rules in 2622 ms. Remains 48 /48 variables (removed 0) and now considering 6643/6664 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6643 rows 48 cols
[2024-06-07 15:10:50] [INFO ] Computed 10 invariants in 35 ms
[2024-06-07 15:10:50] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 15:10:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-07 15:10:52] [INFO ] After 2487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 15:10:52] [INFO ] After 2749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 150 ms.
[2024-06-07 15:10:53] [INFO ] After 2935ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p1 p0 (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 123 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 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 17 out of 101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 6733/6733 transitions.
Graph (complete) has 800 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.30 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 98 transition count 6723
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 91 transition count 6721
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 17 place count 91 transition count 6709
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 41 place count 79 transition count 6709
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 75 place count 62 transition count 6692
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 59 transition count 6700
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 59 transition count 6699
Applied a total of 82 rules in 1629 ms. Remains 59 /101 variables (removed 42) and now considering 6699/6733 (removed 34) transitions.
// Phase 1: matrix 6699 rows 59 cols
[2024-06-07 15:10:55] [INFO ] Computed 0 invariants in 58 ms
[2024-06-07 15:10:55] [INFO ] Implicit Places using invariants in 673 ms returned []
[2024-06-07 15:10:55] [INFO ] Invariant cache hit.
[2024-06-07 15:10:56] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1643 ms to find 0 implicit places.
[2024-06-07 15:11:22] [INFO ] Redundant transitions in 25597 ms returned []
[2024-06-07 15:11:22] [INFO ] Invariant cache hit.
[2024-06-07 15:11:26] [INFO ] Dead Transitions using invariants and state equation in 3767 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/101 places, 6699/6733 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32645 ms. Remains : 59/101 places, 6699/6733 transitions.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 186282 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186282 steps, saw 27079 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 2 properties.
[2024-06-07 15:11:30] [INFO ] Invariant cache hit.
[2024-06-07 15:11:30] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-07 15:11:32] [INFO ] After 2609ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-06-07 15:11:33] [INFO ] After 2874ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 153 ms.
[2024-06-07 15:11:33] [INFO ] After 3062ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 4 ms.
Support contains 17 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 6699/6699 transitions.
Graph (trivial) has 13 edges and 59 vertex of which 6 / 59 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 51 transition count 6682
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 51 transition count 6681
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 50 transition count 6681
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 50 transition count 6681
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 49 transition count 6680
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 49 transition count 6680
Applied a total of 16 rules in 15189 ms. Remains 49 /59 variables (removed 10) and now considering 6680/6699 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15189 ms. Remains : 49/59 places, 6680/6699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 112412 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112412 steps, saw 21853 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6680 rows 49 cols
[2024-06-07 15:11:52] [INFO ] Computed 6 invariants in 45 ms
[2024-06-07 15:11:52] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 15:11:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-07 15:11:54] [INFO ] After 2384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 15:11:55] [INFO ] State equation strengthened by 5818 read => feed constraints.
[2024-06-07 15:12:13] [INFO ] After 17989ms SMT Verify possible using 5818 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-07 15:12:14] [INFO ] After 18403ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 263 ms.
[2024-06-07 15:12:14] [INFO ] After 22152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 143 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 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 4139 ms.
Product exploration explored 100000 steps with 0 reset in 3825 ms.
Built C files in :
/tmp/ltsmin4711397261894798186
[2024-06-07 15:12:22] [INFO ] Too many transitions (6699) to apply POR reductions. Disabling POR matrices.
[2024-06-07 15:12:22] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4711397261894798186
Running compilation step : cd /tmp/ltsmin4711397261894798186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4711397261894798186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4711397261894798186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 17 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 6699/6699 transitions.
Graph (trivial) has 13 edges and 59 vertex of which 6 / 59 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 5104 ms. Remains 56 /59 variables (removed 3) and now considering 6696/6699 (removed 3) transitions.
[2024-06-07 15:12:31] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
// Phase 1: matrix 6694 rows 56 cols
[2024-06-07 15:12:31] [INFO ] Computed 0 invariants in 60 ms
[2024-06-07 15:12:31] [INFO ] Implicit Places using invariants in 761 ms returned []
[2024-06-07 15:12:31] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 15:12:31] [INFO ] Invariant cache hit.
[2024-06-07 15:12:32] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1730 ms to find 0 implicit places.
[2024-06-07 15:12:57] [INFO ] Redundant transitions in 25216 ms returned []
[2024-06-07 15:12:57] [INFO ] Flow matrix only has 6694 transitions (discarded 2 similar events)
[2024-06-07 15:12:57] [INFO ] Invariant cache hit.
[2024-06-07 15:13:04] [INFO ] Dead Transitions using invariants and state equation in 6251 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/59 places, 6696/6699 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38312 ms. Remains : 56/59 places, 6696/6699 transitions.
Built C files in :
/tmp/ltsmin5392995304683565043
[2024-06-07 15:13:04] [INFO ] Too many transitions (6696) to apply POR reductions. Disabling POR matrices.
[2024-06-07 15:13:04] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5392995304683565043
Running compilation step : cd /tmp/ltsmin5392995304683565043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5392995304683565043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5392995304683565043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 15:13:09] [INFO ] Flatten gal took : 988 ms
[2024-06-07 15:13:10] [INFO ] Flatten gal took : 974 ms
[2024-06-07 15:13:10] [INFO ] Time to serialize gal into /tmp/LTL9681292383429272019.gal : 111 ms
[2024-06-07 15:13:10] [INFO ] Time to serialize properties into /tmp/LTL13937620797806707860.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9681292383429272019.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16527989871988665494.hoa' '-atoms' '/tmp/LTL13937620797806707860.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13937620797806707860.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16527989871988665494.hoa
Detected timeout of ITS tools.
[2024-06-07 15:13:27] [INFO ] Flatten gal took : 1257 ms
[2024-06-07 15:13:28] [INFO ] Flatten gal took : 1115 ms
[2024-06-07 15:13:28] [INFO ] Time to serialize gal into /tmp/LTL4010539303577968348.gal : 120 ms
[2024-06-07 15:13:28] [INFO ] Time to serialize properties into /tmp/LTL2362041800253845818.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4010539303577968348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2362041800253845818.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((F(G((F("(((((p37==0)||(p64==0))||((p92==0)||(p120==0)))||(((p152==0)||(p176==0))||((p208==0)||(p236==0))))||((p264==0)||(p292==0...566
Formula 0 simplified : X((!"((((p37==1)&&(p68==1))&&((p96==1)&&(p124==1)))&&(((p152==1)&&(p180==1))&&((p208==1)&&(p236==1))))" | !"((p264==1)&&(p292==1))" ...550
Detected timeout of ITS tools.
[2024-06-07 15:13:44] [INFO ] Flatten gal took : 1110 ms
[2024-06-07 15:13:44] [INFO ] Applying decomposition
[2024-06-07 15:13:45] [INFO ] Flatten gal took : 1147 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9180727850584654191.txt' '-o' '/tmp/graph9180727850584654191.bin' '-w' '/tmp/graph9180727850584654191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9180727850584654191.bin' '-l' '-1' '-v' '-w' '/tmp/graph9180727850584654191.weights' '-q' '0' '-e' '0.001'
[2024-06-07 15:13:48] [INFO ] Decomposing Gal with order
[2024-06-07 15:13:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 15:13:50] [INFO ] Removed a total of 67917 redundant transitions.
[2024-06-07 15:13:50] [INFO ] Flatten gal took : 1628 ms
[2024-06-07 15:13:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 428 ms.
[2024-06-07 15:13:50] [INFO ] Time to serialize gal into /tmp/LTL9182718874899976176.gal : 46 ms
[2024-06-07 15:13:50] [INFO ] Time to serialize properties into /tmp/LTL15636050352686146414.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9182718874899976176.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15636050352686146414.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F(G((F("(((((i0.u0.p37==0)||(u9.p64==0))||((u9.p92==0)||(u7.p120==0)))||(((i4.u6.p152==0)||(u10.p176==0))||((i4.u5.p208==0)||(u9...736
Formula 0 simplified : X((!"((((i0.u0.p37==1)&&(u1.p68==1))&&((i0.u2.p96==1)&&(u3.p124==1)))&&(((i4.u6.p152==1)&&(u7.p180==1))&&((i4.u5.p208==1)&&(u9.p236=...720
Reverse transition relation is NOT exact ! Due to transitions t31_t33_t8006, t25_t27_t8010, t19_t21_t8005, t13_t15_t8011, t7_t9_t8004, t6_t12_t18_t24_t30_t...1524
Computing Next relation with stutter on 2 deadlock states
9 unique states visited
0 strongly connected components in search stack
9 transitions explored
9 items max in DFS search stack
514 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,6.96067,89248,1,0,50236,3199,115967,45428,553,14179,729596
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResIsolation-PT-N09P1-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ResIsolation-PT-N09P1-LTLFireability-15 finished in 277800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(!p0)))) U ((!p0&&X(X(X(X(!p0))))&&F(!p1))||X(X(X(X(G(!p0))))))))'
[2024-06-07 15:13:59] [INFO ] Flatten gal took : 1266 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6456153780235414150
[2024-06-07 15:14:00] [INFO ] Too many transitions (8014) to apply POR reductions. Disabling POR matrices.
[2024-06-07 15:14:00] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6456153780235414150
Running compilation step : cd /tmp/ltsmin6456153780235414150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-06-07 15:14:01] [INFO ] Applying decomposition
[2024-06-07 15:14:02] [INFO ] Flatten gal took : 1490 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2969840216642700866.txt' '-o' '/tmp/graph2969840216642700866.bin' '-w' '/tmp/graph2969840216642700866.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2969840216642700866.bin' '-l' '-1' '-v' '-w' '/tmp/graph2969840216642700866.weights' '-q' '0' '-e' '0.001'
[2024-06-07 15:14:05] [INFO ] Decomposing Gal with order
[2024-06-07 15:14:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 15:14:08] [INFO ] Removed a total of 79316 redundant transitions.
[2024-06-07 15:14:08] [INFO ] Flatten gal took : 2355 ms
[2024-06-07 15:14:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 530 ms.
[2024-06-07 15:14:09] [INFO ] Time to serialize gal into /tmp/LTLFireability3948284331703908836.gal : 33 ms
[2024-06-07 15:14:09] [INFO ] Time to serialize properties into /tmp/LTLFireability15939384884103421857.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3948284331703908836.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15939384884103421857.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F((G("(((((i2.u5.p37==1)&&(i3.u17.p67==1))&&((i2.u14.p96==1)&&(i3.u22.p123==1)))&&(((i3.u17.p151==1)&&(i3.u17.p180==1))&&((i2.u13.p...430
Formula 0 simplified : G(F!"(((((i2.u5.p37==1)&&(i3.u17.p67==1))&&((i2.u14.p96==1)&&(i3.u22.p123==1)))&&(((i3.u17.p151==1)&&(i3.u17.p180==1))&&((i2.u13.p20...422
Reverse transition relation is NOT exact ! Due to transitions t3, t9, t27, t52, t62, i1.i1.t2, i1.i1.t8, i1.i1.t14, i1.i1.t20, i1.i1.t26, i1.i1.t32, i1.i1....398
Computing Next relation with stutter on 2 deadlock states
Compilation finished in 100485 ms.
Running link step : cd /tmp/ltsmin6456153780235414150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 151 ms.
Running LTSmin : cd /tmp/ltsmin6456153780235414150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin failed to check property ResIsolation-PT-N09P1-LTLFireability-03 due to out of memory issue (code 137).
Running LTSmin : cd /tmp/ltsmin6456153780235414150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(X(X(!(LTLAPp2==true))))) U ((!(LTLAPp2==true)&&X(X(X(X(!(LTLAPp2==true)))))&&<>(!(LTLAPp3==true)))||X(X(X(X([](!(LTLAPp2==true))))))))' '--buchi-type=spotba'
LTSmin run took 1293 ms.
FORMULA ResIsolation-PT-N09P1-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin6456153780235414150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin failed to check property ResIsolation-PT-N09P1-LTLFireability-03 due to out of memory issue (code 137).
Detected timeout of ITS tools.
[2024-06-07 15:43:16] [INFO ] Applying decomposition
[2024-06-07 15:43:18] [INFO ] Flatten gal took : 1501 ms
[2024-06-07 15:43:19] [INFO ] Decomposing Gal with order
[2024-06-07 15:43:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 15:43:22] [INFO ] Removed a total of 79244 redundant transitions.
[2024-06-07 15:43:23] [INFO ] Flatten gal took : 2922 ms
[2024-06-07 15:43:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 2998 ms.
[2024-06-07 15:43:26] [INFO ] Time to serialize gal into /tmp/LTLFireability10916835075479130229.gal : 66 ms
[2024-06-07 15:43:26] [INFO ] Time to serialize properties into /tmp/LTLFireability9223882675294863713.ltl : 6 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10916835075479130229.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9223882675294863713.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(((((i0.i0.i0.i0.i0.i0.i0.i0.u9.p37==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.u10.p67==1))&&((i0.i0.i0.i0.i0.i0.i0.u11.p96==1)&&(i0.i0.i0...633
Formula 0 simplified : G(F!"(((((i0.i0.i0.i0.i0.i0.i0.i0.u9.p37==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.u10.p67==1))&&((i0.i0.i0.i0.i0.i0.i0.u11.p96==1)&&(i0.i0.i0.i...625
Reverse transition relation is NOT exact ! Due to transitions t2, u18.t3, i0.t8, i0.u17.t9, i0.i0.t14, i0.i0.u16.t15, i0.i0.i0.t20, i0.i0.i0.u15.t21, i0.i0...627
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1569 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,19.5759,255896,1,0,136556,10125,125493,225967,750,32518,292375
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResIsolation-PT-N09P1-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 3422068 ms.
BK_STOP 1717775029750
--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="ResIsolation-PT-N09P1"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ResIsolation-PT-N09P1, 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 r649-smll-171774451500028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResIsolation-PT-N09P1.tgz
mv ResIsolation-PT-N09P1 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 ;