About the Execution of 2023-gold for Sudoku-PT-AN11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2366.563 | 3600000.00 | 3865782.00 | 38271.80 | ?TT???TFFFTTFFFF | 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.r417-tall-171690556400407.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 Sudoku-PT-AN11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556400407
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 44M
-rw-r--r-- 1 mcc users 603K Apr 12 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 11:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.3M Apr 12 11:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 354K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 616K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.3M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.1M Apr 12 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Apr 12 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6M Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18M Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 82K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 203K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 746K May 18 16:43 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 Sudoku-PT-AN11-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717152365812
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN11
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 10:46:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 10:46:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 10:46:07] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-31 10:46:07] [INFO ] Transformed 1694 places.
[2024-05-31 10:46:07] [INFO ] Transformed 1331 transitions.
[2024-05-31 10:46:07] [INFO ] Found NUPN structural information;
[2024-05-31 10:46:07] [INFO ] Parsed PT model containing 1694 places and 1331 transitions and 5324 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 129 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN11-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 24 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-31 10:46:07] [INFO ] Computed 363 invariants in 45 ms
[2024-05-31 10:46:08] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-05-31 10:46:08] [INFO ] Invariant cache hit.
[2024-05-31 10:46:09] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
[2024-05-31 10:46:09] [INFO ] Invariant cache hit.
[2024-05-31 10:46:10] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2468 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Support contains 1694 out of 1694 places after structural reductions.
[2024-05-31 10:46:10] [INFO ] Flatten gal took : 160 ms
[2024-05-31 10:46:10] [INFO ] Flatten gal took : 105 ms
[2024-05-31 10:46:11] [INFO ] Input system was already deterministic with 1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1877 ms. (steps per millisecond=5 ) properties (out of 23) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 588 ms. (steps per millisecond=17 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-31 10:46:14] [INFO ] Invariant cache hit.
[2024-05-31 10:46:16] [INFO ] After 562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-31 10:46:16] [INFO ] [Nat]Absence check using 363 positive place invariants in 81 ms returned sat
[2024-05-31 10:46:18] [INFO ] After 1055ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2024-05-31 10:46:19] [INFO ] After 1578ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :5
Attempting to minimize the solution found.
Minimization took 286 ms.
[2024-05-31 10:46:19] [INFO ] After 3686ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :5
Fused 9 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 5 properties in 10 ms. (steps per millisecond=12 )
Parikh walk visited 2 properties in 15 ms.
Support contains 242 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.4 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 45 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 363/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1102 ms. (steps per millisecond=9 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Probabilistic random walk after 124341 steps, saw 74548 distinct states, run finished after 3004 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1331 rows 363 cols
[2024-05-31 10:46:24] [INFO ] Computed 32 invariants in 66 ms
[2024-05-31 10:46:24] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2024-05-31 10:46:24] [INFO ] After 519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 10:46:24] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2024-05-31 10:46:25] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-31 10:46:25] [INFO ] After 534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-31 10:46:25] [INFO ] After 757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 3 properties in 15 ms. (steps per millisecond=8 )
Parikh walk visited 3 properties in 14 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN11-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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&&G(p1))))'
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 34 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-31 10:46:26] [INFO ] Computed 363 invariants in 10 ms
[2024-05-31 10:46:26] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-05-31 10:46:26] [INFO ] Invariant cache hit.
[2024-05-31 10:46:28] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 2324 ms to find 0 implicit places.
[2024-05-31 10:46:28] [INFO ] Redundant transitions in 73 ms returned []
[2024-05-31 10:46:28] [INFO ] Invariant cache hit.
[2024-05-31 10:46:29] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3311 ms. Remains : 1694/1694 places, 1331/1331 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 190 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s1452 s1453 s1454 s1455 s1456 s1457 s1458 s1459 s1460 s1461 s1462 s1463 s1464 s1465 s1466 s1467 s1468 s1469 s1470 s1471 s1472 s1473 s1474 s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 86970 steps with 822 reset in 10001 ms.
Product exploration timeout after 85130 steps with 805 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 200 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 71 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 816 ms. (steps per millisecond=12 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:48:48] [INFO ] Invariant cache hit.
[2024-05-31 10:48:48] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 10:48:48] [INFO ] [Nat]Absence check using 363 positive place invariants in 80 ms returned sat
[2024-05-31 10:48:48] [INFO ] After 353ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G p1)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 213 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-31 10:48:49] [INFO ] Invariant cache hit.
[2024-05-31 10:48:58] [INFO ] [Real]Absence check using 363 positive place invariants in 404 ms returned sat
[2024-05-31 10:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 10:49:04] [INFO ] [Real]Absence check using state equation in 5659 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1452 out of 1694 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 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 30 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:49:04] [INFO ] Invariant cache hit.
[2024-05-31 10:49:05] [INFO ] Implicit Places using invariants in 725 ms returned []
[2024-05-31 10:49:05] [INFO ] Invariant cache hit.
[2024-05-31 10:49:06] [INFO ] Implicit Places using invariants and state equation in 1562 ms returned []
Implicit Place search using SMT with State Equation took 2290 ms to find 0 implicit places.
[2024-05-31 10:49:06] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-31 10:49:06] [INFO ] Invariant cache hit.
[2024-05-31 10:49:07] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3210 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-31 10:50:06] [INFO ] Invariant cache hit.
[2024-05-31 10:50:15] [INFO ] [Real]Absence check using 363 positive place invariants in 408 ms returned sat
[2024-05-31 10:50:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 10:50:21] [INFO ] [Real]Absence check using state equation in 5905 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration timeout after 70340 steps with 1134 reset in 10001 ms.
Product exploration timeout after 69600 steps with 1122 reset in 10001 ms.
Built C files in :
/tmp/ltsmin13308519517934036522
[2024-05-31 10:50:41] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-31 10:50:41] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:50:41] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-31 10:50:41] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:50:41] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-31 10:50:41] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:50:41] [INFO ] Built C files in 437ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13308519517934036522
Running compilation step : cd /tmp/ltsmin13308519517934036522;'/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/ltsmin13308519517934036522;'/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/ltsmin13308519517934036522;'/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 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 50 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:50:44] [INFO ] Invariant cache hit.
[2024-05-31 10:50:45] [INFO ] Implicit Places using invariants in 1229 ms returned []
[2024-05-31 10:50:45] [INFO ] Invariant cache hit.
[2024-05-31 10:50:48] [INFO ] Implicit Places using invariants and state equation in 2275 ms returned []
Implicit Place search using SMT with State Equation took 3511 ms to find 0 implicit places.
[2024-05-31 10:50:48] [INFO ] Redundant transitions in 69 ms returned []
[2024-05-31 10:50:48] [INFO ] Invariant cache hit.
[2024-05-31 10:50:49] [INFO ] Dead Transitions using invariants and state equation in 916 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4561 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin16338282130182681180
[2024-05-31 10:50:49] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-31 10:50:49] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:50:49] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-31 10:50:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:50:49] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-31 10:50:49] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:50:49] [INFO ] Built C files in 376ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16338282130182681180
Running compilation step : cd /tmp/ltsmin16338282130182681180;'/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/ltsmin16338282130182681180;'/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/ltsmin16338282130182681180;'/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-05-31 10:50:53] [INFO ] Flatten gal took : 70 ms
[2024-05-31 10:50:53] [INFO ] Flatten gal took : 67 ms
[2024-05-31 10:50:53] [INFO ] Time to serialize gal into /tmp/LTL18050754956726045730.gal : 13 ms
[2024-05-31 10:50:53] [INFO ] Time to serialize properties into /tmp/LTL1899628588424846488.prop : 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/LTL18050754956726045730.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2650557114058572020.hoa' '-atoms' '/tmp/LTL1899628588424846488.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/LTL1899628588424846488.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2650557114058572020.hoa
Detected timeout of ITS tools.
[2024-05-31 10:51:08] [INFO ] Flatten gal took : 58 ms
[2024-05-31 10:51:08] [INFO ] Flatten gal took : 57 ms
[2024-05-31 10:51:08] [INFO ] Time to serialize gal into /tmp/LTL15475612223750198958.gal : 10 ms
[2024-05-31 10:51:08] [INFO ] Time to serialize properties into /tmp/LTL8330779653653101928.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/LTL15475612223750198958.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8330779653653101928.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(("((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Cel...23336
Formula 0 simplified : G(!"((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Cell...23330
Detected timeout of ITS tools.
[2024-05-31 10:51:23] [INFO ] Flatten gal took : 87 ms
[2024-05-31 10:51:23] [INFO ] Applying decomposition
[2024-05-31 10:51:23] [INFO ] Flatten gal took : 117 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/graph4609822335707416580.txt' '-o' '/tmp/graph4609822335707416580.bin' '-w' '/tmp/graph4609822335707416580.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4609822335707416580.bin' '-l' '-1' '-v' '-w' '/tmp/graph4609822335707416580.weights' '-q' '0' '-e' '0.001'
[2024-05-31 10:51:27] [INFO ] Decomposing Gal with order
[2024-05-31 10:51:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 10:51:29] [INFO ] Flatten gal took : 2199 ms
[2024-05-31 10:51:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2024-05-31 10:51:29] [INFO ] Time to serialize gal into /tmp/LTL154492449149685953.gal : 19 ms
[2024-05-31 10:51:29] [INFO ] Time to serialize properties into /tmp/LTL6037572203929296493.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/LTL154492449149685953.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6037572203929296493.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...274
Read 1 LTL properties
Checking formula 0 : !((F(("((((((((gu0.Cells_0_0+gu0.Cells_0_1)+(gu0.Cells_0_2+gu0.Cells_0_3))+((gu0.Cells_0_4+gu0.Cells_0_5)+(gu0.Cells_0_6+gu0.Cells_0_7...30112
Formula 0 simplified : G(!"((((((((gu0.Cells_0_0+gu0.Cells_0_1)+(gu0.Cells_0_2+gu0.Cells_0_3))+((gu0.Cells_0_4+gu0.Cells_0_5)+(gu0.Cells_0_6+gu0.Cells_0_7)...30106
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8529958641972661781
[2024-05-31 10:51:44] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8529958641972661781
Running compilation step : cd /tmp/ltsmin8529958641972661781;'/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'
Compilation finished in 2936 ms.
Running link step : cd /tmp/ltsmin8529958641972661781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin8529958641972661781;'/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' '<>(((LTLAPp0==true)&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN11-LTLCardinality-00 finished in 334093 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(((p0||G(p1)) U p2)))'
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 12 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:52:00] [INFO ] Invariant cache hit.
[2024-05-31 10:52:00] [INFO ] Implicit Places using invariants in 897 ms returned []
[2024-05-31 10:52:00] [INFO ] Invariant cache hit.
[2024-05-31 10:52:02] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 2393 ms to find 0 implicit places.
[2024-05-31 10:52:02] [INFO ] Invariant cache hit.
[2024-05-31 10:52:03] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3271 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 373 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (LEQ (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 57890 steps with 28945 reset in 10002 ms.
Product exploration timeout after 58580 steps with 29290 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 690 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN11-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLCardinality-01 finished in 232761 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 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 35 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:55:52] [INFO ] Invariant cache hit.
[2024-05-31 10:55:53] [INFO ] Implicit Places using invariants in 745 ms returned []
[2024-05-31 10:55:53] [INFO ] Invariant cache hit.
[2024-05-31 10:55:55] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned []
Implicit Place search using SMT with State Equation took 2280 ms to find 0 implicit places.
[2024-05-31 10:55:55] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-31 10:55:55] [INFO ] Invariant cache hit.
[2024-05-31 10:55:56] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3183 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-03 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:(AND (LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 ...], 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 timeout after 66930 steps with 1079 reset in 10002 ms.
Product exploration timeout after 66590 steps with 1074 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 161 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 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 781 ms. (steps per millisecond=12 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:57:25] [INFO ] Invariant cache hit.
[2024-05-31 10:57:25] [INFO ] [Real]Absence check using 363 positive place invariants in 84 ms returned sat
[2024-05-31 10:57:25] [INFO ] After 660ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 10:57:26] [INFO ] [Nat]Absence check using 363 positive place invariants in 89 ms returned sat
[2024-05-31 10:57:50] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.1 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 65 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 363/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 733 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 252581 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 252581 steps, saw 128003 distinct states, run finished after 3004 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 363 cols
[2024-05-31 10:57:54] [INFO ] Computed 32 invariants in 40 ms
[2024-05-31 10:57:54] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2024-05-31 10:57:55] [INFO ] After 451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 10:57:55] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2024-05-31 10:57:55] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 10:57:55] [INFO ] After 517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-31 10:57:55] [INFO ] After 645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 257 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 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-31 10:57:56] [INFO ] Computed 363 invariants in 12 ms
[2024-05-31 10:58:07] [INFO ] [Real]Absence check using 363 positive place invariants in 406 ms returned sat
[2024-05-31 10:58:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 10:58:11] [INFO ] [Real]Absence check using state equation in 4223 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 34 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:58:11] [INFO ] Invariant cache hit.
[2024-05-31 10:58:12] [INFO ] Implicit Places using invariants in 732 ms returned []
[2024-05-31 10:58:12] [INFO ] Invariant cache hit.
[2024-05-31 10:58:13] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 2314 ms to find 0 implicit places.
[2024-05-31 10:58:13] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-31 10:58:13] [INFO ] Invariant cache hit.
[2024-05-31 10:58:14] [INFO ] Dead Transitions using invariants and state equation in 911 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3296 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 138 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 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 769 ms. (steps per millisecond=13 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:59:24] [INFO ] Invariant cache hit.
[2024-05-31 10:59:24] [INFO ] [Real]Absence check using 363 positive place invariants in 99 ms returned sat
[2024-05-31 10:59:25] [INFO ] After 720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 10:59:25] [INFO ] [Nat]Absence check using 363 positive place invariants in 84 ms returned sat
[2024-05-31 10:59:50] [INFO ] After 25007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.5 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 363/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 735 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 251532 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251532 steps, saw 127856 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 363 cols
[2024-05-31 10:59:53] [INFO ] Computed 32 invariants in 36 ms
[2024-05-31 10:59:54] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 20 ms returned sat
[2024-05-31 10:59:54] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 10:59:54] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2024-05-31 10:59:55] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 10:59:55] [INFO ] After 544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-31 10:59:55] [INFO ] After 691ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 225 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 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-31 10:59:55] [INFO ] Computed 363 invariants in 10 ms
[2024-05-31 11:00:06] [INFO ] [Real]Absence check using 363 positive place invariants in 423 ms returned sat
[2024-05-31 11:00:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 11:00:10] [INFO ] [Real]Absence check using state equation in 4022 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 66690 steps with 1075 reset in 10001 ms.
Product exploration timeout after 65520 steps with 1056 reset in 10001 ms.
Built C files in :
/tmp/ltsmin435868906847242800
[2024-05-31 11:00:31] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-31 11:00:31] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 11:00:31] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-31 11:00:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 11:00:31] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-31 11:00:31] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 11:00:31] [INFO ] Built C files in 416ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin435868906847242800
Running compilation step : cd /tmp/ltsmin435868906847242800;'/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/ltsmin435868906847242800;'/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/ltsmin435868906847242800;'/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 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 30 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 11:00:34] [INFO ] Invariant cache hit.
[2024-05-31 11:00:35] [INFO ] Implicit Places using invariants in 787 ms returned []
[2024-05-31 11:00:35] [INFO ] Invariant cache hit.
[2024-05-31 11:00:36] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 2347 ms to find 0 implicit places.
[2024-05-31 11:00:36] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-31 11:00:36] [INFO ] Invariant cache hit.
[2024-05-31 11:00:37] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3294 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin16431994645447716961
[2024-05-31 11:00:37] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2024-05-31 11:00:37] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 11:00:37] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2024-05-31 11:00:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 11:00:38] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2024-05-31 11:00:38] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 11:00:38] [INFO ] Built C files in 424ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16431994645447716961
Running compilation step : cd /tmp/ltsmin16431994645447716961;'/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/ltsmin16431994645447716961;'/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/ltsmin16431994645447716961;'/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-05-31 11:00:41] [INFO ] Flatten gal took : 104 ms
[2024-05-31 11:00:41] [INFO ] Flatten gal took : 152 ms
[2024-05-31 11:00:41] [INFO ] Time to serialize gal into /tmp/LTL15518524066273009123.gal : 18 ms
[2024-05-31 11:00:41] [INFO ] Time to serialize properties into /tmp/LTL9462596120080139852.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/LTL15518524066273009123.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12291344868857005160.hoa' '-atoms' '/tmp/LTL9462596120080139852.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/LTL9462596120080139852.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12291344868857005160.hoa
Detected timeout of ITS tools.
[2024-05-31 11:00:57] [INFO ] Flatten gal took : 123 ms
[2024-05-31 11:00:57] [INFO ] Flatten gal took : 70 ms
[2024-05-31 11:00:57] [INFO ] Time to serialize gal into /tmp/LTL4506321431865186682.gal : 32 ms
[2024-05-31 11:00:57] [INFO ] Time to serialize properties into /tmp/LTL1178005413375868601.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/LTL4506321431865186682.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1178005413375868601.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("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+...23349
Formula 0 simplified : F(G!"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+Ro...23341
Detected timeout of ITS tools.
[2024-05-31 11:01:12] [INFO ] Flatten gal took : 51 ms
[2024-05-31 11:01:12] [INFO ] Applying decomposition
[2024-05-31 11:01:12] [INFO ] Flatten gal took : 49 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/graph7425088236838555954.txt' '-o' '/tmp/graph7425088236838555954.bin' '-w' '/tmp/graph7425088236838555954.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7425088236838555954.bin' '-l' '-1' '-v' '-w' '/tmp/graph7425088236838555954.weights' '-q' '0' '-e' '0.001'
[2024-05-31 11:01:15] [INFO ] Decomposing Gal with order
[2024-05-31 11:01:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 11:01:16] [INFO ] Removed a total of 2420 redundant transitions.
[2024-05-31 11:01:17] [INFO ] Flatten gal took : 1833 ms
[2024-05-31 11:01:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-31 11:01:17] [INFO ] Time to serialize gal into /tmp/LTL11907420848449401654.gal : 26 ms
[2024-05-31 11:01:17] [INFO ] Time to serialize properties into /tmp/LTL4472652851679552250.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/LTL11907420848449401654.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4472652851679552250.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 : !((G((F("(((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(...30125
Formula 0 simplified : F(G!"(((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((...30117
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1049845494161241699
[2024-05-31 11:01:32] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1049845494161241699
Running compilation step : cd /tmp/ltsmin1049845494161241699;'/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/ltsmin1049845494161241699;'/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/ltsmin1049845494161241699;'/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 Sudoku-PT-AN11-LTLCardinality-03 finished in 342555 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((G(!p0) U X((p1 U X(p2))))))'
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 5 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 11:01:35] [INFO ] Invariant cache hit.
[2024-05-31 11:01:36] [INFO ] Implicit Places using invariants in 767 ms returned []
[2024-05-31 11:01:36] [INFO ] Invariant cache hit.
[2024-05-31 11:01:37] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2331 ms to find 0 implicit places.
[2024-05-31 11:01:37] [INFO ] Invariant cache hit.
[2024-05-31 11:01:38] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3224 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 446 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2)), (NOT p2), p0]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=p0, acceptance={} source=8 dest: 5}, { cond=(NOT p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(LEQ (ADD s1452 s1453 s1454 s1455 s1456 s1457 s1458 s1459 s1460 s1461 s1462 s1463 s1464 s1465 s1466 s1467 s1468 s1469 s1470 s1471 s1472 s1473 s1474 s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 37290 steps with 9301 reset in 10005 ms.
Product exploration timeout after 37360 steps with 9387 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1172 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2)), (NOT p2), p0]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 2096 ms. (steps per millisecond=4 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-31 11:08:13] [INFO ] Invariant cache hit.
[2024-05-31 11:08:16] [INFO ] After 513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-31 11:08:17] [INFO ] [Nat]Absence check using 363 positive place invariants in 78 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
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-05-31 11:08:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 11:08:41] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 13 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1765 ms. (steps per millisecond=5 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 653 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 133968 steps, run timeout after 9016 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 133968 steps, saw 84163 distinct states, run finished after 9016 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-31 11:08:54] [INFO ] Invariant cache hit.
[2024-05-31 11:08:55] [INFO ] [Real]Absence check using 363 positive place invariants in 82 ms returned sat
[2024-05-31 11:08:56] [INFO ] After 1173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 11:08:56] [INFO ] [Nat]Absence check using 363 positive place invariants in 87 ms returned sat
[2024-05-31 11:08:58] [INFO ] After 1049ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-31 11:08:59] [INFO ] After 1551ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 368 ms.
[2024-05-31 11:08:59] [INFO ] After 3382ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 4 properties in 26 ms. (steps per millisecond=4 )
Parikh walk visited 3 properties in 27 ms.
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 14 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1259 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 79355 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79355 steps, saw 62974 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 11:09:04] [INFO ] Invariant cache hit.
[2024-05-31 11:09:05] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 11:09:05] [INFO ] [Nat]Absence check using 363 positive place invariants in 91 ms returned sat
[2024-05-31 11:09:30] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 11 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 11:09:30] [INFO ] Invariant cache hit.
[2024-05-31 11:09:30] [INFO ] Implicit Places using invariants in 706 ms returned []
[2024-05-31 11:09:30] [INFO ] Invariant cache hit.
[2024-05-31 11:09:32] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 2281 ms to find 0 implicit places.
[2024-05-31 11:09:32] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-31 11:09:32] [INFO ] Invariant cache hit.
[2024-05-31 11:09:33] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3133 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 11 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-31 11:09:33] [INFO ] Invariant cache hit.
[2024-05-31 11:09:34] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 11:09:34] [INFO ] [Nat]Absence check using 363 positive place invariants in 90 ms returned sat
[2024-05-31 11:13:19] [INFO ] After 225010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F p0), (F (AND (NOT p1) p0)), (F (NOT p1)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 18 factoid took 5803 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (NOT p2), true]
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 12 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 11:13:25] [INFO ] Invariant cache hit.
[2024-05-31 11:13:26] [INFO ] Implicit Places using invariants in 816 ms returned []
[2024-05-31 11:13:26] [INFO ] Invariant cache hit.
[2024-05-31 11:13:27] [INFO ] Implicit Places using invariants and state equation in 1624 ms returned []
Implicit Place search using SMT with State Equation took 2445 ms to find 0 implicit places.
[2024-05-31 11:13:27] [INFO ] Invariant cache hit.
[2024-05-31 11:13:28] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3281 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p1), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 422 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (NOT p2), true]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1536 ms. (steps per millisecond=6 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 11:15:28] [INFO ] Invariant cache hit.
[2024-05-31 11:15:29] [INFO ] [Real]Absence check using 363 positive place invariants in 83 ms returned sat
[2024-05-31 11:15:54] [INFO ] After 25010ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 11:15:54] [INFO ] [Nat]Absence check using 363 positive place invariants in 78 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
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-05-31 11:16:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 11:16:19] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 17 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1684 ms. (steps per millisecond=5 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 114322 steps, run timeout after 6001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 114322 steps, saw 68835 distinct states, run finished after 6003 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-31 11:16:27] [INFO ] Invariant cache hit.
[2024-05-31 11:16:28] [INFO ] [Real]Absence check using 363 positive place invariants in 89 ms returned sat
[2024-05-31 11:16:53] [INFO ] After 25012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 11:16:53] [INFO ] [Nat]Absence check using 363 positive place invariants in 80 ms returned sat
[2024-05-31 11:17:18] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 12 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 14 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 11:17:18] [INFO ] Invariant cache hit.
[2024-05-31 11:17:19] [INFO ] Implicit Places using invariants in 792 ms returned []
[2024-05-31 11:17:19] [INFO ] Invariant cache hit.
[2024-05-31 11:17:20] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned []
Implicit Place search using SMT with State Equation took 2287 ms to find 0 implicit places.
[2024-05-31 11:17:20] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-31 11:17:20] [INFO ] Invariant cache hit.
[2024-05-31 11:17:21] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3175 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p1), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 636 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (NOT p2), true]
Product exploration timeout after 48290 steps with 16044 reset in 10002 ms.
Product exploration timeout after 47530 steps with 15771 reset in 10002 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (NOT p2), true]
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 38 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 11:17:43] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-31 11:17:43] [INFO ] Invariant cache hit.
[2024-05-31 11:17:44] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 962 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin12850744909851569427
[2024-05-31 11:17:44] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12850744909851569427
Running compilation step : cd /tmp/ltsmin12850744909851569427;'/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/ltsmin12850744909851569427;'/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/ltsmin12850744909851569427;'/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 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 12 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 11:17:47] [INFO ] Invariant cache hit.
[2024-05-31 11:17:48] [INFO ] Implicit Places using invariants in 771 ms returned []
[2024-05-31 11:17:48] [INFO ] Invariant cache hit.
[2024-05-31 11:17:49] [INFO ] Implicit Places using invariants and state equation in 1559 ms returned []
Implicit Place search using SMT with State Equation took 2332 ms to find 0 implicit places.
[2024-05-31 11:17:49] [INFO ] Invariant cache hit.
[2024-05-31 11:17:50] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3219 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin17353270017042016978
[2024-05-31 11:17:50] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17353270017042016978
Running compilation step : cd /tmp/ltsmin17353270017042016978;'/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/ltsmin17353270017042016978;'/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/ltsmin17353270017042016978;'/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-05-31 11:17:53] [INFO ] Flatten gal took : 49 ms
[2024-05-31 11:17:53] [INFO ] Flatten gal took : 49 ms
[2024-05-31 11:17:53] [INFO ] Time to serialize gal into /tmp/LTL16097450095328310128.gal : 8 ms
[2024-05-31 11:17:53] [INFO ] Time to serialize properties into /tmp/LTL15467444477055187372.prop : 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/LTL16097450095328310128.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17437357752429312494.hoa' '-atoms' '/tmp/LTL15467444477055187372.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/LTL15467444477055187372.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17437357752429312494.hoa
Detected timeout of ITS tools.
[2024-05-31 11:18:08] [INFO ] Flatten gal took : 51 ms
[2024-05-31 11:18:08] [INFO ] Flatten gal took : 52 ms
[2024-05-31 11:18:08] [INFO ] Time to serialize gal into /tmp/LTL16268846689106126849.gal : 7 ms
[2024-05-31 11:18:08] [INFO ] Time to serialize properties into /tmp/LTL13988232441979805570.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/LTL16268846689106126849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13988232441979805570.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 : !((G((G("((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(C...42709
Formula 0 simplified : F(F!"((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Cel...42701
Detected timeout of ITS tools.
[2024-05-31 11:18:24] [INFO ] Flatten gal took : 48 ms
[2024-05-31 11:18:24] [INFO ] Applying decomposition
[2024-05-31 11:18:24] [INFO ] Flatten gal took : 47 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/graph12330631213219405090.txt' '-o' '/tmp/graph12330631213219405090.bin' '-w' '/tmp/graph12330631213219405090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12330631213219405090.bin' '-l' '-1' '-v' '-w' '/tmp/graph12330631213219405090.weights' '-q' '0' '-e' '0.001'
[2024-05-31 11:18:28] [INFO ] Decomposing Gal with order
[2024-05-31 11:18:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 11:18:29] [INFO ] Removed a total of 2420 redundant transitions.
[2024-05-31 11:18:29] [INFO ] Flatten gal took : 1186 ms
[2024-05-31 11:18:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2024-05-31 11:18:30] [INFO ] Time to serialize gal into /tmp/LTL1833080093215983027.gal : 12 ms
[2024-05-31 11:18:32] [INFO ] Time to serialize properties into /tmp/LTL18257247415975342959.ltl : 2173 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/LTL1833080093215983027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18257247415975342959.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 : !((G((G("((((((((gu1.Cells_0_0+gu1.Cells_0_1)+(gu1.Cells_0_2+gu1.Cells_0_3))+((gu1.Cells_0_4+gu1.Cells_0_5)+(gu1.Cells_0_6+gu1.Cells_0...65941
Formula 0 simplified : F(F!"((((((((gu1.Cells_0_0+gu1.Cells_0_1)+(gu1.Cells_0_2+gu1.Cells_0_3))+((gu1.Cells_0_4+gu1.Cells_0_5)+(gu1.Cells_0_6+gu1.Cells_0_7...65933
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin249843715555349678
[2024-05-31 11:18:47] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin249843715555349678
Running compilation step : cd /tmp/ltsmin249843715555349678;'/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/ltsmin249843715555349678;'/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/ltsmin249843715555349678;'/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 Sudoku-PT-AN11-LTLCardinality-04 finished in 1035096 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) U (G((p1 U (X(p1)||G(!p1)))) U p1)))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 15 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 11:18:50] [INFO ] Invariant cache hit.
[2024-05-31 11:18:51] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2024-05-31 11:18:51] [INFO ] Invariant cache hit.
[2024-05-31 11:18:53] [INFO ] Implicit Places using invariants and state equation in 2031 ms returned []
Implicit Place search using SMT with State Equation took 3128 ms to find 0 implicit places.
[2024-05-31 11:18:53] [INFO ] Invariant cache hit.
[2024-05-31 11:18:54] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4002 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 368 ms :[(NOT p1), false, (NOT p1), false, false, false, p1, (AND p0 p1), true, p0]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 8}], [{ cond=(AND p1 p0), acceptance={} source=7 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=p0, acceptance={} source=9 dest: 8}, { cond=(NOT p0), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(LEQ 1 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], 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][false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 69740 steps with 1901 reset in 10002 ms.
Product exploration timeout after 69170 steps with 1981 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 357 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[true, p1, p0, (AND p1 p0), false, false, false, false, false]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1482 ms. (steps per millisecond=6 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 11:23:18] [INFO ] Invariant cache hit.
[2024-05-31 11:23:19] [INFO ] [Real]Absence check using 363 positive place invariants in 83 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
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-05-31 11:23:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 11:23:44] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 16 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1340 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Probabilistic random walk after 126459 steps, saw 76664 distinct states, run finished after 6010 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-31 11:23:52] [INFO ] Invariant cache hit.
[2024-05-31 11:23:53] [INFO ] [Real]Absence check using 363 positive place invariants in 94 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
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-05-31 11:24:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 11:24:17] [INFO ] After 25030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 15 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 30 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 11:24:17] [INFO ] Invariant cache hit.
[2024-05-31 11:24:18] [INFO ] Implicit Places using invariants in 1136 ms returned []
[2024-05-31 11:24:18] [INFO ] Invariant cache hit.
[2024-05-31 11:24:21] [INFO ] Implicit Places using invariants and state equation in 2215 ms returned []
Implicit Place search using SMT with State Equation took 3353 ms to find 0 implicit places.
[2024-05-31 11:24:21] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-31 11:24:21] [INFO ] Invariant cache hit.
[2024-05-31 11:24:22] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4310 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 14 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-31 11:24:22] [INFO ] Invariant cache hit.
[2024-05-31 11:24:22] [INFO ] [Real]Absence check using 363 positive place invariants in 83 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:218)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:279)
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-05-31 11:28:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 11:28:07] [INFO ] After 225019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1)]
Knowledge based reduction with 14 factoid took 437 ms. Reduced automaton from 9 states, 22 edges and 2 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[true, p1, p0, (AND p1 p0), false, false, false, false, false]
Stuttering acceptance computed with spot in 305 ms :[true, p1, p0, (AND p1 p0), false, false, false, false, false]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 11 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 11:28:08] [INFO ] Invariant cache hit.
[2024-05-31 11:28:09] [INFO ] Implicit Places using invariants in 1089 ms returned []
[2024-05-31 11:28:09] [INFO ] Invariant cache hit.
[2024-05-31 11:28:11] [INFO ] Implicit Places using invariants and state equation in 2150 ms returned []
Implicit Place search using SMT with State Equation took 3241 ms to find 0 implicit places.
[2024-05-31 11:28:11] [INFO ] Invariant cache hit.
[2024-05-31 11:28:12] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4092 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 202 ms. Reduced automaton from 9 states, 22 edges and 2 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[true, p1, p0, (AND p1 p0), false, false, false, false, false]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1005 ms. (steps per millisecond=9 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 11:32:14] [INFO ] Invariant cache hit.
[2024-05-31 11:32:15] [INFO ] [Real]Absence check using 363 positive place invariants in 97 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
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-05-31 11:32:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 11:32:39] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 989 ms. (steps per millisecond=10 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 119690 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119690 steps, saw 70121 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-31 11:32:44] [INFO ] Invariant cache hit.
[2024-05-31 11:32:45] [INFO ] [Real]Absence check using 363 positive place invariants in 82 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
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-05-31 11:33:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 11:33:09] [INFO ] After 25053ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 16 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 14 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 11:33:09] [INFO ] Invariant cache hit.
[2024-05-31 11:33:10] [INFO ] Implicit Places using invariants in 1103 ms returned []
[2024-05-31 11:33:10] [INFO ] Invariant cache hit.
[2024-05-31 11:33:13] [INFO ] Implicit Places using invariants and state equation in 2067 ms returned []
Implicit Place search using SMT with State Equation took 3185 ms to find 0 implicit places.
[2024-05-31 11:33:13] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-31 11:33:13] [INFO ] Invariant cache hit.
[2024-05-31 11:33:14] [INFO ] Dead Transitions using invariants and state equation in 959 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4184 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 13 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-31 11:33:14] [INFO ] Invariant cache hit.
[2024-05-31 11:33:14] [INFO ] [Real]Absence check using 363 positive place invariants in 79 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:218)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:279)
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-05-31 11:36:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 11:36:59] [INFO ] After 225023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 12 factoid took 385 ms. Reduced automaton from 9 states, 22 edges and 2 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[true, p1, p0, (AND p1 p0), false, false, false, false, false]
Stuttering acceptance computed with spot in 423 ms :[true, p1, p0, (AND p1 p0), false, false, false, false, false]
Stuttering acceptance computed with spot in 271 ms :[true, p1, p0, (AND p1 p0), false, false, false, false, false]
Product exploration timeout after 70010 steps with 662 reset in 10001 ms.
Product exploration timeout after 69460 steps with 657 reset in 10001 ms.
Applying partial POR strategy [true, true, true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 298 ms :[true, p1, p0, (AND p1 p0), false, false, false, false, false]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 11:37:21] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-31 11:37:21] [INFO ] Invariant cache hit.
[2024-05-31 11:37:22] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 915 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin4549287160116831317
[2024-05-31 11:37:22] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4549287160116831317
Running compilation step : cd /tmp/ltsmin4549287160116831317;'/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'
Compilation finished in 2910 ms.
Running link step : cd /tmp/ltsmin4549287160116831317;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4549287160116831317;'/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' '--hoa' '/tmp/stateBased7178645872533250734.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 13 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 11:37:37] [INFO ] Invariant cache hit.
[2024-05-31 11:37:38] [INFO ] Implicit Places using invariants in 1077 ms returned []
[2024-05-31 11:37:38] [INFO ] Invariant cache hit.
[2024-05-31 11:37:40] [INFO ] Implicit Places using invariants and state equation in 2101 ms returned []
Implicit Place search using SMT with State Equation took 3185 ms to find 0 implicit places.
[2024-05-31 11:37:40] [INFO ] Invariant cache hit.
[2024-05-31 11:37:41] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4064 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin3632816918894710498
[2024-05-31 11:37:41] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3632816918894710498
Running compilation step : cd /tmp/ltsmin3632816918894710498;'/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'
Compilation finished in 3002 ms.
Running link step : cd /tmp/ltsmin3632816918894710498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3632816918894710498;'/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' '--hoa' '/tmp/stateBased17300096671277882293.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 11:37:56] [INFO ] Flatten gal took : 52 ms
[2024-05-31 11:37:56] [INFO ] Flatten gal took : 51 ms
[2024-05-31 11:37:56] [INFO ] Time to serialize gal into /tmp/LTL16594356801283656849.gal : 9 ms
[2024-05-31 11:37:56] [INFO ] Time to serialize properties into /tmp/LTL2612672098371370993.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/LTL16594356801283656849.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7989702693608339334.hoa' '-atoms' '/tmp/LTL2612672098371370993.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/LTL2612672098371370993.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7989702693608339334.hoa
Detected timeout of ITS tools.
[2024-05-31 11:38:11] [INFO ] Flatten gal took : 58 ms
[2024-05-31 11:38:11] [INFO ] Flatten gal took : 53 ms
[2024-05-31 11:38:11] [INFO ] Time to serialize gal into /tmp/LTL6214625082088312670.gal : 8 ms
[2024-05-31 11:38:11] [INFO ] Time to serialize properties into /tmp/LTL4045941602055899178.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/LTL6214625082088312670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4045941602055899178.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("((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+Row...77419
Formula 0 simplified : F!"((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+Rows_...77410
Detected timeout of ITS tools.
[2024-05-31 11:38:26] [INFO ] Flatten gal took : 68 ms
[2024-05-31 11:38:26] [INFO ] Applying decomposition
[2024-05-31 11:38:26] [INFO ] Flatten gal took : 61 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/graph16991090177187108152.txt' '-o' '/tmp/graph16991090177187108152.bin' '-w' '/tmp/graph16991090177187108152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16991090177187108152.bin' '-l' '-1' '-v' '-w' '/tmp/graph16991090177187108152.weights' '-q' '0' '-e' '0.001'
[2024-05-31 11:38:37] [INFO ] Decomposing Gal with order
[2024-05-31 11:38:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 11:38:39] [INFO ] Removed a total of 1210 redundant transitions.
[2024-05-31 11:38:39] [INFO ] Flatten gal took : 1101 ms
[2024-05-31 11:38:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 1331 labels/synchronizations in 102 ms.
[2024-05-31 11:38:39] [INFO ] Time to serialize gal into /tmp/LTL2704359027784856878.gal : 8 ms
[2024-05-31 11:38:39] [INFO ] Time to serialize properties into /tmp/LTL9262564780046473683.ltl : 4 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/LTL2704359027784856878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9262564780046473683.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("((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((g...99199
Formula 0 simplified : F!"((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((gu0...99190
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14134162480239245599
[2024-05-31 11:38:54] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14134162480239245599
Running compilation step : cd /tmp/ltsmin14134162480239245599;'/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/ltsmin14134162480239245599;'/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/ltsmin14134162480239245599;'/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 Sudoku-PT-AN11-LTLCardinality-05 finished in 1207002 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((p0||X(G(p1)))))'
Support contains 242 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 12 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2024-05-31 11:38:57] [INFO ] Computed 32 invariants in 31 ms
[2024-05-31 11:38:57] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-05-31 11:38:57] [INFO ] Invariant cache hit.
[2024-05-31 11:38:59] [INFO ] Implicit Places using invariants and state equation in 1574 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
[2024-05-31 11:38:59] [INFO ] Invariant cache hit.
[2024-05-31 11:39:00] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2863 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LEQ 3 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 85330 steps with 42665 reset in 10001 ms.
Product exploration timeout after 82970 steps with 41485 reset in 10002 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN11-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLCardinality-06 finished in 37060 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))'
Support contains 2 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 362 are kept as prefixes of interest. Removing 1332 places using SCC suffix rule.7 ms
Discarding 1332 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 79 ms. Remains 362 /1694 variables (removed 1332) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 362 cols
[2024-05-31 11:39:34] [INFO ] Computed 30 invariants in 49 ms
[2024-05-31 11:39:35] [INFO ] Implicit Places using invariants in 892 ms returned []
[2024-05-31 11:39:35] [INFO ] Invariant cache hit.
[2024-05-31 11:39:38] [INFO ] Implicit Places using invariants and state equation in 3358 ms returned []
Implicit Place search using SMT with State Equation took 4257 ms to find 0 implicit places.
[2024-05-31 11:39:38] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-31 11:39:38] [INFO ] Invariant cache hit.
[2024-05-31 11:39:39] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 362/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4875 ms. Remains : 362/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s183 0) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1806 steps with 30 reset in 183 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-08 finished in 5100 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&&X(G(p1))))))'
Support contains 4 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 27 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2024-05-31 11:39:39] [INFO ] Computed 32 invariants in 42 ms
[2024-05-31 11:39:40] [INFO ] Implicit Places using invariants in 1293 ms returned []
[2024-05-31 11:39:40] [INFO ] Invariant cache hit.
[2024-05-31 11:39:44] [INFO ] Implicit Places using invariants and state equation in 3051 ms returned []
Implicit Place search using SMT with State Equation took 4357 ms to find 0 implicit places.
[2024-05-31 11:39:44] [INFO ] Invariant cache hit.
[2024-05-31 11:39:44] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5183 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s156 0) (EQ s335 1) (EQ s270 0) (EQ s24 1)), p1:(AND (EQ s335 0) (EQ s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 103 steps with 0 reset in 13 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-12 finished in 5340 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)))'
Support contains 2 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 344 are kept as prefixes of interest. Removing 1350 places using SCC suffix rule.2 ms
Discarding 1350 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 43 ms. Remains 344 /1694 variables (removed 1350) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 344 cols
[2024-05-31 11:39:45] [INFO ] Computed 24 invariants in 28 ms
[2024-05-31 11:39:45] [INFO ] Implicit Places using invariants in 530 ms returned []
[2024-05-31 11:39:45] [INFO ] Invariant cache hit.
[2024-05-31 11:39:47] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 2337 ms to find 0 implicit places.
[2024-05-31 11:39:47] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-31 11:39:47] [INFO ] Invariant cache hit.
[2024-05-31 11:39:47] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 344/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2842 ms. Remains : 344/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s34 0) (EQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 8 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-13 finished in 2913 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))))'
Support contains 3 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 364 are kept as prefixes of interest. Removing 1330 places using SCC suffix rule.4 ms
Discarding 1330 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 39 ms. Remains 364 /1694 variables (removed 1330) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 364 cols
[2024-05-31 11:39:47] [INFO ] Computed 32 invariants in 39 ms
[2024-05-31 11:39:49] [INFO ] Implicit Places using invariants in 1253 ms returned []
[2024-05-31 11:39:49] [INFO ] Invariant cache hit.
[2024-05-31 11:39:52] [INFO ] Implicit Places using invariants and state equation in 3284 ms returned []
Implicit Place search using SMT with State Equation took 4542 ms to find 0 implicit places.
[2024-05-31 11:39:52] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-31 11:39:52] [INFO ] Invariant cache hit.
[2024-05-31 11:39:53] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 364/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5374 ms. Remains : 364/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s340 1), p0:(OR (EQ s92 0) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 14 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-14 finished in 5482 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(F(p1))))||G(p2)))'
Support contains 7 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 364 are kept as prefixes of interest. Removing 1330 places using SCC suffix rule.3 ms
Discarding 1330 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 29 ms. Remains 364 /1694 variables (removed 1330) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 364 cols
[2024-05-31 11:39:53] [INFO ] Computed 32 invariants in 34 ms
[2024-05-31 11:39:54] [INFO ] Implicit Places using invariants in 1323 ms returned []
[2024-05-31 11:39:54] [INFO ] Invariant cache hit.
[2024-05-31 11:39:58] [INFO ] Implicit Places using invariants and state equation in 3683 ms returned []
Implicit Place search using SMT with State Equation took 5008 ms to find 0 implicit places.
[2024-05-31 11:39:58] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-31 11:39:58] [INFO ] Invariant cache hit.
[2024-05-31 11:39:59] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 364/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5843 ms. Remains : 364/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s152 0) (EQ s33 1)), p0:(OR (AND (OR (EQ s152 0) (EQ s33 1)) (OR (EQ s44 0) (EQ s221 1))) (EQ s240 1)), p1:(OR (EQ s81 0) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8528 steps with 82 reset in 614 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-15 finished in 6761 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&&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' '!(G((F(p0)&&F(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' '!(G((G(!p0) U X((p1 U X(p2))))))'
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) U (G((p1 U (X(p1)||G(!p1)))) U p1)))'
Found a Lengthening insensitive property : Sudoku-PT-AN11-LTLCardinality-05
Stuttering acceptance computed with spot in 372 ms :[(NOT p1), false, (NOT p1), false, false, false, p1, (AND p0 p1), true, p0]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 27 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-05-31 11:40:00] [INFO ] Computed 363 invariants in 9 ms
[2024-05-31 11:40:01] [INFO ] Implicit Places using invariants in 1070 ms returned []
[2024-05-31 11:40:01] [INFO ] Invariant cache hit.
[2024-05-31 11:40:04] [INFO ] Implicit Places using invariants and state equation in 2176 ms returned []
Implicit Place search using SMT with State Equation took 3250 ms to find 0 implicit places.
[2024-05-31 11:40:04] [INFO ] Invariant cache hit.
[2024-05-31 11:40:05] [INFO ] Dead Transitions using invariants and state equation in 881 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4160 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 8}], [{ cond=(AND p1 p0), acceptance={} source=7 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=p0, acceptance={} source=9 dest: 8}, { cond=(NOT p0), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(LEQ 1 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 69130 steps with 1912 reset in 10001 ms.
Product exploration timeout after 69110 steps with 1961 reset in 10002 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 275 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[true, p1, p0, (AND p1 p0), false, false, false, false, false]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1371 ms. (steps per millisecond=7 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 11:44:27] [INFO ] Invariant cache hit.
[2024-05-31 11:44:28] [INFO ] [Real]Absence check using 363 positive place invariants in 83 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
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-05-31 11:44:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 11:44:53] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 27 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1349 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 118100 steps, run timeout after 6001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 118100 steps, saw 69685 distinct states, run finished after 6001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-31 11:45:01] [INFO ] Invariant cache hit.
[2024-05-31 11:45:02] [INFO ] [Real]Absence check using 363 positive place invariants in 90 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
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-05-31 11:45:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 11:45:26] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 104 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 16 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 11:45:26] [INFO ] Invariant cache hit.
[2024-05-31 11:45:27] [INFO ] Implicit Places using invariants in 1080 ms returned []
[2024-05-31 11:45:27] [INFO ] Invariant cache hit.
[2024-05-31 11:45:30] [INFO ] Implicit Places using invariants and state equation in 2048 ms returned []
Implicit Place search using SMT with State Equation took 3150 ms to find 0 implicit places.
[2024-05-31 11:45:30] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-31 11:45:30] [INFO ] Invariant cache hit.
[2024-05-31 11:45:30] [INFO ] Dead Transitions using invariants and state equation in 848 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4039 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 16 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-31 11:45:30] [INFO ] Invariant cache hit.
[2024-05-31 11:45:31] [INFO ] [Real]Absence check using 363 positive place invariants in 136 ms returned sat
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 14175556 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15559416 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN11"
export BK_EXAMINATION="LTLCardinality"
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 Sudoku-PT-AN11, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556400407"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN11.tgz
mv Sudoku-PT-AN11 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;