About the Execution of LoLa+red for RERS17pb113-PT-2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8534.819 | 3600000.00 | 3798319.00 | 16508.20 | F?F?F???T?F?F??? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r327-tall-167889199100012.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is RERS17pb113-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199100012
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 18:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 18:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 15M Mar 5 18:23 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 RERS17pb113-PT-2-LTLFireability-00
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-01
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-02
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-03
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-04
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-05
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-06
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-07
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-08
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-09
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-10
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-11
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-12
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-13
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-14
FORMULA_NAME RERS17pb113-PT-2-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678930694054
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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-2
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 01:38:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 01:38:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 01:38:16] [INFO ] Load time of PNML (sax parser for PT used): 585 ms
[2023-03-16 01:38:16] [INFO ] Transformed 639 places.
[2023-03-16 01:38:16] [INFO ] Transformed 31353 transitions.
[2023-03-16 01:38:16] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 783 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA RERS17pb113-PT-2-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-2-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-2-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 639 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Applied a total of 12 rules in 201 ms. Remains 627 /639 variables (removed 12) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 01:38:16] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 01:38:16] [INFO ] Computed 13 place invariants in 101 ms
[2023-03-16 01:38:19] [INFO ] Implicit Places using invariants in 2183 ms returned []
Implicit Place search using SMT only with invariants took 2205 ms to find 0 implicit places.
[2023-03-16 01:38:19] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:38:19] [INFO ] Invariant cache hit.
[2023-03-16 01:38:27] [INFO ] Dead Transitions using invariants and state equation in 8180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 627/639 places, 31353/31353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10596 ms. Remains : 627/639 places, 31353/31353 transitions.
Support contains 55 out of 627 places after structural reductions.
[2023-03-16 01:38:28] [INFO ] Flatten gal took : 959 ms
[2023-03-16 01:38:29] [INFO ] Flatten gal took : 712 ms
[2023-03-16 01:38:30] [INFO ] Input system was already deterministic with 31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 618 ms. (steps per millisecond=16 ) properties (out of 28) seen :12
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-16 01:38:31] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:38:31] [INFO ] Invariant cache hit.
[2023-03-16 01:38:33] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:38:57] [INFO ] After 23918ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:11
[2023-03-16 01:38:57] [INFO ] State equation strengthened by 829 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 01:38:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 01:38:57] [INFO ] After 25295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 35 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 652 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 655 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 552 ms. (steps per millisecond=18 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-16 01:38:59] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 01:38:59] [INFO ] Computed 13 place invariants in 59 ms
[2023-03-16 01:38:59] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 01:39:18] [INFO ] After 18515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-16 01:39:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 01:39:37] [INFO ] After 19370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-16 01:39:38] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 01:39:43] [INFO ] After 5086ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-16 01:39:43] [INFO ] After 5087ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-16 01:39:43] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 77 ms.
Support contains 28 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 172 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-16 01:39:44] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:39:44] [INFO ] Invariant cache hit.
[2023-03-16 01:39:44] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:40:05] [INFO ] After 20630ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-16 01:40:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 01:40:25] [INFO ] After 19975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-16 01:40:25] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 01:40:30] [INFO ] After 4719ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-16 01:40:30] [INFO ] After 4720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-16 01:40:30] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 52 ms.
Support contains 24 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 166 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((X(F((X(p0) U p2)))&&p1))))'
Support contains 8 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 68 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 01:40:30] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 01:40:31] [INFO ] Computed 13 place invariants in 80 ms
[2023-03-16 01:40:32] [INFO ] Implicit Places using invariants in 1901 ms returned []
Implicit Place search using SMT only with invariants took 1903 ms to find 0 implicit places.
[2023-03-16 01:40:32] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:40:32] [INFO ] Invariant cache hit.
[2023-03-16 01:40:40] [INFO ] Dead Transitions using invariants and state equation in 7887 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9859 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 414 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s140 1) (GEQ s573 1) (GEQ s156 1) (GEQ s224 1)), p2:(AND (GEQ s378 1) (GEQ s508 1)), p0:(AND (GEQ s125 1) (GEQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 6 ms.
FORMULA RERS17pb113-PT-2-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb113-PT-2-LTLFireability-00 finished in 10403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&F((p1||G(p2))))))'
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 72 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 01:40:41] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:40:41] [INFO ] Invariant cache hit.
[2023-03-16 01:40:43] [INFO ] Implicit Places using invariants in 1780 ms returned []
Implicit Place search using SMT only with invariants took 1781 ms to find 0 implicit places.
[2023-03-16 01:40:43] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:40:43] [INFO ] Invariant cache hit.
[2023-03-16 01:40:51] [INFO ] Dead Transitions using invariants and state equation in 7906 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9765 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s151 1)), p0:(AND (GEQ s412 1) (GEQ s476 1)), p2:(AND (GEQ s284 1) (GEQ s348 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4 reset in 3020 ms.
Product exploration explored 100000 steps with 3 reset in 3046 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 334 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 01:40:58] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:40:58] [INFO ] Invariant cache hit.
[2023-03-16 01:40:58] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 01:40:58] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 01:40:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 01:41:15] [INFO ] After 16519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 01:41:15] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 01:41:23] [INFO ] After 8299ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:41:23] [INFO ] After 8300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-16 01:41:23] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 293 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 18987 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18987 steps, saw 16472 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 01:41:27] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 01:41:27] [INFO ] Computed 13 place invariants in 67 ms
[2023-03-16 01:41:27] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 01:41:27] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 01:41:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 01:41:41] [INFO ] After 13457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 01:41:41] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 01:41:47] [INFO ] After 6278ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 01:41:49] [INFO ] Deduced a trap composed of 64 places in 1023 ms of which 4 ms to minimize.
[2023-03-16 01:41:50] [INFO ] Deduced a trap composed of 40 places in 1041 ms of which 1 ms to minimize.
[2023-03-16 01:41:51] [INFO ] Deduced a trap composed of 64 places in 771 ms of which 1 ms to minimize.
[2023-03-16 01:41:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4271 ms
[2023-03-16 01:41:52] [INFO ] After 11371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-16 01:41:53] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 167 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 188 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 01:41:53] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:41:53] [INFO ] Invariant cache hit.
[2023-03-16 01:41:55] [INFO ] Implicit Places using invariants in 1777 ms returned []
Implicit Place search using SMT only with invariants took 1778 ms to find 0 implicit places.
[2023-03-16 01:41:55] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:41:55] [INFO ] Invariant cache hit.
[2023-03-16 01:42:03] [INFO ] Dead Transitions using invariants and state equation in 7938 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9907 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 600 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 01:42:03] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 01:42:04] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-16 01:42:04] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 01:42:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 01:42:21] [INFO ] After 17781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 01:42:23] [INFO ] After 19449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1314 ms.
[2023-03-16 01:42:24] [INFO ] After 20863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 376 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
[2023-03-16 01:42:25] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 01:42:25] [INFO ] Computed 13 place invariants in 54 ms
Could not prove EG (NOT p0)
[2023-03-16 01:42:40] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:42:40] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 71 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 01:42:56] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:42:56] [INFO ] Invariant cache hit.
[2023-03-16 01:42:57] [INFO ] Implicit Places using invariants in 1764 ms returned []
Implicit Place search using SMT only with invariants took 1766 ms to find 0 implicit places.
[2023-03-16 01:42:57] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:42:57] [INFO ] Invariant cache hit.
[2023-03-16 01:43:05] [INFO ] Dead Transitions using invariants and state equation in 8004 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9842 ms. Remains : 627/627 places, 31353/31353 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 445 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 20916 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20916 steps, saw 18245 distinct states, run finished after 3003 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-16 01:43:10] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:43:10] [INFO ] Invariant cache hit.
[2023-03-16 01:43:10] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 01:43:10] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 01:43:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:43:27] [INFO ] After 17153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 01:43:27] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 01:43:35] [INFO ] After 7627ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 01:43:35] [INFO ] After 7627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 01:43:35] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 15 ms.
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 322 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 18372 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18372 steps, saw 15952 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-16 01:43:39] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 01:43:39] [INFO ] Computed 13 place invariants in 51 ms
[2023-03-16 01:43:39] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:43:39] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 01:43:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 01:43:57] [INFO ] After 17333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 01:43:57] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 01:44:04] [INFO ] After 7482ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 01:44:04] [INFO ] After 7482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-16 01:44:04] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 159 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 153 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 01:44:05] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:44:05] [INFO ] Invariant cache hit.
[2023-03-16 01:44:06] [INFO ] Implicit Places using invariants in 1687 ms returned []
Implicit Place search using SMT only with invariants took 1688 ms to find 0 implicit places.
[2023-03-16 01:44:06] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:44:06] [INFO ] Invariant cache hit.
[2023-03-16 01:44:14] [INFO ] Dead Transitions using invariants and state equation in 7908 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9753 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 496 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 01:44:15] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 01:44:15] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 01:44:15] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 01:44:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:44:31] [INFO ] After 15818ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 01:44:34] [INFO ] After 18909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1938 ms.
[2023-03-16 01:44:36] [INFO ] After 20975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 346 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
[2023-03-16 01:44:37] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 01:44:37] [INFO ] Computed 13 place invariants in 62 ms
Could not prove EG (NOT p0)
[2023-03-16 01:44:52] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:44:52] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3 reset in 2757 ms.
Product exploration explored 100000 steps with 1 reset in 2793 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 217 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 01:45:13] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:45:13] [INFO ] Invariant cache hit.
[2023-03-16 01:45:21] [INFO ] Dead Transitions using invariants and state equation in 8296 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8515 ms. Remains : 627/627 places, 31353/31353 transitions.
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 73 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 01:45:22] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:45:22] [INFO ] Invariant cache hit.
[2023-03-16 01:45:23] [INFO ] Implicit Places using invariants in 1723 ms returned []
Implicit Place search using SMT only with invariants took 1723 ms to find 0 implicit places.
[2023-03-16 01:45:23] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:45:23] [INFO ] Invariant cache hit.
[2023-03-16 01:45:31] [INFO ] Dead Transitions using invariants and state equation in 7979 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9777 ms. Remains : 627/627 places, 31353/31353 transitions.
Treatment of property RERS17pb113-PT-2-LTLFireability-01 finished in 291795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((X(G(X(X(p0)))) U X(p1)) U X(p2))))'
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 69 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 01:45:33] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:45:33] [INFO ] Invariant cache hit.
[2023-03-16 01:45:34] [INFO ] Implicit Places using invariants in 1745 ms returned []
Implicit Place search using SMT only with invariants took 1746 ms to find 0 implicit places.
[2023-03-16 01:45:34] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:45:34] [INFO ] Invariant cache hit.
[2023-03-16 01:45:43] [INFO ] Dead Transitions using invariants and state equation in 8260 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10076 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 320 ms :[true, p0, p2, (AND p0 p2 p1), (AND p0 p2), (AND p0 p2 p1), (AND p0 p1), p2, p2]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p2 p0), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={} source=8 dest: 2}]], initial=7, aps=[p0:(AND (GEQ s390 1) (GEQ s410 1)), p2:(AND (GEQ s130 1) (GEQ s575 1)), p1:(AND (GEQ s289 1) (GEQ s505 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 3792 ms.
Product exploration explored 100000 steps with 20000 reset in 4082 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[p0, (AND p0 p1 p2), (AND p0 p2), (AND p0 p2 p1), (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 620 ms. (steps per millisecond=16 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-16 01:45:53] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:45:53] [INFO ] Invariant cache hit.
[2023-03-16 01:45:53] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 01:46:08] [INFO ] After 15072ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-16 01:46:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 01:46:26] [INFO ] After 18293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-16 01:46:26] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 01:46:33] [INFO ] After 6396ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-16 01:46:33] [INFO ] After 6396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-16 01:46:33] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 34 ms.
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 284 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 579 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 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 18842 steps, run timeout after 3002 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18842 steps, saw 16349 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-16 01:46:37] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 01:46:37] [INFO ] Computed 13 place invariants in 49 ms
[2023-03-16 01:46:37] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:46:54] [INFO ] After 16397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-16 01:46:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 01:47:17] [INFO ] After 23138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-16 01:47:17] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 01:47:19] [INFO ] After 1584ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-16 01:47:19] [INFO ] After 1586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-16 01:47:19] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 37 ms.
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 157 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 154 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 01:47:19] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:47:19] [INFO ] Invariant cache hit.
[2023-03-16 01:47:21] [INFO ] Implicit Places using invariants in 1780 ms returned []
Implicit Place search using SMT only with invariants took 1780 ms to find 0 implicit places.
[2023-03-16 01:47:21] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:47:21] [INFO ] Invariant cache hit.
[2023-03-16 01:47:29] [INFO ] Dead Transitions using invariants and state equation in 7906 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9843 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 543 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 01:47:29] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 01:47:30] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 01:47:46] [INFO ] After 16572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-16 01:47:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:48:06] [INFO ] After 19798ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-16 01:48:12] [INFO ] After 26072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 4158 ms.
[2023-03-16 01:48:17] [INFO ] After 30441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 249 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[p0, (AND p0 p1 p2), (AND p0 p2), (AND p0 p2 p1), (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Stuttering acceptance computed with spot in 304 ms :[p0, (AND p0 p1 p2), (AND p0 p2), (AND p0 p2 p1), (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 68 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 01:48:18] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 01:48:18] [INFO ] Computed 13 place invariants in 46 ms
[2023-03-16 01:48:19] [INFO ] Implicit Places using invariants in 1776 ms returned []
Implicit Place search using SMT only with invariants took 1777 ms to find 0 implicit places.
[2023-03-16 01:48:19] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:48:19] [INFO ] Invariant cache hit.
[2023-03-16 01:48:27] [INFO ] Dead Transitions using invariants and state equation in 7878 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9724 ms. Remains : 627/627 places, 31353/31353 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[p0, (AND p0 p1 p2), (AND p0 p2), (AND p0 p2 p1), (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-16 01:48:29] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:48:29] [INFO ] Invariant cache hit.
[2023-03-16 01:48:29] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:48:45] [INFO ] After 16389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-16 01:48:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 01:49:02] [INFO ] After 17207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-16 01:49:03] [INFO ] State equation strengthened by 829 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 01:49:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 01:49:10] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 24 ms.
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 282 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 18975 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18975 steps, saw 16462 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-16 01:49:14] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 01:49:14] [INFO ] Computed 13 place invariants in 47 ms
[2023-03-16 01:49:15] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:49:31] [INFO ] After 16971ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-16 01:49:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:49:54] [INFO ] After 22856ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-16 01:49:54] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 01:49:56] [INFO ] After 1896ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 01:49:56] [INFO ] After 1898ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-16 01:49:56] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 29 ms.
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 163 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 163 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 01:49:57] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:49:57] [INFO ] Invariant cache hit.
[2023-03-16 01:49:59] [INFO ] Implicit Places using invariants in 1785 ms returned []
Implicit Place search using SMT only with invariants took 1786 ms to find 0 implicit places.
[2023-03-16 01:49:59] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:49:59] [INFO ] Invariant cache hit.
[2023-03-16 01:50:07] [INFO ] Dead Transitions using invariants and state equation in 8007 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9959 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 495 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 01:50:07] [INFO ] Computed 13 place invariants in 46 ms
[2023-03-16 01:50:07] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 01:50:25] [INFO ] After 18161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-16 01:50:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 01:50:45] [INFO ] After 19014ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-16 01:50:49] [INFO ] After 23924ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 3881 ms.
[2023-03-16 01:50:53] [INFO ] After 27993ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND p0 (NOT p1))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[p0, (AND p0 p1 p2), (AND p0 p2), (AND p0 p2 p1), (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Stuttering acceptance computed with spot in 306 ms :[p0, (AND p0 p1 p2), (AND p0 p2), (AND p0 p2 p1), (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Stuttering acceptance computed with spot in 293 ms :[p0, (AND p0 p1 p2), (AND p0 p2), (AND p0 p2 p1), (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Product exploration explored 100000 steps with 20000 reset in 3640 ms.
Product exploration explored 100000 steps with 20000 reset in 3609 ms.
Applying partial POR strategy [true, false, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 347 ms :[p0, (AND p0 p1 p2), (AND p0 p2), (AND p0 p2 p1), (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 182 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 01:51:02] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 01:51:03] [INFO ] Computed 13 place invariants in 45 ms
[2023-03-16 01:51:11] [INFO ] Dead Transitions using invariants and state equation in 8098 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8284 ms. Remains : 627/627 places, 31353/31353 transitions.
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 65 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 01:51:11] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:51:11] [INFO ] Invariant cache hit.
[2023-03-16 01:51:12] [INFO ] Implicit Places using invariants in 1698 ms returned []
Implicit Place search using SMT only with invariants took 1700 ms to find 0 implicit places.
[2023-03-16 01:51:12] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:51:12] [INFO ] Invariant cache hit.
[2023-03-16 01:51:20] [INFO ] Dead Transitions using invariants and state equation in 8101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9867 ms. Remains : 627/627 places, 31353/31353 transitions.
Treatment of property RERS17pb113-PT-2-LTLFireability-03 finished in 348839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&(G(p2)||p1))))))'
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 68 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 01:51:21] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:51:21] [INFO ] Invariant cache hit.
[2023-03-16 01:51:23] [INFO ] Implicit Places using invariants in 1822 ms returned []
Implicit Place search using SMT only with invariants took 1823 ms to find 0 implicit places.
[2023-03-16 01:51:23] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 01:51:23] [INFO ] Invariant cache hit.
[2023-03-16 01:51:32] [INFO ] Dead Transitions using invariants and state equation in 8284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10175 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (LT s61 1) (LT s573 1)), p1:(OR (LT s378 1) (LT s431 1)), p2:(OR (LT s378 1) (LT s431 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2525 steps with 0 reset in 71 ms.
FORMULA RERS17pb113-PT-2-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb113-PT-2-LTLFireability-04 finished in 10510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 187 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 01:51:32] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 01:51:32] [INFO ] Computed 13 place invariants in 51 ms
[2023-03-16 01:51:34] [INFO ] Implicit Places using invariants in 1926 ms returned []
Implicit Place search using SMT only with invariants took 1927 ms to find 0 implicit places.
[2023-03-16 01:51:34] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:51:34] [INFO ] Invariant cache hit.
[2023-03-16 01:51:42] [INFO ] Dead Transitions using invariants and state equation in 7931 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10046 ms. Remains : 626/627 places, 31352/31353 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s29 1) (LT s469 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 2839 ms.
Product exploration explored 100000 steps with 0 reset in 2856 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19220 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19220 steps, saw 16675 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:51:51] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:51:51] [INFO ] Invariant cache hit.
[2023-03-16 01:51:52] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:52:08] [INFO ] After 16782ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:52:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 01:52:22] [INFO ] After 14163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:52:23] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 01:52:30] [INFO ] After 7547ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:52:32] [INFO ] Deduced a trap composed of 40 places in 1340 ms of which 3 ms to minimize.
[2023-03-16 01:52:34] [INFO ] Deduced a trap composed of 64 places in 1329 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 01:52:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 01:52:34] [INFO ] After 25302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 158 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19839 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19839 steps, saw 17202 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:52:37] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:52:37] [INFO ] Invariant cache hit.
[2023-03-16 01:52:37] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:52:53] [INFO ] After 15460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:52:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 01:53:08] [INFO ] After 14977ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:53:08] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 01:53:16] [INFO ] After 8075ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:53:18] [INFO ] Deduced a trap composed of 40 places in 1464 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 01:53:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 01:53:18] [INFO ] After 25133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 145 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 143 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 01:53:18] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:53:18] [INFO ] Invariant cache hit.
[2023-03-16 01:53:20] [INFO ] Implicit Places using invariants in 1753 ms returned []
Implicit Place search using SMT only with invariants took 1754 ms to find 0 implicit places.
[2023-03-16 01:53:20] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:53:20] [INFO ] Invariant cache hit.
[2023-03-16 01:53:28] [INFO ] Dead Transitions using invariants and state equation in 7911 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9811 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 474 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 01:53:28] [INFO ] Computed 13 place invariants in 49 ms
[2023-03-16 01:53:28] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 01:53:43] [INFO ] After 14314ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 01:53:43] [INFO ] After 15000ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:53:43] [INFO ] After 15089ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:53:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 01:53:58] [INFO ] After 14918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:53:59] [INFO ] After 15825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 374 ms.
[2023-03-16 01:54:00] [INFO ] After 16291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 146 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 01:54:00] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 01:54:00] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 01:54:02] [INFO ] Implicit Places using invariants in 1695 ms returned []
Implicit Place search using SMT only with invariants took 1696 ms to find 0 implicit places.
[2023-03-16 01:54:02] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:54:02] [INFO ] Invariant cache hit.
[2023-03-16 01:54:10] [INFO ] Dead Transitions using invariants and state equation in 7963 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9807 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19773 steps, run timeout after 3002 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19773 steps, saw 17145 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:54:13] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:54:13] [INFO ] Invariant cache hit.
[2023-03-16 01:54:14] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:54:29] [INFO ] After 15371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:54:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 01:54:44] [INFO ] After 14910ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:54:44] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 01:54:52] [INFO ] After 8159ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:54:54] [INFO ] Deduced a trap composed of 40 places in 1365 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 01:54:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 01:54:54] [INFO ] After 25067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 144 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 18987 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18987 steps, saw 16472 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 01:54:57] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:54:57] [INFO ] Invariant cache hit.
[2023-03-16 01:54:58] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 01:55:13] [INFO ] After 15107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 01:55:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 01:55:27] [INFO ] After 14472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 01:55:27] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 01:55:36] [INFO ] After 8421ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 01:55:37] [INFO ] Deduced a trap composed of 40 places in 1406 ms of which 0 ms to minimize.
[2023-03-16 01:55:40] [INFO ] Deduced a trap composed of 64 places in 2355 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 01:55:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 01:55:40] [INFO ] After 27396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 186 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 163 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 01:55:40] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:55:40] [INFO ] Invariant cache hit.
[2023-03-16 01:55:42] [INFO ] Implicit Places using invariants in 1763 ms returned []
Implicit Place search using SMT only with invariants took 1764 ms to find 0 implicit places.
[2023-03-16 01:55:42] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:55:42] [INFO ] Invariant cache hit.
[2023-03-16 01:55:50] [INFO ] Dead Transitions using invariants and state equation in 8191 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10122 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2958 ms.
Product exploration explored 100000 steps with 0 reset in 3048 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 149 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 01:55:57] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:55:57] [INFO ] Invariant cache hit.
[2023-03-16 01:55:59] [INFO ] Implicit Places using invariants in 1749 ms returned []
Implicit Place search using SMT only with invariants took 1749 ms to find 0 implicit places.
[2023-03-16 01:55:59] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:55:59] [INFO ] Invariant cache hit.
[2023-03-16 01:56:06] [INFO ] Dead Transitions using invariants and state equation in 7916 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9816 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-2-LTLFireability-05 finished in 275701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(G(F(!p0))||G(p1)))))'
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 358 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 01:56:08] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:56:08] [INFO ] Invariant cache hit.
[2023-03-16 01:56:10] [INFO ] Implicit Places using invariants in 1797 ms returned []
Implicit Place search using SMT only with invariants took 1798 ms to find 0 implicit places.
[2023-03-16 01:56:10] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:56:10] [INFO ] Invariant cache hit.
[2023-03-16 01:56:18] [INFO ] Dead Transitions using invariants and state equation in 7855 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10012 ms. Remains : 626/627 places, 31352/31353 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s197 1) (GEQ s425 1)), p1:(OR (LT s178 1) (LT s312 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 2959 ms.
Product exploration explored 100000 steps with 0 reset in 3127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 354 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 351 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 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 19421 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19421 steps, saw 16853 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 01:56:28] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:56:28] [INFO ] Invariant cache hit.
[2023-03-16 01:56:28] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:56:46] [INFO ] After 17961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 01:56:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:57:08] [INFO ] After 21336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 01:57:08] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 01:57:11] [INFO ] After 3489ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 01:57:11] [INFO ] After 3489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-16 01:57:11] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 161 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 18320 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18320 steps, saw 15905 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 01:57:15] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:57:15] [INFO ] Invariant cache hit.
[2023-03-16 01:57:15] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 01:57:35] [INFO ] After 19935ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 01:57:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:57:56] [INFO ] After 21167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 01:57:56] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 01:58:00] [INFO ] After 3630ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 01:58:00] [INFO ] After 3630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-16 01:58:00] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 159 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 165 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 01:58:00] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:58:00] [INFO ] Invariant cache hit.
[2023-03-16 01:58:02] [INFO ] Implicit Places using invariants in 1685 ms returned []
Implicit Place search using SMT only with invariants took 1686 ms to find 0 implicit places.
[2023-03-16 01:58:02] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:58:02] [INFO ] Invariant cache hit.
[2023-03-16 01:58:10] [INFO ] Dead Transitions using invariants and state equation in 8114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9973 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 308 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-16 01:58:11] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:58:11] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 147 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 01:58:26] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:58:26] [INFO ] Invariant cache hit.
[2023-03-16 01:58:28] [INFO ] Implicit Places using invariants in 1685 ms returned []
Implicit Place search using SMT only with invariants took 1686 ms to find 0 implicit places.
[2023-03-16 01:58:28] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:58:28] [INFO ] Invariant cache hit.
[2023-03-16 01:58:36] [INFO ] Dead Transitions using invariants and state equation in 7820 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9656 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 331 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 19030 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19030 steps, saw 16508 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 01:58:40] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:58:40] [INFO ] Invariant cache hit.
[2023-03-16 01:58:40] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:59:00] [INFO ] After 19908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 01:59:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:59:20] [INFO ] After 20402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 01:59:20] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 01:59:25] [INFO ] After 4422ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 01:59:25] [INFO ] After 4423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-16 01:59:25] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 144 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 19118 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19118 steps, saw 16587 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 01:59:29] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 01:59:29] [INFO ] Invariant cache hit.
[2023-03-16 01:59:29] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 01:59:47] [INFO ] After 17957ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 01:59:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:00:08] [INFO ] After 21369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 02:00:08] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:00:12] [INFO ] After 3448ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 02:00:12] [INFO ] After 3449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 02:00:12] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 162 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 162 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:00:12] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:00:12] [INFO ] Invariant cache hit.
[2023-03-16 02:00:14] [INFO ] Implicit Places using invariants in 1700 ms returned []
Implicit Place search using SMT only with invariants took 1701 ms to find 0 implicit places.
[2023-03-16 02:00:14] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:00:14] [INFO ] Invariant cache hit.
[2023-03-16 02:00:22] [INFO ] Dead Transitions using invariants and state equation in 7916 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9781 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 295 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-16 02:00:22] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:00:22] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 2755 ms.
Product exploration explored 100000 steps with 0 reset in 2774 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 148 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:00:43] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:00:43] [INFO ] Invariant cache hit.
[2023-03-16 02:00:45] [INFO ] Implicit Places using invariants in 1671 ms returned []
Implicit Place search using SMT only with invariants took 1673 ms to find 0 implicit places.
[2023-03-16 02:00:45] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:00:45] [INFO ] Invariant cache hit.
[2023-03-16 02:00:53] [INFO ] Dead Transitions using invariants and state equation in 7964 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9787 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-2-LTLFireability-06 finished in 286291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 157 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 02:00:54] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:00:54] [INFO ] Invariant cache hit.
[2023-03-16 02:00:56] [INFO ] Implicit Places using invariants in 1816 ms returned []
Implicit Place search using SMT only with invariants took 1816 ms to find 0 implicit places.
[2023-03-16 02:00:56] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:00:56] [INFO ] Invariant cache hit.
[2023-03-16 02:01:04] [INFO ] Dead Transitions using invariants and state equation in 7975 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9948 ms. Remains : 626/627 places, 31352/31353 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-07 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 (GEQ s47 1) (GEQ s578 1) (GEQ s182 1) (GEQ s483 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2807 ms.
Product exploration explored 100000 steps with 0 reset in 2978 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19779 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19779 steps, saw 17150 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:01:13] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:01:13] [INFO ] Invariant cache hit.
[2023-03-16 02:01:13] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:01:32] [INFO ] After 18626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:01:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:01:50] [INFO ] After 17484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:01:50] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:01:56] [INFO ] After 6714ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:01:58] [INFO ] Deduced a trap composed of 65 places in 1151 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 02:01:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 02:01:58] [INFO ] After 26072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 280 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19298 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19298 steps, saw 16744 distinct states, run finished after 3003 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:02:02] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:02:02] [INFO ] Invariant cache hit.
[2023-03-16 02:02:02] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:02:19] [INFO ] After 17276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:02:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:02:36] [INFO ] After 17097ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:02:37] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:02:43] [INFO ] After 6538ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:02:45] [INFO ] Deduced a trap composed of 65 places in 1156 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 02:02:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 02:02:45] [INFO ] After 25484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 142 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 141 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:02:45] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:02:45] [INFO ] Invariant cache hit.
[2023-03-16 02:02:47] [INFO ] Implicit Places using invariants in 1715 ms returned []
Implicit Place search using SMT only with invariants took 1716 ms to find 0 implicit places.
[2023-03-16 02:02:47] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:02:47] [INFO ] Invariant cache hit.
[2023-03-16 02:02:55] [INFO ] Dead Transitions using invariants and state equation in 8354 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10214 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-16 02:02:55] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:02:55] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 145 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:03:11] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:03:11] [INFO ] Invariant cache hit.
[2023-03-16 02:03:12] [INFO ] Implicit Places using invariants in 1718 ms returned []
Implicit Place search using SMT only with invariants took 1719 ms to find 0 implicit places.
[2023-03-16 02:03:12] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:03:12] [INFO ] Invariant cache hit.
[2023-03-16 02:03:20] [INFO ] Dead Transitions using invariants and state equation in 7859 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9723 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19572 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19572 steps, saw 16981 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:03:24] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:03:24] [INFO ] Invariant cache hit.
[2023-03-16 02:03:24] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:03:41] [INFO ] After 16784ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:03:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:03:57] [INFO ] After 16771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:03:58] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:04:04] [INFO ] After 6796ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:04:06] [INFO ] Deduced a trap composed of 65 places in 1193 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 02:04:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 02:04:06] [INFO ] After 25488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 168 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19645 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19645 steps, saw 17039 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:04:10] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:04:10] [INFO ] Invariant cache hit.
[2023-03-16 02:04:10] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:04:29] [INFO ] After 19463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:04:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:04:48] [INFO ] After 19231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:04:49] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:04:54] [INFO ] After 5617ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 02:04:54] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 151 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 148 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:04:55] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:04:55] [INFO ] Invariant cache hit.
[2023-03-16 02:04:56] [INFO ] Implicit Places using invariants in 1830 ms returned []
Implicit Place search using SMT only with invariants took 1831 ms to find 0 implicit places.
[2023-03-16 02:04:56] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:04:56] [INFO ] Invariant cache hit.
[2023-03-16 02:05:04] [INFO ] Dead Transitions using invariants and state equation in 7985 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9970 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-16 02:05:05] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:05:05] [INFO ] Invariant cache hit.
[2023-03-16 02:05:20] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 3024 ms.
Product exploration explored 100000 steps with 0 reset in 3090 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 153 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:05:26] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:05:26] [INFO ] Invariant cache hit.
[2023-03-16 02:05:28] [INFO ] Implicit Places using invariants in 1762 ms returned []
Implicit Place search using SMT only with invariants took 1763 ms to find 0 implicit places.
[2023-03-16 02:05:28] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:05:28] [INFO ] Invariant cache hit.
[2023-03-16 02:05:36] [INFO ] Dead Transitions using invariants and state equation in 8031 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9947 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-2-LTLFireability-07 finished in 282930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 70 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 02:05:37] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 02:05:37] [INFO ] Computed 13 place invariants in 49 ms
[2023-03-16 02:05:39] [INFO ] Implicit Places using invariants in 2008 ms returned []
Implicit Place search using SMT only with invariants took 2009 ms to find 0 implicit places.
[2023-03-16 02:05:39] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:05:39] [INFO ] Invariant cache hit.
[2023-03-16 02:05:48] [INFO ] Dead Transitions using invariants and state equation in 8630 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10710 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s175 1) (LT s620 1)), p1:(OR (LT s70 1) (LT s339 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3860 ms.
Product exploration explored 100000 steps with 50000 reset in 3844 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 7 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS17pb113-PT-2-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS17pb113-PT-2-LTLFireability-08 finished in 18876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 73 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 02:05:56] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:05:56] [INFO ] Invariant cache hit.
[2023-03-16 02:05:58] [INFO ] Implicit Places using invariants in 1875 ms returned []
Implicit Place search using SMT only with invariants took 1875 ms to find 0 implicit places.
[2023-03-16 02:05:58] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:05:58] [INFO ] Invariant cache hit.
[2023-03-16 02:06:06] [INFO ] Dead Transitions using invariants and state equation in 8221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10170 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s382 1) (GEQ s614 1)), p0:(OR (LT s55 1) (LT s474 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 3044 ms.
Product exploration explored 100000 steps with 1 reset in 3112 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 261 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 21346 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21346 steps, saw 18626 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 02:06:16] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:06:16] [INFO ] Invariant cache hit.
[2023-03-16 02:06:16] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:06:34] [INFO ] After 17345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 02:06:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-16 02:06:51] [INFO ] After 17260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 02:06:51] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 02:06:59] [INFO ] After 7515ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 02:06:59] [INFO ] After 7516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-16 02:06:59] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 293 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 19005 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19005 steps, saw 16487 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 02:07:02] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 02:07:03] [INFO ] Computed 13 place invariants in 51 ms
[2023-03-16 02:07:03] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:07:19] [INFO ] After 16115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 02:07:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-16 02:07:37] [INFO ] After 17800ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 02:07:37] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:07:44] [INFO ] After 7027ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 02:07:44] [INFO ] After 7028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 02:07:44] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 204 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 201 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:07:44] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:07:44] [INFO ] Invariant cache hit.
[2023-03-16 02:07:46] [INFO ] Implicit Places using invariants in 1882 ms returned []
Implicit Place search using SMT only with invariants took 1883 ms to find 0 implicit places.
[2023-03-16 02:07:46] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:07:46] [INFO ] Invariant cache hit.
[2023-03-16 02:07:55] [INFO ] Dead Transitions using invariants and state equation in 8786 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10879 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 307 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 78 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 02:07:56] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 02:07:56] [INFO ] Computed 13 place invariants in 52 ms
[2023-03-16 02:07:57] [INFO ] Implicit Places using invariants in 1854 ms returned []
Implicit Place search using SMT only with invariants took 1858 ms to find 0 implicit places.
[2023-03-16 02:07:57] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:07:57] [INFO ] Invariant cache hit.
[2023-03-16 02:08:06] [INFO ] Dead Transitions using invariants and state equation in 8421 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10358 ms. Remains : 627/627 places, 31353/31353 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 242 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:08:07] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:08:07] [INFO ] Invariant cache hit.
[2023-03-16 02:08:07] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-16 02:08:22] [INFO ] After 15377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:08:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:08:38] [INFO ] After 15232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:08:38] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 02:08:47] [INFO ] After 9581ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 02:08:47] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 294 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19650 steps, run timeout after 3002 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19650 steps, saw 17043 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:08:51] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 02:08:51] [INFO ] Computed 13 place invariants in 53 ms
[2023-03-16 02:08:51] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:09:08] [INFO ] After 16452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:09:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:09:23] [INFO ] After 15066ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:09:23] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:09:28] [INFO ] After 5357ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:09:29] [INFO ] Deduced a trap composed of 48 places in 776 ms of which 1 ms to minimize.
[2023-03-16 02:09:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1632 ms
[2023-03-16 02:09:30] [INFO ] After 7266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 362 ms.
[2023-03-16 02:09:30] [INFO ] After 22871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 154 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 153 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:09:31] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:09:31] [INFO ] Invariant cache hit.
[2023-03-16 02:09:32] [INFO ] Implicit Places using invariants in 1641 ms returned []
Implicit Place search using SMT only with invariants took 1646 ms to find 0 implicit places.
[2023-03-16 02:09:32] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:09:32] [INFO ] Invariant cache hit.
[2023-03-16 02:09:40] [INFO ] Dead Transitions using invariants and state equation in 7817 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9621 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 474 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 02:09:41] [INFO ] Computed 13 place invariants in 49 ms
[2023-03-16 02:09:41] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:09:55] [INFO ] After 13661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:09:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:10:08] [INFO ] After 13773ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:10:10] [INFO ] After 14962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 744 ms.
[2023-03-16 02:10:10] [INFO ] After 15796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 251 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2 reset in 2727 ms.
Product exploration explored 100000 steps with 2 reset in 2749 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 154 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 02:10:17] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 02:10:17] [INFO ] Computed 13 place invariants in 50 ms
[2023-03-16 02:10:25] [INFO ] Dead Transitions using invariants and state equation in 8085 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8242 ms. Remains : 627/627 places, 31353/31353 transitions.
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 66 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 02:10:25] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:10:25] [INFO ] Invariant cache hit.
[2023-03-16 02:10:27] [INFO ] Implicit Places using invariants in 1705 ms returned []
Implicit Place search using SMT only with invariants took 1706 ms to find 0 implicit places.
[2023-03-16 02:10:27] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:10:27] [INFO ] Invariant cache hit.
[2023-03-16 02:10:35] [INFO ] Dead Transitions using invariants and state equation in 7861 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9634 ms. Remains : 627/627 places, 31353/31353 transitions.
Treatment of property RERS17pb113-PT-2-LTLFireability-09 finished in 279743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(((p0 U p1)||F((G(F(!p2))||(!p1&&F(!p2))))))))'
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 247 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 02:10:36] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 02:10:36] [INFO ] Computed 13 place invariants in 49 ms
[2023-03-16 02:10:37] [INFO ] Implicit Places using invariants in 1764 ms returned []
Implicit Place search using SMT only with invariants took 1765 ms to find 0 implicit places.
[2023-03-16 02:10:38] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:10:38] [INFO ] Invariant cache hit.
[2023-03-16 02:10:46] [INFO ] Dead Transitions using invariants and state equation in 8826 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10841 ms. Remains : 626/627 places, 31352/31353 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), p2, (AND (NOT p1) p2)]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s79 1) (GEQ s565 1)), p1:(AND (GEQ s62 1) (GEQ s82 1)), p2:(AND (GEQ s245 1) (GEQ s466 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 2818 ms.
Product exploration explored 100000 steps with 0 reset in 2953 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 461 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), p2, (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:10:54] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:10:54] [INFO ] Invariant cache hit.
[2023-03-16 02:10:54] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:11:10] [INFO ] After 16734ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F p2), (F p0), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 11 factoid took 618 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), p2]
[2023-03-16 02:11:11] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:11:11] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 65 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:11:26] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:11:26] [INFO ] Invariant cache hit.
[2023-03-16 02:11:28] [INFO ] Implicit Places using invariants in 1629 ms returned []
Implicit Place search using SMT only with invariants took 1631 ms to find 0 implicit places.
[2023-03-16 02:11:28] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:11:28] [INFO ] Invariant cache hit.
[2023-03-16 02:11:36] [INFO ] Dead Transitions using invariants and state equation in 7833 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9531 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 260 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:11:37] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:11:37] [INFO ] Invariant cache hit.
[2023-03-16 02:11:37] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:11:53] [INFO ] After 16160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:11:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:12:10] [INFO ] After 16862ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:12:10] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:12:18] [INFO ] After 8002ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 02:12:18] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 156 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19806 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19806 steps, saw 17173 distinct states, run finished after 3003 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:12:22] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:12:22] [INFO ] Invariant cache hit.
[2023-03-16 02:12:22] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:12:40] [INFO ] After 18934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:12:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:13:01] [INFO ] After 20433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:13:01] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:13:06] [INFO ] After 4404ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 02:13:06] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 164 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 164 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:13:06] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:13:06] [INFO ] Invariant cache hit.
[2023-03-16 02:13:08] [INFO ] Implicit Places using invariants in 1885 ms returned []
Implicit Place search using SMT only with invariants took 1886 ms to find 0 implicit places.
[2023-03-16 02:13:08] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:13:08] [INFO ] Invariant cache hit.
[2023-03-16 02:13:16] [INFO ] Dead Transitions using invariants and state equation in 8290 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10346 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 486 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 02:13:17] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 02:13:17] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:13:29] [INFO ] After 12684ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 02:13:30] [INFO ] After 13382ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:13:30] [INFO ] After 13484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:13:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:13:43] [INFO ] After 13061ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:13:44] [INFO ] After 13767ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 360 ms.
[2023-03-16 02:13:44] [INFO ] After 14216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) p2))]
Knowledge based reduction with 7 factoid took 421 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), p2]
[2023-03-16 02:13:45] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 02:13:45] [INFO ] Computed 13 place invariants in 48 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), p2]
Product exploration explored 100000 steps with 5 reset in 2707 ms.
Product exploration explored 100000 steps with 0 reset in 2761 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), p2]
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 141 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:14:06] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:14:06] [INFO ] Invariant cache hit.
[2023-03-16 02:14:14] [INFO ] Dead Transitions using invariants and state equation in 7937 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8079 ms. Remains : 626/626 places, 31352/31352 transitions.
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 66 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:14:14] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:14:14] [INFO ] Invariant cache hit.
[2023-03-16 02:14:16] [INFO ] Implicit Places using invariants in 1757 ms returned []
Implicit Place search using SMT only with invariants took 1757 ms to find 0 implicit places.
[2023-03-16 02:14:16] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:14:16] [INFO ] Invariant cache hit.
[2023-03-16 02:14:24] [INFO ] Dead Transitions using invariants and state equation in 7935 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9759 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-2-LTLFireability-11 finished in 229516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p0))))'
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 158 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 02:14:25] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:14:25] [INFO ] Invariant cache hit.
[2023-03-16 02:14:27] [INFO ] Implicit Places using invariants in 1831 ms returned []
Implicit Place search using SMT only with invariants took 1832 ms to find 0 implicit places.
[2023-03-16 02:14:27] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:14:27] [INFO ] Invariant cache hit.
[2023-03-16 02:14:35] [INFO ] Dead Transitions using invariants and state equation in 8052 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10043 ms. Remains : 626/627 places, 31352/31353 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), p0]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s162 1) (LT s377 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 2822 ms.
Product exploration explored 100000 steps with 0 reset in 2840 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 1) seen :0
Finished Best-First random walk after 5932 steps, including 1 resets, run visited all 1 properties in 17 ms. (steps per millisecond=348 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), p0]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), p0]
[2023-03-16 02:14:42] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:14:42] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), true]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), p0]
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 147 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:14:53] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:14:53] [INFO ] Invariant cache hit.
[2023-03-16 02:14:54] [INFO ] Implicit Places using invariants in 1663 ms returned []
Implicit Place search using SMT only with invariants took 1664 ms to find 0 implicit places.
[2023-03-16 02:14:54] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:14:54] [INFO ] Invariant cache hit.
[2023-03-16 02:15:02] [INFO ] Dead Transitions using invariants and state equation in 8133 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9947 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), p0]
Finished random walk after 7250 steps, including 2 resets, run visited all 1 properties in 217 ms. (steps per millisecond=33 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), p0]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), p0]
[2023-03-16 02:15:03] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:15:04] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), true]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), p0]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), p0]
Product exploration explored 100000 steps with 0 reset in 2714 ms.
Product exploration explored 100000 steps with 0 reset in 2790 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 148 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:15:19] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:15:19] [INFO ] Invariant cache hit.
[2023-03-16 02:15:21] [INFO ] Implicit Places using invariants in 1771 ms returned []
Implicit Place search using SMT only with invariants took 1771 ms to find 0 implicit places.
[2023-03-16 02:15:21] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:15:21] [INFO ] Invariant cache hit.
[2023-03-16 02:15:30] [INFO ] Dead Transitions using invariants and state equation in 8865 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10785 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-2-LTLFireability-13 finished in 66239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 78 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 02:15:31] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 02:15:31] [INFO ] Computed 13 place invariants in 46 ms
[2023-03-16 02:15:33] [INFO ] Implicit Places using invariants in 1834 ms returned []
Implicit Place search using SMT only with invariants took 1838 ms to find 0 implicit places.
[2023-03-16 02:15:33] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:15:33] [INFO ] Invariant cache hit.
[2023-03-16 02:15:41] [INFO ] Dead Transitions using invariants and state equation in 8211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10128 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s268 1) (GEQ s477 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 11 reset in 2707 ms.
Product exploration explored 100000 steps with 5 reset in 2815 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 8005 steps, including 2 resets, run visited all 1 properties in 237 ms. (steps per millisecond=33 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-16 02:15:48] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:15:48] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 67 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 02:16:03] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:16:03] [INFO ] Invariant cache hit.
[2023-03-16 02:16:05] [INFO ] Implicit Places using invariants in 1736 ms returned []
Implicit Place search using SMT only with invariants took 1737 ms to find 0 implicit places.
[2023-03-16 02:16:05] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:16:05] [INFO ] Invariant cache hit.
[2023-03-16 02:16:13] [INFO ] Dead Transitions using invariants and state equation in 7819 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9624 ms. Remains : 627/627 places, 31353/31353 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 7569 steps, including 2 resets, run visited all 1 properties in 212 ms. (steps per millisecond=35 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-16 02:16:14] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:16:14] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6 reset in 2688 ms.
Product exploration explored 100000 steps with 13 reset in 2739 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 162 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 02:16:35] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:16:35] [INFO ] Invariant cache hit.
[2023-03-16 02:16:43] [INFO ] Dead Transitions using invariants and state equation in 7858 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8022 ms. Remains : 627/627 places, 31353/31353 transitions.
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 67 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 02:16:43] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:16:43] [INFO ] Invariant cache hit.
[2023-03-16 02:16:44] [INFO ] Implicit Places using invariants in 1762 ms returned []
Implicit Place search using SMT only with invariants took 1763 ms to find 0 implicit places.
[2023-03-16 02:16:45] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 02:16:45] [INFO ] Invariant cache hit.
[2023-03-16 02:16:52] [INFO ] Dead Transitions using invariants and state equation in 7858 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9699 ms. Remains : 627/627 places, 31353/31353 transitions.
Treatment of property RERS17pb113-PT-2-LTLFireability-14 finished in 82179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)&&p0))))'
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 153 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 02:16:54] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 02:16:54] [INFO ] Computed 13 place invariants in 165 ms
[2023-03-16 02:16:55] [INFO ] Implicit Places using invariants in 1928 ms returned []
Implicit Place search using SMT only with invariants took 1928 ms to find 0 implicit places.
[2023-03-16 02:16:55] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:16:55] [INFO ] Invariant cache hit.
[2023-03-16 02:17:03] [INFO ] Dead Transitions using invariants and state equation in 7966 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10047 ms. Remains : 626/627 places, 31352/31353 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s47 1) (GEQ s75 1)), p0:(AND (GEQ s133 1) (GEQ s349 1)), p1:(AND (GEQ s107 1) (GEQ s615 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 2786 ms.
Product exploration explored 100000 steps with 0 reset in 2818 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (OR (AND p2 p0) (AND p0 p1)))), (X (OR (AND (NOT p2) (NOT p1)) (NOT p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (OR (AND p2 p0) (AND p0 p1))))), (X (X (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 444 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 02:17:10] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:17:10] [INFO ] Invariant cache hit.
[2023-03-16 02:17:10] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 02:17:35] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 02:17:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:18:00] [INFO ] After 24915ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 02:18:01] [INFO ] State equation strengthened by 268 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 02:18:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 02:18:01] [INFO ] After 25144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 142 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 350 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 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 19188 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19188 steps, saw 16648 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 02:18:04] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:18:04] [INFO ] Invariant cache hit.
[2023-03-16 02:18:04] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:18:29] [INFO ] After 24914ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-16 02:18:29] [INFO ] State equation strengthened by 268 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 02:18:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 02:18:29] [INFO ] After 25128ms 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 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 156 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 156 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:18:30] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:18:30] [INFO ] Invariant cache hit.
[2023-03-16 02:18:31] [INFO ] Implicit Places using invariants in 1654 ms returned []
Implicit Place search using SMT only with invariants took 1655 ms to find 0 implicit places.
[2023-03-16 02:18:31] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:18:31] [INFO ] Invariant cache hit.
[2023-03-16 02:18:39] [INFO ] Dead Transitions using invariants and state equation in 7931 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9745 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 476 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 02:18:40] [INFO ] Computed 13 place invariants in 50 ms
[2023-03-16 02:18:40] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 02:18:40] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 02:18:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:18:58] [INFO ] After 17666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 02:19:01] [INFO ] After 21035ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1669 ms.
[2023-03-16 02:19:03] [INFO ] After 22827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (OR (AND p2 p0) (AND p0 p1)))), (X (OR (AND (NOT p2) (NOT p1)) (NOT p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (OR (AND p2 p0) (AND p0 p1))))), (X (X (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 11 factoid took 502 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
[2023-03-16 02:19:04] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 02:19:04] [INFO ] Computed 13 place invariants in 49 ms
Could not prove EG (NOT p0)
[2023-03-16 02:19:19] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:19:19] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 147 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:19:34] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:19:34] [INFO ] Invariant cache hit.
[2023-03-16 02:19:36] [INFO ] Implicit Places using invariants in 1722 ms returned []
Implicit Place search using SMT only with invariants took 1723 ms to find 0 implicit places.
[2023-03-16 02:19:36] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:19:36] [INFO ] Invariant cache hit.
[2023-03-16 02:19:44] [INFO ] Dead Transitions using invariants and state equation in 7918 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9788 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 482 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 02:19:45] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:19:45] [INFO ] Invariant cache hit.
[2023-03-16 02:19:45] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:20:10] [INFO ] After 24639ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 02:20:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:20:35] [INFO ] After 24975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 02:20:35] [INFO ] State equation strengthened by 268 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 02:20:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 02:20:35] [INFO ] After 25183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 143 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 344 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 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 19521 steps, run timeout after 3002 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19521 steps, saw 16938 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 02:20:39] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:20:39] [INFO ] Invariant cache hit.
[2023-03-16 02:20:39] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:21:04] [INFO ] After 24895ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 02:21:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:21:29] [INFO ] After 24920ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 02:21:29] [INFO ] State equation strengthened by 268 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 02:21:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 02:21:29] [INFO ] After 25127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 143 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 155 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:21:29] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:21:29] [INFO ] Invariant cache hit.
[2023-03-16 02:21:31] [INFO ] Implicit Places using invariants in 1737 ms returned []
Implicit Place search using SMT only with invariants took 1738 ms to find 0 implicit places.
[2023-03-16 02:21:31] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:21:31] [INFO ] Invariant cache hit.
[2023-03-16 02:21:39] [INFO ] Dead Transitions using invariants and state equation in 7979 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9879 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 11 factoid took 508 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
[2023-03-16 02:21:39] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:21:39] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-16 02:21:54] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:21:55] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 2770 ms.
Product exploration explored 100000 steps with 0 reset in 3119 ms.
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 168 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:22:16] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:22:16] [INFO ] Invariant cache hit.
[2023-03-16 02:22:18] [INFO ] Implicit Places using invariants in 1759 ms returned []
Implicit Place search using SMT only with invariants took 1760 ms to find 0 implicit places.
[2023-03-16 02:22:18] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:22:18] [INFO ] Invariant cache hit.
[2023-03-16 02:22:25] [INFO ] Dead Transitions using invariants and state equation in 7896 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9826 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-2-LTLFireability-15 finished in 333007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&F((p1||G(p2))))))'
Found a Shortening insensitive property : RERS17pb113-PT-2-LTLFireability-01
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 176 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 02:22:27] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:22:27] [INFO ] Invariant cache hit.
[2023-03-16 02:22:29] [INFO ] Implicit Places using invariants in 1905 ms returned []
Implicit Place search using SMT only with invariants took 1910 ms to find 0 implicit places.
[2023-03-16 02:22:29] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:22:29] [INFO ] Invariant cache hit.
[2023-03-16 02:22:37] [INFO ] Dead Transitions using invariants and state equation in 8550 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10637 ms. Remains : 626/627 places, 31352/31353 transitions.
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s151 1)), p0:(AND (GEQ s412 1) (GEQ s476 1)), p2:(AND (GEQ s284 1) (GEQ s348 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2759 ms.
Product exploration explored 100000 steps with 2 reset in 2764 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 357 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 02:22:44] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:22:44] [INFO ] Invariant cache hit.
[2023-03-16 02:22:44] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:22:44] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 02:22:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:23:01] [INFO ] After 16727ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 02:23:01] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:23:09] [INFO ] After 8109ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:23:09] [INFO ] After 8110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-16 02:23:09] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 145 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 18975 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18975 steps, saw 16462 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 02:23:13] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:23:13] [INFO ] Invariant cache hit.
[2023-03-16 02:23:13] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:23:13] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 02:23:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:23:30] [INFO ] After 16647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 02:23:30] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:23:38] [INFO ] After 8201ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:23:38] [INFO ] After 8201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-16 02:23:38] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 145 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 145 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:23:38] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:23:38] [INFO ] Invariant cache hit.
[2023-03-16 02:23:40] [INFO ] Implicit Places using invariants in 1768 ms returned []
Implicit Place search using SMT only with invariants took 1769 ms to find 0 implicit places.
[2023-03-16 02:23:40] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:23:40] [INFO ] Invariant cache hit.
[2023-03-16 02:23:48] [INFO ] Dead Transitions using invariants and state equation in 7892 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9809 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 474 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 02:23:48] [INFO ] Computed 13 place invariants in 46 ms
[2023-03-16 02:23:49] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:23:49] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 02:23:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:24:06] [INFO ] After 17515ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 02:24:08] [INFO ] After 19215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1311 ms.
[2023-03-16 02:24:09] [INFO ] After 20621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 373 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
[2023-03-16 02:24:10] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 02:24:10] [INFO ] Computed 13 place invariants in 49 ms
Could not prove EG (NOT p0)
[2023-03-16 02:24:25] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:24:25] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 67 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:24:40] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:24:40] [INFO ] Invariant cache hit.
[2023-03-16 02:24:42] [INFO ] Implicit Places using invariants in 1742 ms returned []
Implicit Place search using SMT only with invariants took 1743 ms to find 0 implicit places.
[2023-03-16 02:24:42] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:24:42] [INFO ] Invariant cache hit.
[2023-03-16 02:24:50] [INFO ] Dead Transitions using invariants and state equation in 7948 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9763 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 395 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 02:24:51] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:24:51] [INFO ] Invariant cache hit.
[2023-03-16 02:24:51] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:24:51] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 02:24:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:25:05] [INFO ] After 14075ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 02:25:06] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:25:13] [INFO ] After 7440ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 02:25:15] [INFO ] Deduced a trap composed of 40 places in 1099 ms of which 1 ms to minimize.
[2023-03-16 02:25:16] [INFO ] Deduced a trap composed of 64 places in 1006 ms of which 1 ms to minimize.
[2023-03-16 02:25:17] [INFO ] Deduced a trap composed of 64 places in 791 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 02:25:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 02:25:17] [INFO ] After 25865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 146 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:25:18] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:25:18] [INFO ] Invariant cache hit.
[2023-03-16 02:25:18] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-16 02:25:36] [INFO ] After 18338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:25:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:25:52] [INFO ] After 15402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:25:52] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:25:59] [INFO ] After 6875ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:26:00] [INFO ] Deduced a trap composed of 40 places in 342 ms of which 0 ms to minimize.
[2023-03-16 02:26:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1110 ms
[2023-03-16 02:26:01] [INFO ] After 8873ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 577 ms.
[2023-03-16 02:26:01] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 151 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19503 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19503 steps, saw 16922 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:26:05] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:26:05] [INFO ] Invariant cache hit.
[2023-03-16 02:26:05] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:26:23] [INFO ] After 17876ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:26:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:26:38] [INFO ] After 15293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:26:38] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:26:45] [INFO ] After 6899ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:26:46] [INFO ] Deduced a trap composed of 40 places in 343 ms of which 0 ms to minimize.
[2023-03-16 02:26:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1132 ms
[2023-03-16 02:26:47] [INFO ] After 8954ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 619 ms.
[2023-03-16 02:26:48] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 160 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 162 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:26:48] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:26:48] [INFO ] Invariant cache hit.
[2023-03-16 02:26:50] [INFO ] Implicit Places using invariants in 1803 ms returned []
Implicit Place search using SMT only with invariants took 1805 ms to find 0 implicit places.
[2023-03-16 02:26:50] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:26:50] [INFO ] Invariant cache hit.
[2023-03-16 02:26:58] [INFO ] Dead Transitions using invariants and state equation in 7986 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9957 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 458 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
[2023-03-16 02:26:59] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:26:59] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-16 02:27:14] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:27:14] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2 reset in 2653 ms.
Product exploration explored 100000 steps with 6 reset in 2689 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 143 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:27:35] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:27:35] [INFO ] Invariant cache hit.
[2023-03-16 02:27:42] [INFO ] Dead Transitions using invariants and state equation in 7895 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8052 ms. Remains : 626/626 places, 31352/31352 transitions.
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 64 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:27:43] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:27:43] [INFO ] Invariant cache hit.
[2023-03-16 02:27:44] [INFO ] Implicit Places using invariants in 1737 ms returned []
Implicit Place search using SMT only with invariants took 1738 ms to find 0 implicit places.
[2023-03-16 02:27:44] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:27:44] [INFO ] Invariant cache hit.
[2023-03-16 02:27:52] [INFO ] Dead Transitions using invariants and state equation in 7917 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9719 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-2-LTLFireability-01 finished in 326791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((X(G(X(X(p0)))) U X(p1)) U X(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(G(F(!p0))||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Found a Shortening insensitive property : RERS17pb113-PT-2-LTLFireability-09
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 155 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 02:27:54] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:27:54] [INFO ] Invariant cache hit.
[2023-03-16 02:27:56] [INFO ] Implicit Places using invariants in 1839 ms returned []
Implicit Place search using SMT only with invariants took 1840 ms to find 0 implicit places.
[2023-03-16 02:27:56] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:27:56] [INFO ] Invariant cache hit.
[2023-03-16 02:28:04] [INFO ] Dead Transitions using invariants and state equation in 7993 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9989 ms. Remains : 626/627 places, 31352/31353 transitions.
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s382 1) (GEQ s613 1)), p0:(OR (LT s55 1) (LT s474 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2799 ms.
Product exploration explored 100000 steps with 2 reset in 2815 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 288 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 18987 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18987 steps, saw 16472 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 02:28:13] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:28:13] [INFO ] Invariant cache hit.
[2023-03-16 02:28:14] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:28:28] [INFO ] After 14003ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 02:28:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:28:45] [INFO ] After 17146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 02:28:45] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:28:53] [INFO ] After 7668ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 02:28:53] [INFO ] After 7673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-16 02:28:53] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 158 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 18228 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18228 steps, saw 15827 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 02:28:56] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:28:56] [INFO ] Invariant cache hit.
[2023-03-16 02:28:56] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:29:10] [INFO ] After 13963ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 02:29:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:29:28] [INFO ] After 17382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 02:29:28] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:29:35] [INFO ] After 7478ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 02:29:35] [INFO ] After 7478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 02:29:35] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 145 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 144 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:29:36] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:29:36] [INFO ] Invariant cache hit.
[2023-03-16 02:29:37] [INFO ] Implicit Places using invariants in 1737 ms returned []
Implicit Place search using SMT only with invariants took 1738 ms to find 0 implicit places.
[2023-03-16 02:29:37] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:29:37] [INFO ] Invariant cache hit.
[2023-03-16 02:29:45] [INFO ] Dead Transitions using invariants and state equation in 8072 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9958 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 504 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 02:29:46] [INFO ] Computed 13 place invariants in 50 ms
[2023-03-16 02:29:46] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 02:30:03] [INFO ] After 16934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 02:30:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:30:24] [INFO ] After 20385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 02:30:26] [INFO ] After 22536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1253 ms.
[2023-03-16 02:30:27] [INFO ] After 23923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 271 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 67 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:30:28] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 02:30:28] [INFO ] Computed 13 place invariants in 50 ms
[2023-03-16 02:30:29] [INFO ] Implicit Places using invariants in 1771 ms returned []
Implicit Place search using SMT only with invariants took 1772 ms to find 0 implicit places.
[2023-03-16 02:30:29] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:30:29] [INFO ] Invariant cache hit.
[2023-03-16 02:30:37] [INFO ] Dead Transitions using invariants and state equation in 7969 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9812 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 207 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 18738 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18738 steps, saw 16263 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 02:30:41] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:30:41] [INFO ] Invariant cache hit.
[2023-03-16 02:30:42] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:30:56] [INFO ] After 14605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 02:30:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:31:13] [INFO ] After 17169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 02:31:13] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:31:21] [INFO ] After 7660ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 02:31:21] [INFO ] After 7660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-16 02:31:21] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 147 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 17911 steps, run timeout after 3001 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 17911 steps, saw 15553 distinct states, run finished after 3001 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 02:31:25] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:31:25] [INFO ] Invariant cache hit.
[2023-03-16 02:31:25] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 02:31:40] [INFO ] After 14647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 02:31:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:31:57] [INFO ] After 17542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 02:31:57] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:32:05] [INFO ] After 7272ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 02:32:05] [INFO ] After 7272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-16 02:32:05] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 164 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 167 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:32:05] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:32:05] [INFO ] Invariant cache hit.
[2023-03-16 02:32:07] [INFO ] Implicit Places using invariants in 1833 ms returned []
Implicit Place search using SMT only with invariants took 1834 ms to find 0 implicit places.
[2023-03-16 02:32:07] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:32:07] [INFO ] Invariant cache hit.
[2023-03-16 02:32:15] [INFO ] Dead Transitions using invariants and state equation in 8079 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10082 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 478 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 02:32:15] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 02:32:16] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:32:33] [INFO ] After 17336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 02:32:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 02:32:54] [INFO ] After 20885ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 02:32:56] [INFO ] After 23044ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1256 ms.
[2023-03-16 02:32:57] [INFO ] After 24423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 227 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3 reset in 2887 ms.
Product exploration explored 100000 steps with 5 reset in 2919 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 146 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:33:04] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 02:33:04] [INFO ] Computed 13 place invariants in 52 ms
[2023-03-16 02:33:12] [INFO ] Dead Transitions using invariants and state equation in 8433 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8581 ms. Remains : 626/626 places, 31352/31352 transitions.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 67 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:33:13] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:33:13] [INFO ] Invariant cache hit.
[2023-03-16 02:33:14] [INFO ] Implicit Places using invariants in 1718 ms returned []
Implicit Place search using SMT only with invariants took 1720 ms to find 0 implicit places.
[2023-03-16 02:33:14] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:33:14] [INFO ] Invariant cache hit.
[2023-03-16 02:33:23] [INFO ] Dead Transitions using invariants and state equation in 8300 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10089 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-2-LTLFireability-09 finished in 330101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(((p0 U p1)||F((G(F(!p2))||(!p1&&F(!p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : RERS17pb113-PT-2-LTLFireability-14
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 159 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 02:33:24] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:33:24] [INFO ] Invariant cache hit.
[2023-03-16 02:33:26] [INFO ] Implicit Places using invariants in 1847 ms returned []
Implicit Place search using SMT only with invariants took 1847 ms to find 0 implicit places.
[2023-03-16 02:33:26] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:33:26] [INFO ] Invariant cache hit.
[2023-03-16 02:33:34] [INFO ] Dead Transitions using invariants and state equation in 8308 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10316 ms. Remains : 626/627 places, 31352/31353 transitions.
Running random walk in product with property : RERS17pb113-PT-2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s268 1) (GEQ s477 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9 reset in 2886 ms.
Product exploration explored 100000 steps with 10 reset in 2903 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19669 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19669 steps, saw 17059 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:33:44] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:33:44] [INFO ] Invariant cache hit.
[2023-03-16 02:33:44] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:34:02] [INFO ] After 18227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:34:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:34:19] [INFO ] After 17256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:34:19] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:34:24] [INFO ] After 4160ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:34:25] [INFO ] Deduced a trap composed of 40 places in 834 ms of which 1 ms to minimize.
[2023-03-16 02:34:26] [INFO ] Deduced a trap composed of 40 places in 725 ms of which 1 ms to minimize.
[2023-03-16 02:34:27] [INFO ] Deduced a trap composed of 48 places in 599 ms of which 1 ms to minimize.
[2023-03-16 02:34:30] [INFO ] Deduced a trap composed of 64 places in 2522 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 02:34:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 02:34:30] [INFO ] After 27554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 151 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19364 steps, run timeout after 3002 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19364 steps, saw 16803 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:34:33] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:34:33] [INFO ] Invariant cache hit.
[2023-03-16 02:34:33] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:34:52] [INFO ] After 18454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:34:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:35:09] [INFO ] After 17209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:35:09] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:35:13] [INFO ] After 4068ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:35:14] [INFO ] Deduced a trap composed of 40 places in 843 ms of which 1 ms to minimize.
[2023-03-16 02:35:15] [INFO ] Deduced a trap composed of 40 places in 709 ms of which 0 ms to minimize.
[2023-03-16 02:35:16] [INFO ] Deduced a trap composed of 48 places in 591 ms of which 0 ms to minimize.
[2023-03-16 02:35:19] [INFO ] Deduced a trap composed of 64 places in 2446 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 02:35:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 02:35:19] [INFO ] After 27541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 167 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 167 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:35:19] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:35:19] [INFO ] Invariant cache hit.
[2023-03-16 02:35:21] [INFO ] Implicit Places using invariants in 1851 ms returned []
Implicit Place search using SMT only with invariants took 1851 ms to find 0 implicit places.
[2023-03-16 02:35:21] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:35:21] [INFO ] Invariant cache hit.
[2023-03-16 02:35:30] [INFO ] Dead Transitions using invariants and state equation in 8316 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10338 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-16 02:35:30] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:35:30] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 70 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:35:45] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:35:45] [INFO ] Invariant cache hit.
[2023-03-16 02:35:47] [INFO ] Implicit Places using invariants in 1753 ms returned []
Implicit Place search using SMT only with invariants took 1754 ms to find 0 implicit places.
[2023-03-16 02:35:47] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:35:47] [INFO ] Invariant cache hit.
[2023-03-16 02:35:55] [INFO ] Dead Transitions using invariants and state equation in 8282 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10107 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19600 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19600 steps, saw 17004 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 02:35:59] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:35:59] [INFO ] Invariant cache hit.
[2023-03-16 02:35:59] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 02:36:17] [INFO ] After 18071ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 02:36:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 02:36:34] [INFO ] After 16594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 02:36:34] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 02:36:38] [INFO ] After 4002ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 02:36:39] [INFO ] Deduced a trap composed of 40 places in 826 ms of which 1 ms to minimize.
[2023-03-16 02:36:40] [INFO ] Deduced a trap composed of 40 places in 721 ms of which 0 ms to minimize.
[2023-03-16 02:36:41] [INFO ] Deduced a trap composed of 48 places in 604 ms of which 0 ms to minimize.
[2023-03-16 02:36:42] [INFO ] Deduced a trap composed of 40 places in 602 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 02:36:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 02:36:42] [INFO ] After 25055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 166 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 626/626 places, 31352/31352 transitions.
Finished random walk after 5569 steps, including 1 resets, run visited all 1 properties in 168 ms. (steps per millisecond=33 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-16 02:36:43] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:36:43] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7 reset in 2802 ms.
Product exploration explored 100000 steps with 10 reset in 2817 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 143 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:37:07] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:37:07] [INFO ] Invariant cache hit.
[2023-03-16 02:37:15] [INFO ] Dead Transitions using invariants and state equation in 7937 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8085 ms. Remains : 626/626 places, 31352/31352 transitions.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 67 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 02:37:15] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:37:15] [INFO ] Invariant cache hit.
[2023-03-16 02:37:16] [INFO ] Implicit Places using invariants in 1696 ms returned []
Implicit Place search using SMT only with invariants took 1696 ms to find 0 implicit places.
[2023-03-16 02:37:16] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 02:37:16] [INFO ] Invariant cache hit.
[2023-03-16 02:37:24] [INFO ] Dead Transitions using invariants and state equation in 8015 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9778 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-2-LTLFireability-14 finished in 241671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)&&p0))))'
[2023-03-16 02:37:26] [INFO ] Flatten gal took : 631 ms
[2023-03-16 02:37:26] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-16 02:37:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 627 places, 31353 transitions and 125406 arcs took 87 ms.
Total runtime 3551352 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT RERS17pb113-PT-2
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15229516 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16035272 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:409
lola: rewrite Frontend/Parser/formula_rewrite.k:409
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: rewrite Frontend/Parser/formula_rewrite.k:544
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RERS17pb113-PT-2-LTLFireability-01: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-03: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-05: AG 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-06: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-07: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-09: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-11: CONJ 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-13: CONJ 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-14: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-15: LTL 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 12 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 10
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RERS17pb113-PT-2-LTLFireability-01: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-03: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-05: AG 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-06: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-07: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-09: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-11: CONJ 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-13: CONJ 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-14: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-15: LTL 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 17 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 10
lola: Created skeleton in 12.000000 secs.
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RERS17pb113-PT-2-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
RERS17pb113-PT-2-LTLFireability-03: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-05: AG 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-06: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-07: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-09: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-11: CONJ 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-13: CONJ 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-14: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-15: LTL 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 22 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 10
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RERS17pb113-PT-2-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
RERS17pb113-PT-2-LTLFireability-03: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-05: AG 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-06: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-07: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-09: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-11: CONJ 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-13: CONJ 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-14: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-15: LTL 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 27 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 10
lola: Created skeleton in 12.000000 secs.
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RERS17pb113-PT-2-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
RERS17pb113-PT-2-LTLFireability-03: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-05: AG 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-06: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-07: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-09: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-11: CONJ 0 0 0 0 1 0 0 0
RERS17pb113-PT-2-LTLFireability-13: CONJ 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-14: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-15: LTL 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 32 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 10
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
RERS17pb113-PT-2-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
RERS17pb113-PT-2-LTLFireability-03: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-05: AG 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-06: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-07: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-09: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-11: CONJ 0 0 0 0 1 0 0 0
RERS17pb113-PT-2-LTLFireability-13: CONJ 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-14: LTL 0 0 0 0 0 0 0 0
RERS17pb113-PT-2-LTLFireability-15: LTL 0 0 0 0 0 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 37 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 10
lola: caught signal Terminated - aborting LoLA
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
RERS17pb113-PT-2-LTLFireability-01: LTL unknown AGGR
RERS17pb113-PT-2-LTLFireability-03: LTL unknown AGGR
RERS17pb113-PT-2-LTLFireability-05: AG unknown AGGR
RERS17pb113-PT-2-LTLFireability-06: LTL unknown AGGR
RERS17pb113-PT-2-LTLFireability-07: LTL unknown AGGR
RERS17pb113-PT-2-LTLFireability-09: LTL unknown AGGR
RERS17pb113-PT-2-LTLFireability-11: CONJ unknown CONJ
RERS17pb113-PT-2-LTLFireability-13: CONJ unknown CONJ
RERS17pb113-PT-2-LTLFireability-14: LTL unknown AGGR
RERS17pb113-PT-2-LTLFireability-15: LTL unknown AGGR
Time elapsed: 40 secs. Pages in use: 0
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="RERS17pb113-PT-2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is RERS17pb113-PT-2, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r327-tall-167889199100012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb113-PT-2.tgz
mv RERS17pb113-PT-2 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;