About the Execution of LTSMin+red for RERS17pb115-PT-8
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10860.955 | 3600000.00 | 3947908.00 | 7972.90 | ?F?F?F???TFFFT?? | 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.r329-tall-167889201700203.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 ltsminxred
Input is RERS17pb115-PT-8, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889201700203
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 6.2K Feb 25 13:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 13:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:50 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.6K Feb 25 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:39 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 69M 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 RERS17pb115-PT-8-LTLCardinality-00
FORMULA_NAME RERS17pb115-PT-8-LTLCardinality-01
FORMULA_NAME RERS17pb115-PT-8-LTLCardinality-02
FORMULA_NAME RERS17pb115-PT-8-LTLCardinality-03
FORMULA_NAME RERS17pb115-PT-8-LTLCardinality-04
FORMULA_NAME RERS17pb115-PT-8-LTLCardinality-05
FORMULA_NAME RERS17pb115-PT-8-LTLCardinality-06
FORMULA_NAME RERS17pb115-PT-8-LTLCardinality-07
FORMULA_NAME RERS17pb115-PT-8-LTLCardinality-08
FORMULA_NAME RERS17pb115-PT-8-LTLCardinality-09
FORMULA_NAME RERS17pb115-PT-8-LTLCardinality-10
FORMULA_NAME RERS17pb115-PT-8-LTLCardinality-11
FORMULA_NAME RERS17pb115-PT-8-LTLCardinality-12
FORMULA_NAME RERS17pb115-PT-8-LTLCardinality-13
FORMULA_NAME RERS17pb115-PT-8-LTLCardinality-14
FORMULA_NAME RERS17pb115-PT-8-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679071888406
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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb115-PT-8
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 16:51:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 16:51:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 16:51:32] [INFO ] Load time of PNML (sax parser for PT used): 1864 ms
[2023-03-17 16:51:32] [INFO ] Transformed 1399 places.
[2023-03-17 16:51:32] [INFO ] Transformed 144369 transitions.
[2023-03-17 16:51:32] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2403 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA RERS17pb115-PT-8-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb115-PT-8-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb115-PT-8-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 1399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Ensure Unique test removed 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
Applied a total of 18 rules in 856 ms. Remains 1381 /1399 variables (removed 18) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 16:51:34] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 16:51:34] [INFO ] Computed 19 place invariants in 434 ms
[2023-03-17 16:51:43] [INFO ] Implicit Places using invariants in 9136 ms returned []
Implicit Place search using SMT only with invariants took 9161 ms to find 0 implicit places.
[2023-03-17 16:51:43] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 16:51:43] [INFO ] Invariant cache hit.
[2023-03-17 16:52:13] [INFO ] Performed 93753/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 16:52:29] [INFO ] Dead Transitions using invariants and state equation in 45878 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1381/1399 places, 144369/144369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55912 ms. Remains : 1381/1399 places, 144369/144369 transitions.
Support contains 46 out of 1381 places after structural reductions.
[2023-03-17 16:52:33] [INFO ] Flatten gal took : 3482 ms
[2023-03-17 16:52:37] [INFO ] Flatten gal took : 3419 ms
[2023-03-17 16:52:44] [INFO ] Input system was already deterministic with 144369 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 809 ms. (steps per millisecond=12 ) properties (out of 28) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-17 16:52:47] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 16:52:47] [INFO ] Invariant cache hit.
[2023-03-17 16:52:47] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-17 16:52:47] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-17 16:52:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-17 16:53:13] [INFO ] After 24512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-17 16:53:15] [INFO ] State equation strengthened by 2277 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.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-17 16:53:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 16:53:15] [INFO ] After 27355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 21 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1380 transition count 144368
Applied a total of 1 rules in 2240 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2245 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 842 ms. (steps per millisecond=11 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-17 16:53:19] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 16:53:20] [INFO ] Computed 19 place invariants in 256 ms
[2023-03-17 16:53:20] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-17 16:53:20] [INFO ] After 462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-17 16:53:20] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-17 16:53:45] [INFO ] After 24463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-17 16:53:46] [INFO ] State equation strengthened by 741 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.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-17 16:53:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 16:53:46] [INFO ] After 26071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 17 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 961 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 961 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 934 ms. (steps per millisecond=10 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 3130 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3130 steps, saw 2667 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-17 16:53:52] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 16:53:52] [INFO ] Invariant cache hit.
[2023-03-17 16:53:53] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-17 16:53:53] [INFO ] After 406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-17 16:53:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-17 16:54:18] [INFO ] After 24651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-17 16:54:18] [INFO ] State equation strengthened by 741 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.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-17 16:54:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 16:54:18] [INFO ] After 25826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 980 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 980 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 764 ms. (steps per millisecond=13 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-17 16:54:21] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 16:54:21] [INFO ] Invariant cache hit.
[2023-03-17 16:54:22] [INFO ] [Real]Absence check using 19 positive place invariants in 24 ms returned sat
[2023-03-17 16:54:22] [INFO ] After 452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-17 16:54:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-17 16:54:47] [INFO ] After 24664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-17 16:54:47] [INFO ] State equation strengthened by 741 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.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-17 16:54:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 16:54:47] [INFO ] After 25740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 909 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 909 ms. Remains : 1380/1380 places, 144368/144368 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(X(X(F(p0)))))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 425 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 16:54:50] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 16:54:50] [INFO ] Computed 19 place invariants in 282 ms
[2023-03-17 16:54:58] [INFO ] Implicit Places using invariants in 8494 ms returned []
Implicit Place search using SMT only with invariants took 8495 ms to find 0 implicit places.
[2023-03-17 16:54:58] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 16:54:58] [INFO ] Invariant cache hit.
[2023-03-17 16:55:28] [INFO ] Performed 95998/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 16:55:43] [INFO ] Dead Transitions using invariants and state equation in 44793 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53724 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RERS17pb115-PT-8-LTLCardinality-00 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ s658 s162)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 59630 steps with 14907 reset in 10002 ms.
Product exploration timeout after 60410 steps with 15102 reset in 10001 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 675 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3749 steps, run timeout after 3005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3749 steps, saw 3186 distinct states, run finished after 3007 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 16:56:09] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 16:56:09] [INFO ] Invariant cache hit.
[2023-03-17 16:56:09] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 16:56:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 18 ms returned sat
[2023-03-17 16:56:28] [INFO ] After 19117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 16:56:29] [INFO ] State equation strengthened by 2277 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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-17 16:56:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 16:56:34] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1380 transition count 144368
Applied a total of 1 rules in 2120 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2124 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Finished random walk after 8557 steps, including 2 resets, run visited all 1 properties in 509 ms. (steps per millisecond=16 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 408 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 16:56:38] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 16:56:38] [INFO ] Invariant cache hit.
[2023-03-17 16:56:46] [INFO ] Implicit Places using invariants in 8521 ms returned []
Implicit Place search using SMT only with invariants took 8522 ms to find 0 implicit places.
[2023-03-17 16:56:46] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 16:56:46] [INFO ] Invariant cache hit.
[2023-03-17 16:57:16] [INFO ] Performed 96146/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 16:57:31] [INFO ] Dead Transitions using invariants and state equation in 44903 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53836 ms. Remains : 1381/1381 places, 144369/144369 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1134 steps, including 0 resets, run visited all 1 properties in 33 ms. (steps per millisecond=34 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 60310 steps with 15077 reset in 10002 ms.
Product exploration timeout after 63940 steps with 15985 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 1093 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 16:57:54] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 16:57:55] [INFO ] Invariant cache hit.
[2023-03-17 16:58:25] [INFO ] Performed 97620/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 16:58:39] [INFO ] Dead Transitions using invariants and state equation in 44495 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45594 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 398 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 16:58:40] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 16:58:40] [INFO ] Invariant cache hit.
[2023-03-17 16:58:48] [INFO ] Implicit Places using invariants in 8088 ms returned []
Implicit Place search using SMT only with invariants took 8089 ms to find 0 implicit places.
[2023-03-17 16:58:48] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 16:58:48] [INFO ] Invariant cache hit.
[2023-03-17 16:59:18] [INFO ] Performed 98516/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 16:59:33] [INFO ] Dead Transitions using invariants and state equation in 44910 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53401 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Treatment of property RERS17pb115-PT-8-LTLCardinality-00 finished in 288932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((X(p0) U G(p1))&&X((!p0&&X(p2)))))))'
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 441 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 16:59:39] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 16:59:39] [INFO ] Invariant cache hit.
[2023-03-17 16:59:47] [INFO ] Implicit Places using invariants in 8228 ms returned []
Implicit Place search using SMT only with invariants took 8232 ms to find 0 implicit places.
[2023-03-17 16:59:47] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 16:59:47] [INFO ] Invariant cache hit.
[2023-03-17 17:00:17] [INFO ] Performed 93686/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:00:33] [INFO ] Dead Transitions using invariants and state equation in 46194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54871 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 722 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (AND (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p2) p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : RERS17pb115-PT-8-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 7}, { cond=(NOT p0), acceptance={0} source=4 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=8 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=8 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=9 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=10 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=10 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=10 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=10 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 9}, { cond=(AND p1 p0), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(LEQ s474 s589), p0:(GT 2 s10), p2:(LEQ 2 s874)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 58140 steps with 13002 reset in 10001 ms.
Product exploration timeout after 62450 steps with 13882 reset in 10001 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 p1 p0 (NOT p2)), (X p1), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 596 ms. Reduced automaton from 11 states, 46 edges and 3 AP (stutter sensitive) to 11 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 512 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (AND (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p2) p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 800 ms. (steps per millisecond=12 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2023-03-17 17:00:58] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:00:58] [INFO ] Invariant cache hit.
[2023-03-17 17:00:58] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-17 17:00:58] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-17 17:00:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-17 17:01:23] [INFO ] After 24635ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-17 17:01:24] [INFO ] State equation strengthened by 2277 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-17 17:01:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:01:24] [INFO ] After 25916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1380 transition count 144368
Applied a total of 1 rules in 1782 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1785 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=14 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 3266 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3266 steps, saw 2780 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-17 17:01:30] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 17:01:31] [INFO ] Computed 19 place invariants in 238 ms
[2023-03-17 17:01:31] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-17 17:01:31] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-17 17:01:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-17 17:01:56] [INFO ] After 24792ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-17 17:01:57] [INFO ] State equation strengthened by 741 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-17 17:01:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:01:57] [INFO ] After 25814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 906 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 906 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 907 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:01:58] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:01:58] [INFO ] Invariant cache hit.
[2023-03-17 17:02:07] [INFO ] Implicit Places using invariants in 8451 ms returned []
Implicit Place search using SMT only with invariants took 8452 ms to find 0 implicit places.
[2023-03-17 17:02:07] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:02:07] [INFO ] Invariant cache hit.
[2023-03-17 17:02:37] [INFO ] Performed 97118/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:02:52] [INFO ] Dead Transitions using invariants and state equation in 45080 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54454 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p1), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p2) p1))), (F (NOT (AND (NOT p2) p0 p1))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 684 ms. Reduced automaton from 11 states, 44 edges and 3 AP (stutter sensitive) to 11 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 419 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (AND (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p2) p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1)))]
Stuttering acceptance computed with spot in 493 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (AND (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p2) p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1)))]
[2023-03-17 17:02:54] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 17:02:55] [INFO ] Computed 19 place invariants in 252 ms
Could not prove EG (NOT p2)
[2023-03-17 17:03:10] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:03:10] [INFO ] Invariant cache hit.
Could not prove EG p0
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 405 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 17:03:26] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:03:26] [INFO ] Invariant cache hit.
[2023-03-17 17:03:34] [INFO ] Implicit Places using invariants in 8146 ms returned []
Implicit Place search using SMT only with invariants took 8148 ms to find 0 implicit places.
[2023-03-17 17:03:34] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:03:34] [INFO ] Invariant cache hit.
[2023-03-17 17:04:04] [INFO ] Performed 94011/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:04:20] [INFO ] Dead Transitions using invariants and state equation in 46227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54787 ms. Remains : 1381/1381 places, 144369/144369 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 p0 p1 (NOT p2)), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 377 ms. Reduced automaton from 11 states, 44 edges and 3 AP (stutter sensitive) to 11 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 471 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (AND (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p2) p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 621 ms. (steps per millisecond=16 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 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 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-17 17:04:23] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:04:23] [INFO ] Invariant cache hit.
[2023-03-17 17:04:23] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-17 17:04:23] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-17 17:04:24] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-17 17:04:49] [INFO ] After 24867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-17 17:04:50] [INFO ] State equation strengthened by 2277 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-17 17:04:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:04:50] [INFO ] After 26130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1380 transition count 144368
Applied a total of 1 rules in 1774 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1779 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 688 ms. (steps per millisecond=14 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 3236 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3236 steps, saw 2754 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-17 17:04:56] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 17:04:56] [INFO ] Computed 19 place invariants in 241 ms
[2023-03-17 17:04:56] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-17 17:04:56] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-17 17:04:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 18 ms returned sat
[2023-03-17 17:05:21] [INFO ] After 24611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-17 17:05:22] [INFO ] State equation strengthened by 741 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-17 17:05:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:05:22] [INFO ] After 25637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 961 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 962 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 906 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:05:24] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:05:24] [INFO ] Invariant cache hit.
[2023-03-17 17:05:32] [INFO ] Implicit Places using invariants in 8245 ms returned []
Implicit Place search using SMT only with invariants took 8250 ms to find 0 implicit places.
[2023-03-17 17:05:32] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:05:32] [INFO ] Invariant cache hit.
[2023-03-17 17:06:02] [INFO ] Performed 96478/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:06:17] [INFO ] Dead Transitions using invariants and state equation in 44557 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53724 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0)), (F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2) p0))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2) p0))]
Knowledge based reduction with 7 factoid took 596 ms. Reduced automaton from 11 states, 44 edges and 3 AP (stutter sensitive) to 11 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 432 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (AND (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p2) p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1)))]
Stuttering acceptance computed with spot in 430 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (AND (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p2) p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1)))]
[2023-03-17 17:06:19] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 17:06:19] [INFO ] Computed 19 place invariants in 246 ms
Could not prove EG (NOT p2)
[2023-03-17 17:06:34] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:06:35] [INFO ] Invariant cache hit.
Could not prove EG p0
Stuttering acceptance computed with spot in 444 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (AND (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p2) p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1)))]
Product exploration timeout after 67480 steps with 12826 reset in 10003 ms.
Product exploration timeout after 66760 steps with 12695 reset in 10002 ms.
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 416 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 17:07:11] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:07:11] [INFO ] Invariant cache hit.
[2023-03-17 17:07:19] [INFO ] Implicit Places using invariants in 8497 ms returned []
Implicit Place search using SMT only with invariants took 8498 ms to find 0 implicit places.
[2023-03-17 17:07:19] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:07:19] [INFO ] Invariant cache hit.
[2023-03-17 17:07:50] [INFO ] Performed 98196/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:08:04] [INFO ] Dead Transitions using invariants and state equation in 44269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53189 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Treatment of property RERS17pb115-PT-8-LTLCardinality-02 finished in 510626 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((p0 U (p1&&X(X(G(!p0))))))))'
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 603 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 17:08:09] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:08:09] [INFO ] Invariant cache hit.
[2023-03-17 17:08:18] [INFO ] Implicit Places using invariants in 8253 ms returned []
Implicit Place search using SMT only with invariants took 8254 ms to find 0 implicit places.
[2023-03-17 17:08:18] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:08:18] [INFO ] Invariant cache hit.
[2023-03-17 17:08:48] [INFO ] Performed 95146/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:09:03] [INFO ] Dead Transitions using invariants and state equation in 45226 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54088 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) p0), p0, (OR (NOT p1) p0), p0, true, (OR (NOT p1) p0), p0, p0]
Running random walk in product with property : RERS17pb115-PT-8-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 7}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 1}]], initial=5, aps=[p1:(LEQ s320 s760), p0:(LEQ 2 s1212)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA RERS17pb115-PT-8-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb115-PT-8-LTLCardinality-03 finished in 54667 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((G(F(p0)) U (p1 U p2))))'
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1154 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
[2023-03-17 17:09:05] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 17:09:05] [INFO ] Computed 19 place invariants in 229 ms
[2023-03-17 17:09:13] [INFO ] Implicit Places using invariants in 8459 ms returned []
Implicit Place search using SMT only with invariants took 8460 ms to find 0 implicit places.
[2023-03-17 17:09:13] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:09:13] [INFO ] Invariant cache hit.
[2023-03-17 17:09:43] [INFO ] Performed 97899/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:09:58] [INFO ] Dead Transitions using invariants and state equation in 44450 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54072 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : RERS17pb115-PT-8-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 2 s665), p1:(LEQ 3 s112), p0:(LEQ 1 s775)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 126 reset in 7615 ms.
Product exploration explored 100000 steps with 123 reset in 7653 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 p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p2) (NOT p1))), true, (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 609 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 17:10:16] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:10:16] [INFO ] Invariant cache hit.
[2023-03-17 17:10:16] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-17 17:10:16] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 17:10:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2023-03-17 17:10:37] [INFO ] After 20263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 17:10:37] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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-17 17:10:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:10:41] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 903 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 908 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 685 ms. (steps per millisecond=14 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3232 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3232 steps, saw 2751 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 17:10:46] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:10:46] [INFO ] Invariant cache hit.
[2023-03-17 17:10:46] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2023-03-17 17:10:46] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 17:10:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-17 17:11:07] [INFO ] After 20234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 17:11:07] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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-17 17:11:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:11:11] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 930 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 931 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 933 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:11:13] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:11:13] [INFO ] Invariant cache hit.
[2023-03-17 17:11:22] [INFO ] Implicit Places using invariants in 8225 ms returned []
Implicit Place search using SMT only with invariants took 8235 ms to find 0 implicit places.
[2023-03-17 17:11:22] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:11:22] [INFO ] Invariant cache hit.
[2023-03-17 17:11:52] [INFO ] Performed 96969/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:12:06] [INFO ] Dead Transitions using invariants and state equation in 44625 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53804 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p2) (NOT p1))), true, (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 510 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p2)]
[2023-03-17 17:12:07] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:12:08] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Support contains 3 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 843 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:12:24] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:12:24] [INFO ] Invariant cache hit.
[2023-03-17 17:12:32] [INFO ] Implicit Places using invariants in 8786 ms returned []
Implicit Place search using SMT only with invariants took 8786 ms to find 0 implicit places.
[2023-03-17 17:12:32] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:12:32] [INFO ] Invariant cache hit.
[2023-03-17 17:13:03] [INFO ] Performed 96612/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:13:17] [INFO ] Dead Transitions using invariants and state equation in 44758 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54392 ms. Remains : 1380/1380 places, 144368/144368 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 p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), true, (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 486 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 714 ms. (steps per millisecond=14 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 17:13:20] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:13:20] [INFO ] Invariant cache hit.
[2023-03-17 17:13:20] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-17 17:13:20] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 17:13:20] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-17 17:13:40] [INFO ] After 20036ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 17:13:41] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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-17 17:13:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:13:45] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 903 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 906 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 508 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3368 steps, run timeout after 3006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3368 steps, saw 2869 distinct states, run finished after 3006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 17:13:50] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:13:50] [INFO ] Invariant cache hit.
[2023-03-17 17:13:50] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-17 17:13:50] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 17:13:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-17 17:14:11] [INFO ] After 20198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 17:14:11] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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-17 17:14:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:14:15] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 898 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 899 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 902 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:14:17] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:14:17] [INFO ] Invariant cache hit.
[2023-03-17 17:14:25] [INFO ] Implicit Places using invariants in 8026 ms returned []
Implicit Place search using SMT only with invariants took 8027 ms to find 0 implicit places.
[2023-03-17 17:14:25] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:14:25] [INFO ] Invariant cache hit.
[2023-03-17 17:14:55] [INFO ] Performed 97907/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:15:09] [INFO ] Dead Transitions using invariants and state equation in 44219 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53159 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), true, (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 456 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p2)]
[2023-03-17 17:15:10] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:15:11] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 126 reset in 7496 ms.
Product exploration explored 100000 steps with 124 reset in 7555 ms.
Support contains 3 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 826 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:15:42] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:15:42] [INFO ] Invariant cache hit.
[2023-03-17 17:15:50] [INFO ] Implicit Places using invariants in 7800 ms returned []
Implicit Place search using SMT only with invariants took 7801 ms to find 0 implicit places.
[2023-03-17 17:15:50] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:15:50] [INFO ] Invariant cache hit.
[2023-03-17 17:16:20] [INFO ] Performed 93910/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:16:35] [INFO ] Dead Transitions using invariants and state equation in 45574 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54206 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Treatment of property RERS17pb115-PT-8-LTLCardinality-04 finished in 457185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X((p1&&G(p2)))))))'
Support contains 6 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 485 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 17:16:41] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 17:16:41] [INFO ] Computed 19 place invariants in 242 ms
[2023-03-17 17:16:50] [INFO ] Implicit Places using invariants in 8531 ms returned []
Implicit Place search using SMT only with invariants took 8532 ms to find 0 implicit places.
[2023-03-17 17:16:50] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:16:50] [INFO ] Invariant cache hit.
[2023-03-17 17:17:20] [INFO ] Performed 99229/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:17:33] [INFO ] Dead Transitions using invariants and state equation in 43825 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52846 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : RERS17pb115-PT-8-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s1271 s1094), p1:(LEQ s326 s553), p2:(LEQ s1214 s135)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4727 steps with 0 reset in 450 ms.
FORMULA RERS17pb115-PT-8-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb115-PT-8-LTLCardinality-05 finished in 53776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 6 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 969 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
[2023-03-17 17:17:35] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 17:17:36] [INFO ] Computed 19 place invariants in 263 ms
[2023-03-17 17:17:44] [INFO ] Implicit Places using invariants in 8417 ms returned []
Implicit Place search using SMT only with invariants took 8427 ms to find 0 implicit places.
[2023-03-17 17:17:44] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:17:44] [INFO ] Invariant cache hit.
[2023-03-17 17:18:14] [INFO ] Performed 97452/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:18:28] [INFO ] Dead Transitions using invariants and state equation in 44553 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53953 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RERS17pb115-PT-8-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s713 s411), p0:(OR (LEQ s1178 s948) (LEQ s45 s523))], 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 8997 ms.
Product exploration explored 100000 steps with 0 reset in 8745 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 716 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3214 steps, run timeout after 3006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3214 steps, saw 2737 distinct states, run finished after 3006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 17:18:52] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:18:52] [INFO ] Invariant cache hit.
[2023-03-17 17:18:52] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 17:18:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-17 17:19:12] [INFO ] After 19930ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 17:19:13] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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-17 17:19:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:19:17] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 940 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 944 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3185 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3185 steps, saw 2713 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 17:19:22] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:19:22] [INFO ] Invariant cache hit.
[2023-03-17 17:19:22] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 17:19:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-17 17:19:42] [INFO ] After 20078ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 17:19:43] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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-17 17:19:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:19:47] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 910 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 911 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 912 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:19:49] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:19:49] [INFO ] Invariant cache hit.
[2023-03-17 17:19:57] [INFO ] Implicit Places using invariants in 7997 ms returned []
Implicit Place search using SMT only with invariants took 8000 ms to find 0 implicit places.
[2023-03-17 17:19:57] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:19:57] [INFO ] Invariant cache hit.
[2023-03-17 17:20:27] [INFO ] Performed 97255/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:20:42] [INFO ] Dead Transitions using invariants and state equation in 44692 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53616 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 839 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:20:43] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:20:43] [INFO ] Invariant cache hit.
[2023-03-17 17:20:51] [INFO ] Implicit Places using invariants in 7914 ms returned []
Implicit Place search using SMT only with invariants took 7915 ms to find 0 implicit places.
[2023-03-17 17:20:51] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:20:51] [INFO ] Invariant cache hit.
[2023-03-17 17:21:21] [INFO ] Performed 97109/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:21:35] [INFO ] Dead Transitions using invariants and state equation in 44475 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53233 ms. Remains : 1380/1380 places, 144368/144368 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 619 ms. (steps per millisecond=16 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3248 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3248 steps, saw 2764 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 17:21:41] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:21:41] [INFO ] Invariant cache hit.
[2023-03-17 17:21:41] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 17:21:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-17 17:22:01] [INFO ] After 20088ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 17:22:02] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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-17 17:22:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:22:06] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 908 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 912 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3200 steps, run timeout after 3006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3200 steps, saw 2725 distinct states, run finished after 3006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 17:22:11] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:22:11] [INFO ] Invariant cache hit.
[2023-03-17 17:22:11] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 17:22:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-17 17:22:32] [INFO ] After 20590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 17:22:32] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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-17 17:22:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:22:36] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 904 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 904 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 905 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:22:38] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:22:38] [INFO ] Invariant cache hit.
[2023-03-17 17:22:46] [INFO ] Implicit Places using invariants in 8139 ms returned []
Implicit Place search using SMT only with invariants took 8140 ms to find 0 implicit places.
[2023-03-17 17:22:46] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:22:46] [INFO ] Invariant cache hit.
[2023-03-17 17:23:16] [INFO ] Performed 97713/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:23:30] [INFO ] Dead Transitions using invariants and state equation in 44410 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53467 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 8378 ms.
Product exploration explored 100000 steps with 0 reset in 8654 ms.
Support contains 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 821 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:23:49] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:23:49] [INFO ] Invariant cache hit.
[2023-03-17 17:23:57] [INFO ] Implicit Places using invariants in 7867 ms returned []
Implicit Place search using SMT only with invariants took 7868 ms to find 0 implicit places.
[2023-03-17 17:23:57] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:23:57] [INFO ] Invariant cache hit.
[2023-03-17 17:24:27] [INFO ] Performed 98666/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:24:41] [INFO ] Dead Transitions using invariants and state equation in 44155 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52848 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Treatment of property RERS17pb115-PT-8-LTLCardinality-06 finished in 431421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F((p0&&(p1||G(p2))))||G(p1)))||G(p3)))'
Support contains 7 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1130 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
[2023-03-17 17:24:47] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:24:47] [INFO ] Invariant cache hit.
[2023-03-17 17:24:55] [INFO ] Implicit Places using invariants in 8435 ms returned []
Implicit Place search using SMT only with invariants took 8439 ms to find 0 implicit places.
[2023-03-17 17:24:55] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:24:55] [INFO ] Invariant cache hit.
[2023-03-17 17:25:26] [INFO ] Performed 95346/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:25:41] [INFO ] Dead Transitions using invariants and state equation in 45210 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54784 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) p1 (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) p1 (NOT p2) (NOT p3))]
Running random walk in product with property : RERS17pb115-PT-8-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) (NOT p2) p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=0 dest: 5}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(LEQ s1045 s1120), p0:(LEQ s659 s139), p1:(LEQ s256 s231), p2:(LEQ 3 s1163)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 32 reset in 8620 ms.
Product exploration explored 100000 steps with 28 reset in 8199 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 p3 p0 p1 (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X p3), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X p3)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), true, (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) (NOT p2) p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 1822 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p1 (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p2) (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 731 ms. (steps per millisecond=13 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-17 17:26:03] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:26:03] [INFO ] Invariant cache hit.
[2023-03-17 17:26:03] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-17 17:26:03] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-17 17:26:28] [INFO ] After 24759ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-17 17:26:29] [INFO ] State equation strengthened by 741 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-17 17:26:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:26:29] [INFO ] After 26038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 938 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 941 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 901 ms. (steps per millisecond=11 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 3471 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3471 steps, saw 2955 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-17 17:26:35] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:26:35] [INFO ] Invariant cache hit.
[2023-03-17 17:26:35] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-17 17:26:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-17 17:27:01] [INFO ] After 24467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-17 17:27:01] [INFO ] State equation strengthened by 741 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-17 17:27:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:27:01] [INFO ] After 25644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 945 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 946 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 909 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:27:03] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:27:03] [INFO ] Invariant cache hit.
[2023-03-17 17:27:11] [INFO ] Implicit Places using invariants in 8498 ms returned []
Implicit Place search using SMT only with invariants took 8501 ms to find 0 implicit places.
[2023-03-17 17:27:12] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:27:12] [INFO ] Invariant cache hit.
[2023-03-17 17:27:42] [INFO ] Performed 96986/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:27:57] [INFO ] Dead Transitions using invariants and state equation in 45727 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55150 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Knowledge obtained : [(AND p3 p0 p1 (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X p3), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X p3)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2)))), true, (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) (NOT p2) p3)))))]
False Knowledge obtained : [(F (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (F (NOT p3)), (F (OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) p3 (NOT p2)))), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 34 factoid took 1970 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p1 (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p2) (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p1 (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND p1 (NOT p2) (NOT p0) (NOT p3))]
Support contains 7 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 843 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:28:01] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:28:01] [INFO ] Invariant cache hit.
[2023-03-17 17:28:09] [INFO ] Implicit Places using invariants in 8390 ms returned []
Implicit Place search using SMT only with invariants took 8391 ms to find 0 implicit places.
[2023-03-17 17:28:09] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:28:09] [INFO ] Invariant cache hit.
[2023-03-17 17:28:39] [INFO ] Performed 94401/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:28:56] [INFO ] Dead Transitions using invariants and state equation in 46490 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55728 ms. Remains : 1380/1380 places, 144368/144368 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 p3 p1 p0 (NOT p2)), (X p3), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p2))))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p1) p3 p0 p2))), (X (NOT (AND p1 (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) p3 (NOT p2))))), (X (NOT (AND p1 p3 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p3) p0 p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p3 (NOT p0)))), (X (X p3)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p2)))))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) p3 p0 p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) p3 (NOT p2)))))), true, (X (X (NOT (AND p1 p3 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 1524 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) p1 (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) p1 (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 989 ms. (steps per millisecond=10 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-17 17:29:00] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:29:00] [INFO ] Invariant cache hit.
[2023-03-17 17:29:01] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-17 17:29:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-17 17:29:26] [INFO ] After 24741ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-17 17:29:27] [INFO ] State equation strengthened by 741 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-17 17:29:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:29:27] [INFO ] After 26084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1111 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1115 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 980 ms. (steps per millisecond=10 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 6978 steps, run timeout after 6003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 6978 steps, saw 5945 distinct states, run finished after 6003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-17 17:29:36] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:29:36] [INFO ] Invariant cache hit.
[2023-03-17 17:29:37] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-17 17:29:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-17 17:30:02] [INFO ] After 24479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-17 17:30:03] [INFO ] State equation strengthened by 741 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-17 17:30:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:30:03] [INFO ] After 25692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 920 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 920 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 919 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:30:04] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:30:04] [INFO ] Invariant cache hit.
[2023-03-17 17:30:13] [INFO ] Implicit Places using invariants in 8363 ms returned []
Implicit Place search using SMT only with invariants took 8363 ms to find 0 implicit places.
[2023-03-17 17:30:13] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:30:13] [INFO ] Invariant cache hit.
[2023-03-17 17:30:43] [INFO ] Performed 93963/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:30:58] [INFO ] Dead Transitions using invariants and state equation in 45638 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54934 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Knowledge obtained : [(AND p3 p1 p0 (NOT p2)), (X p3), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p2))))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p1) p3 p0 p2))), (X (NOT (AND p1 (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) p3 (NOT p2))))), (X (NOT (AND p1 p3 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p3) p0 p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p3 (NOT p0)))), (X (X p3)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p2)))))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) p3 p0 p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) p3 (NOT p2)))))), true, (X (X (NOT (AND p1 p3 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0)))))]
False Knowledge obtained : [(F (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (F (NOT p3)), (F (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) p3 (NOT p2)))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 34 factoid took 1620 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) p1 (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) p1 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) p1 (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) p1 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) p1 (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) p1 (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 27 reset in 8595 ms.
Product exploration explored 100000 steps with 29 reset in 8706 ms.
Support contains 7 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 828 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:31:19] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:31:19] [INFO ] Invariant cache hit.
[2023-03-17 17:31:28] [INFO ] Implicit Places using invariants in 8517 ms returned []
Implicit Place search using SMT only with invariants took 8518 ms to find 0 implicit places.
[2023-03-17 17:31:28] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:31:28] [INFO ] Invariant cache hit.
[2023-03-17 17:31:58] [INFO ] Performed 95582/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:32:13] [INFO ] Dead Transitions using invariants and state equation in 45356 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54706 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Treatment of property RERS17pb115-PT-8-LTLCardinality-07 finished in 453162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&G(p1))))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 523 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 17:32:20] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 17:32:20] [INFO ] Computed 19 place invariants in 287 ms
[2023-03-17 17:32:28] [INFO ] Implicit Places using invariants in 8725 ms returned []
Implicit Place search using SMT only with invariants took 8725 ms to find 0 implicit places.
[2023-03-17 17:32:28] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:32:28] [INFO ] Invariant cache hit.
[2023-03-17 17:32:59] [INFO ] Performed 97755/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:33:13] [INFO ] Dead Transitions using invariants and state equation in 44335 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53589 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : RERS17pb115-PT-8-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT 2 s1342), p0:(GT 3 s1035)], 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 80 reset in 8242 ms.
Product exploration explored 100000 steps with 79 reset in 9796 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 p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 257 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 599 ms. (steps per millisecond=16 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 17:33:33] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:33:33] [INFO ] Invariant cache hit.
[2023-03-17 17:33:34] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-17 17:33:54] [INFO ] After 20403ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-17 17:33:55] [INFO ] State equation strengthened by 2277 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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-17 17:33:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:33:58] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1380 transition count 144368
Applied a total of 1 rules in 2084 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2089 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 834 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3024 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3024 steps, saw 2574 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 17:34:05] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 17:34:05] [INFO ] Computed 19 place invariants in 253 ms
[2023-03-17 17:34:05] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-17 17:34:24] [INFO ] After 19161ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-17 17:34:25] [INFO ] State equation strengthened by 741 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-17 17:34:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:34:30] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 907 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 908 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 904 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:34:32] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:34:32] [INFO ] Invariant cache hit.
[2023-03-17 17:34:40] [INFO ] Implicit Places using invariants in 8025 ms returned []
Implicit Place search using SMT only with invariants took 8026 ms to find 0 implicit places.
[2023-03-17 17:34:40] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:34:40] [INFO ] Invariant cache hit.
[2023-03-17 17:35:10] [INFO ] Performed 96993/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:35:25] [INFO ] Dead Transitions using invariants and state equation in 44824 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53767 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 290 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 418 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 17:35:26] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 17:35:26] [INFO ] Computed 19 place invariants in 275 ms
[2023-03-17 17:35:35] [INFO ] Implicit Places using invariants in 8523 ms returned []
Implicit Place search using SMT only with invariants took 8527 ms to find 0 implicit places.
[2023-03-17 17:35:35] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:35:35] [INFO ] Invariant cache hit.
[2023-03-17 17:36:05] [INFO ] Performed 94049/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:36:21] [INFO ] Dead Transitions using invariants and state equation in 46335 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55285 ms. Remains : 1381/1381 places, 144369/144369 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 p1 p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 236 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 17:36:23] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:36:23] [INFO ] Invariant cache hit.
[2023-03-17 17:36:23] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-17 17:36:43] [INFO ] After 19516ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-17 17:36:44] [INFO ] State equation strengthened by 2277 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: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-17 17:36:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:36:48] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1380 transition count 144368
Applied a total of 1 rules in 1864 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1868 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3596 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3596 steps, saw 3060 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 17:36:54] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 17:36:54] [INFO ] Computed 19 place invariants in 248 ms
[2023-03-17 17:36:54] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-17 17:37:14] [INFO ] After 19597ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-17 17:37:15] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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: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-17 17:37:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:37:19] [INFO ] After 25021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 918 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 918 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 925 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:37:21] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:37:21] [INFO ] Invariant cache hit.
[2023-03-17 17:37:29] [INFO ] Implicit Places using invariants in 8218 ms returned []
Implicit Place search using SMT only with invariants took 8219 ms to find 0 implicit places.
[2023-03-17 17:37:29] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:37:29] [INFO ] Invariant cache hit.
[2023-03-17 17:38:00] [INFO ] Performed 97508/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:38:14] [INFO ] Dead Transitions using invariants and state equation in 44589 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53745 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 363 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 68 reset in 8304 ms.
Product exploration explored 100000 steps with 64 reset in 8276 ms.
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 414 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 17:38:32] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 17:38:32] [INFO ] Computed 19 place invariants in 243 ms
[2023-03-17 17:38:40] [INFO ] Implicit Places using invariants in 8170 ms returned []
Implicit Place search using SMT only with invariants took 8171 ms to find 0 implicit places.
[2023-03-17 17:38:40] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:38:40] [INFO ] Invariant cache hit.
[2023-03-17 17:39:10] [INFO ] Performed 97775/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:39:25] [INFO ] Dead Transitions using invariants and state equation in 44631 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53220 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Treatment of property RERS17pb115-PT-8-LTLCardinality-08 finished in 430916 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(G((!p0 U X(p1)))))))'
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 422 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 17:39:31] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:39:31] [INFO ] Invariant cache hit.
[2023-03-17 17:39:39] [INFO ] Implicit Places using invariants in 8160 ms returned []
Implicit Place search using SMT only with invariants took 8164 ms to find 0 implicit places.
[2023-03-17 17:39:39] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:39:39] [INFO ] Invariant cache hit.
[2023-03-17 17:40:09] [INFO ] Performed 97637/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:40:23] [INFO ] Dead Transitions using invariants and state equation in 44461 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53052 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RERS17pb115-PT-8-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(GT 1 s627), p1:(GT s426 s927)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 5 ms.
FORMULA RERS17pb115-PT-8-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb115-PT-8-LTLCardinality-10 finished in 53744 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))))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 419 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 17:40:24] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:40:24] [INFO ] Invariant cache hit.
[2023-03-17 17:40:32] [INFO ] Implicit Places using invariants in 8340 ms returned []
Implicit Place search using SMT only with invariants took 8341 ms to find 0 implicit places.
[2023-03-17 17:40:32] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:40:32] [INFO ] Invariant cache hit.
[2023-03-17 17:41:03] [INFO ] Performed 92407/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:41:19] [INFO ] Dead Transitions using invariants and state equation in 46981 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55744 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RERS17pb115-PT-8-LTLCardinality-11 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s1375 s240)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5052 steps with 0 reset in 442 ms.
FORMULA RERS17pb115-PT-8-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb115-PT-8-LTLCardinality-11 finished in 56671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U !p1)))'
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 408 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 17:41:21] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:41:21] [INFO ] Invariant cache hit.
[2023-03-17 17:41:29] [INFO ] Implicit Places using invariants in 7805 ms returned []
Implicit Place search using SMT only with invariants took 7806 ms to find 0 implicit places.
[2023-03-17 17:41:29] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 17:41:29] [INFO ] Invariant cache hit.
[2023-03-17 17:41:59] [INFO ] Performed 97142/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:42:13] [INFO ] Dead Transitions using invariants and state equation in 44626 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52843 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 107 ms :[p1, p1, true, (NOT p0)]
Running random walk in product with property : RERS17pb115-PT-8-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LEQ 1 s704) (LEQ 1 s1167)), p0:(LEQ s821 s1127)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 55300 steps with 27650 reset in 10001 ms.
Product exploration timeout after 54700 steps with 27350 reset in 10002 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 p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 7 factoid took 124 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS17pb115-PT-8-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS17pb115-PT-8-LTLCardinality-13 finished in 73824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 875 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
[2023-03-17 17:42:35] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 17:42:35] [INFO ] Computed 19 place invariants in 247 ms
[2023-03-17 17:42:44] [INFO ] Implicit Places using invariants in 8568 ms returned []
Implicit Place search using SMT only with invariants took 8570 ms to find 0 implicit places.
[2023-03-17 17:42:44] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:42:44] [INFO ] Invariant cache hit.
[2023-03-17 17:43:14] [INFO ] Performed 97446/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:43:29] [INFO ] Dead Transitions using invariants and state equation in 45253 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54701 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : RERS17pb115-PT-8-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT s834 s1084) (LEQ 2 s35))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 57 reset in 8212 ms.
Product exploration explored 100000 steps with 54 reset in 8247 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 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 2120 steps, including 0 resets, run visited all 1 properties in 153 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-17 17:43:47] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:43:48] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 3 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 822 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:44:03] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:44:03] [INFO ] Invariant cache hit.
[2023-03-17 17:44:11] [INFO ] Implicit Places using invariants in 7892 ms returned []
Implicit Place search using SMT only with invariants took 7893 ms to find 0 implicit places.
[2023-03-17 17:44:11] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:44:11] [INFO ] Invariant cache hit.
[2023-03-17 17:44:41] [INFO ] Performed 94970/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:44:57] [INFO ] Dead Transitions using invariants and state equation in 45985 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54703 ms. Remains : 1380/1380 places, 144368/144368 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 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 2458 steps, including 0 resets, run visited all 1 properties in 97 ms. (steps per millisecond=25 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-17 17:44:59] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:44:59] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 58 reset in 7879 ms.
Product exploration explored 100000 steps with 55 reset in 7886 ms.
Support contains 3 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 818 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:45:31] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:45:31] [INFO ] Invariant cache hit.
[2023-03-17 17:45:39] [INFO ] Implicit Places using invariants in 8265 ms returned []
Implicit Place search using SMT only with invariants took 8267 ms to find 0 implicit places.
[2023-03-17 17:45:39] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:45:40] [INFO ] Invariant cache hit.
[2023-03-17 17:46:10] [INFO ] Performed 96888/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:46:24] [INFO ] Dead Transitions using invariants and state equation in 44517 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53605 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Treatment of property RERS17pb115-PT-8-LTLCardinality-14 finished in 234673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1101 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
[2023-03-17 17:46:30] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:46:30] [INFO ] Invariant cache hit.
[2023-03-17 17:46:38] [INFO ] Implicit Places using invariants in 8102 ms returned []
Implicit Place search using SMT only with invariants took 8103 ms to find 0 implicit places.
[2023-03-17 17:46:38] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:46:38] [INFO ] Invariant cache hit.
[2023-03-17 17:47:08] [INFO ] Performed 95662/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:47:23] [INFO ] Dead Transitions using invariants and state equation in 45324 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54533 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : RERS17pb115-PT-8-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s573)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 8544 ms.
Product exploration explored 100000 steps with 1 reset in 8542 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 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 4973 steps, including 1 resets, run visited all 1 properties in 199 ms. (steps per millisecond=24 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-17 17:47:42] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:47:43] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 918 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:47:59] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:47:59] [INFO ] Invariant cache hit.
[2023-03-17 17:48:07] [INFO ] Implicit Places using invariants in 8715 ms returned []
Implicit Place search using SMT only with invariants took 8716 ms to find 0 implicit places.
[2023-03-17 17:48:07] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:48:07] [INFO ] Invariant cache hit.
[2023-03-17 17:48:38] [INFO ] Performed 95866/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:48:52] [INFO ] Dead Transitions using invariants and state equation in 45052 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54689 ms. Remains : 1380/1380 places, 144368/144368 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 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 3586 steps, run timeout after 3005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3586 steps, saw 3052 distinct states, run finished after 3006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 17:48:57] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:48:57] [INFO ] Invariant cache hit.
[2023-03-17 17:48:57] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-17 17:49:17] [INFO ] After 19156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 17:49:18] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java: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: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-17 17:49:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:49:22] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 913 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 916 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 732 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2990 steps, run timeout after 3007 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 2990 steps, saw 2546 distinct states, run finished after 3007 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 17:49:27] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:49:27] [INFO ] Invariant cache hit.
[2023-03-17 17:49:28] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-17 17:49:48] [INFO ] After 20431ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 17:49:49] [INFO ] State equation strengthened by 741 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: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-17 17:49:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 17:49:52] [INFO ] After 25021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 962 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 962 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 974 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 17:49:54] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:49:54] [INFO ] Invariant cache hit.
[2023-03-17 17:50:03] [INFO ] Implicit Places using invariants in 8673 ms returned []
Implicit Place search using SMT only with invariants took 8674 ms to find 0 implicit places.
[2023-03-17 17:50:03] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:50:03] [INFO ] Invariant cache hit.
[2023-03-17 17:50:33] [INFO ] Performed 88228/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 17:50:52] [INFO ] Dead Transitions using invariants and state equation in 49136 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58798 ms. Remains : 1380/1380 places, 144368/144368 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, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-17 17:50:53] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 17:50:53] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4 reset in 9738 ms.
Product exploration explored 100000 steps with 1 reset in 9331 ms.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10547356 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15999400 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 LTLCardinality -timeout 360 -rebuildPNML
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="RERS17pb115-PT-8"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is RERS17pb115-PT-8, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889201700203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb115-PT-8.tgz
mv RERS17pb115-PT-8 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;