About the Execution of LTSMin+red for RERS17pb113-PT-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7233.004 | 3243661.00 | 3572692.00 | 8334.40 | ?FFT??TF?T??F?T? | 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-167889201500052.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 RERS17pb113-PT-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889201500052
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 18:18 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.7K Feb 25 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 15M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-00
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-01
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-02
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-03
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-04
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-05
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-06
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-07
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-08
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-09
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-10
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-11
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-12
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-13
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-14
FORMULA_NAME RERS17pb113-PT-7-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678999905090
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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-7
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 20:51:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 20:51:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 20:51:47] [INFO ] Load time of PNML (sax parser for PT used): 667 ms
[2023-03-16 20:51:47] [INFO ] Transformed 639 places.
[2023-03-16 20:51:47] [INFO ] Transformed 31353 transitions.
[2023-03-16 20:51:47] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 865 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA RERS17pb113-PT-7-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-7-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-7-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-7-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-7-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 639 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Applied a total of 12 rules in 214 ms. Remains 627 /639 variables (removed 12) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 20:51:48] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 20:51:48] [INFO ] Computed 13 place invariants in 129 ms
[2023-03-16 20:51:50] [INFO ] Implicit Places using invariants in 2181 ms returned []
Implicit Place search using SMT only with invariants took 2208 ms to find 0 implicit places.
[2023-03-16 20:51:50] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:51:50] [INFO ] Invariant cache hit.
[2023-03-16 20:51:59] [INFO ] Dead Transitions using invariants and state equation in 9159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 627/639 places, 31353/31353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11594 ms. Remains : 627/639 places, 31353/31353 transitions.
Support contains 43 out of 627 places after structural reductions.
[2023-03-16 20:52:00] [INFO ] Flatten gal took : 1006 ms
[2023-03-16 20:52:01] [INFO ] Flatten gal took : 836 ms
[2023-03-16 20:52:03] [INFO ] Input system was already deterministic with 31353 transitions.
Support contains 41 out of 627 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 862 ms. (steps per millisecond=11 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 22767 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22767 steps, saw 20616 distinct states, run finished after 3003 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 20 properties.
[2023-03-16 20:52:07] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:52:07] [INFO ] Invariant cache hit.
[2023-03-16 20:52:08] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-16 20:52:33] [INFO ] After 24305ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8 real:12
[2023-03-16 20:52:33] [INFO ] State equation strengthened by 829 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:52:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:52:33] [INFO ] After 25361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 37 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 513 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 530 ms. Remains : 627/627 places, 31353/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-16 20:52:35] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:52:35] [INFO ] Invariant cache hit.
[2023-03-16 20:52:35] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-16 20:53:00] [INFO ] After 24439ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:16
[2023-03-16 20:53:00] [INFO ] State equation strengthened by 829 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:53:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:53:00] [INFO ] After 25518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 33 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 237 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 627/627 places, 31353/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 720 ms. (steps per millisecond=13 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 23877 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23877 steps, saw 21611 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 16 properties.
[2023-03-16 20:53:04] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:53:04] [INFO ] Invariant cache hit.
[2023-03-16 20:53:05] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 20:53:29] [INFO ] After 24477ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:9
[2023-03-16 20:53:30] [INFO ] State equation strengthened by 829 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:53:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:53:30] [INFO ] After 25299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 31 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 193 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 627/627 places, 31353/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 583 ms. (steps per millisecond=17 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 24104 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24104 steps, saw 21805 distinct states, run finished after 3003 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 16 properties.
[2023-03-16 20:53:34] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:53:34] [INFO ] Invariant cache hit.
[2023-03-16 20:53:34] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 20:53:59] [INFO ] After 24741ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:11
[2023-03-16 20:53:59] [INFO ] State equation strengthened by 829 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:53:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:53:59] [INFO ] After 25227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 31 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 181 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 627/627 places, 31353/31353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 173 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 20:53:59] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:53:59] [INFO ] Invariant cache hit.
[2023-03-16 20:54:01] [INFO ] Implicit Places using invariants in 1804 ms returned []
Implicit Place search using SMT only with invariants took 1812 ms to find 0 implicit places.
[2023-03-16 20:54:01] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:54:01] [INFO ] Invariant cache hit.
[2023-03-16 20:54:10] [INFO ] Dead Transitions using invariants and state equation in 8513 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10504 ms. Remains : 627/627 places, 31353/31353 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' '!(F(G(p0)))'
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 283 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 20:54:10] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:54:11] [INFO ] Computed 13 place invariants in 111 ms
[2023-03-16 20:54:12] [INFO ] Implicit Places using invariants in 1907 ms returned []
Implicit Place search using SMT only with invariants took 1908 ms to find 0 implicit places.
[2023-03-16 20:54:12] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:54:12] [INFO ] Invariant cache hit.
[2023-03-16 20:54:21] [INFO ] Dead Transitions using invariants and state equation in 8462 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10658 ms. Remains : 626/627 places, 31352/31353 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0)]
Running random walk in product with property : RERS17pb113-PT-7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s115 1) (GEQ s190 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 3196 ms.
Product exploration explored 100000 steps with 0 reset in 3164 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 267 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 538 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=89 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-16 20:54:28] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:54:28] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 202 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 20:54:44] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:54:44] [INFO ] Invariant cache hit.
[2023-03-16 20:54:45] [INFO ] Implicit Places using invariants in 1849 ms returned []
Implicit Place search using SMT only with invariants took 1853 ms to find 0 implicit places.
[2023-03-16 20:54:45] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:54:46] [INFO ] Invariant cache hit.
[2023-03-16 20:54:54] [INFO ] Dead Transitions using invariants and state equation in 8881 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10941 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26479 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26479 steps, saw 23941 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 20:54:58] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:54:58] [INFO ] Invariant cache hit.
[2023-03-16 20:54:58] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:55:12] [INFO ] After 14341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 20:55:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-16 20:55:27] [INFO ] After 14560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:55:27] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 20:55:37] [INFO ] After 9993ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 20:55:37] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 202 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 626/626 places, 31352/31352 transitions.
Finished random walk after 1465 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=133 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-16 20:55:38] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:55:38] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 3573 ms.
Product exploration explored 100000 steps with 0 reset in 3036 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 164 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 20:56:00] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:56:00] [INFO ] Invariant cache hit.
[2023-03-16 20:56:02] [INFO ] Implicit Places using invariants in 1849 ms returned []
Implicit Place search using SMT only with invariants took 1852 ms to find 0 implicit places.
[2023-03-16 20:56:02] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:56:02] [INFO ] Invariant cache hit.
[2023-03-16 20:56:11] [INFO ] Dead Transitions using invariants and state equation in 9150 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11170 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-7-LTLFireability-00 finished in 122282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||X(F(p1))))))'
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 77 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 20:56:12] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 20:56:13] [INFO ] Computed 13 place invariants in 58 ms
[2023-03-16 20:56:14] [INFO ] Implicit Places using invariants in 1988 ms returned []
Implicit Place search using SMT only with invariants took 1994 ms to find 0 implicit places.
[2023-03-16 20:56:14] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:56:14] [INFO ] Invariant cache hit.
[2023-03-16 20:56:23] [INFO ] Dead Transitions using invariants and state equation in 9057 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11132 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RERS17pb113-PT-7-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(OR (LT s135 1) (LT s258 1)), p1:(AND (GEQ s176 1) (GEQ s439 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4654 ms.
Product exploration explored 100000 steps with 33333 reset in 4104 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 61 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS17pb113-PT-7-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS17pb113-PT-7-LTLFireability-03 finished in 20392 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(X(X((F(G(p0))||G((p1||F(p2)))))))))'
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 75 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 20:56:33] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:56:33] [INFO ] Invariant cache hit.
[2023-03-16 20:56:35] [INFO ] Implicit Places using invariants in 1829 ms returned []
Implicit Place search using SMT only with invariants took 1830 ms to find 0 implicit places.
[2023-03-16 20:56:35] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:56:35] [INFO ] Invariant cache hit.
[2023-03-16 20:56:44] [INFO ] Dead Transitions using invariants and state equation in 8848 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10755 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : RERS17pb113-PT-7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(AND (GEQ s207 1) (GEQ s366 1)), p2:(AND (GEQ s133 1) (GEQ s452 1)), p0:(AND (GEQ s222 1) (GEQ s355 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3082 ms.
Product exploration explored 100000 steps with 0 reset in 3176 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :1
Finished Best-First random walk after 1651 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=165 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
[2023-03-16 20:56:52] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:56:52] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p1) (NOT p2) (NOT p0))
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 70 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 20:57:07] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:57:07] [INFO ] Invariant cache hit.
[2023-03-16 20:57:09] [INFO ] Implicit Places using invariants in 1748 ms returned []
Implicit Place search using SMT only with invariants took 1751 ms to find 0 implicit places.
[2023-03-16 20:57:09] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:57:09] [INFO ] Invariant cache hit.
[2023-03-16 20:57:18] [INFO ] Dead Transitions using invariants and state equation in 8700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10526 ms. Remains : 627/627 places, 31353/31353 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-16 20:57:19] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:57:19] [INFO ] Invariant cache hit.
[2023-03-16 20:57:19] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:57:19] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 20:57:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-16 20:57:36] [INFO ] After 17154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:57:36] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 20:57:44] [INFO ] After 7634ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 20:57:44] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 346 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 347 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26648 steps, run timeout after 3002 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26648 steps, saw 24089 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 20:57:47] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:57:47] [INFO ] Computed 13 place invariants in 42 ms
[2023-03-16 20:57:48] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 20:57:48] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 20:57:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:58:04] [INFO ] After 16789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:58:05] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 20:58:12] [INFO ] After 7535ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 20:58:15] [INFO ] Deduced a trap composed of 64 places in 2703 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:58:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:58:15] [INFO ] After 27743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 160 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 156 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 20:58:16] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:58:16] [INFO ] Invariant cache hit.
[2023-03-16 20:58:18] [INFO ] Implicit Places using invariants in 1915 ms returned []
Implicit Place search using SMT only with invariants took 1918 ms to find 0 implicit places.
[2023-03-16 20:58:18] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:58:18] [INFO ] Invariant cache hit.
[2023-03-16 20:58:26] [INFO ] Dead Transitions using invariants and state equation in 8786 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10865 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 633 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:58:27] [INFO ] Computed 13 place invariants in 49 ms
[2023-03-16 20:58:27] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:58:27] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 20:58:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:58:56] [INFO ] After 28885ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:58:59] [INFO ] After 32105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1913 ms.
[2023-03-16 20:59:01] [INFO ] After 34112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
[2023-03-16 20:59:02] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 20:59:02] [INFO ] Computed 13 place invariants in 60 ms
Could not prove EG (AND (NOT p1) (NOT p2) (NOT p0))
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 2785 ms.
Product exploration explored 100000 steps with 0 reset in 2964 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 200 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 20:59:24] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:59:24] [INFO ] Invariant cache hit.
[2023-03-16 20:59:33] [INFO ] Dead Transitions using invariants and state equation in 9185 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9387 ms. Remains : 627/627 places, 31353/31353 transitions.
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 87 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 20:59:33] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:59:33] [INFO ] Invariant cache hit.
[2023-03-16 20:59:35] [INFO ] Implicit Places using invariants in 1899 ms returned []
Implicit Place search using SMT only with invariants took 1900 ms to find 0 implicit places.
[2023-03-16 20:59:35] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:59:35] [INFO ] Invariant cache hit.
[2023-03-16 20:59:44] [INFO ] Dead Transitions using invariants and state equation in 9101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11091 ms. Remains : 627/627 places, 31353/31353 transitions.
Treatment of property RERS17pb113-PT-7-LTLFireability-04 finished in 192210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((F(G(p2))&&p1)))))'
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 171 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 20:59:45] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:59:45] [INFO ] Invariant cache hit.
[2023-03-16 20:59:47] [INFO ] Implicit Places using invariants in 2100 ms returned []
Implicit Place search using SMT only with invariants took 2102 ms to find 0 implicit places.
[2023-03-16 20:59:47] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:59:47] [INFO ] Invariant cache hit.
[2023-03-16 20:59:56] [INFO ] Dead Transitions using invariants and state equation in 8524 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10801 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : RERS17pb113-PT-7-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s161 1) (GEQ s342 1)), p1:(AND (GEQ s161 1) (GEQ s342 1)), p2:(AND (GEQ s263 1) (GEQ s364 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2908 ms.
Product exploration explored 100000 steps with 0 reset in 2895 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 25516 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25516 steps, saw 23065 distinct states, run finished after 3003 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 21:00:06] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:00:06] [INFO ] Invariant cache hit.
[2023-03-16 21:00:06] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-16 21:00:31] [INFO ] After 24942ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-16 21:00:31] [INFO ] State equation strengthened by 829 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 21:00:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 21:00:31] [INFO ] After 25211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 326 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 21:00:32] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:00:32] [INFO ] Computed 13 place invariants in 53 ms
[2023-03-16 21:00:32] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:00:52] [INFO ] After 20340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 21:00:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:01:12] [INFO ] After 19851ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 21:01:12] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:01:17] [INFO ] After 4976ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 21:01:17] [INFO ] After 4977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-16 21:01:17] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 166 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 25200 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25200 steps, saw 22802 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 21:01:21] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:01:21] [INFO ] Invariant cache hit.
[2023-03-16 21:01:21] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:01:43] [INFO ] After 22137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 21:01:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:02:03] [INFO ] After 19901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 21:02:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:02:08] [INFO ] After 4485ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 21:02:09] [INFO ] Deduced a trap composed of 48 places in 593 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 21:02:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 21:02:09] [INFO ] After 25579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 160 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 161 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:02:09] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:02:09] [INFO ] Invariant cache hit.
[2023-03-16 21:02:11] [INFO ] Implicit Places using invariants in 1824 ms returned []
Implicit Place search using SMT only with invariants took 1844 ms to find 0 implicit places.
[2023-03-16 21:02:11] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:02:11] [INFO ] Invariant cache hit.
[2023-03-16 21:02:20] [INFO ] Dead Transitions using invariants and state equation in 9130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11146 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 6 factoid took 306 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
[2023-03-16 21:02:21] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:02:21] [INFO ] Computed 13 place invariants in 56 ms
Could not prove EG (NOT p0)
[2023-03-16 21:02:36] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:02:36] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
[2023-03-16 21:02:51] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:02:51] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 69 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:03:06] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:03:06] [INFO ] Invariant cache hit.
[2023-03-16 21:03:08] [INFO ] Implicit Places using invariants in 1827 ms returned []
Implicit Place search using SMT only with invariants took 1852 ms to find 0 implicit places.
[2023-03-16 21:03:08] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:03:08] [INFO ] Invariant cache hit.
[2023-03-16 21:03:17] [INFO ] Dead Transitions using invariants and state equation in 9196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11121 ms. Remains : 627/627 places, 31353/31353 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 23842 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23842 steps, saw 21581 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 21:03:21] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:03:21] [INFO ] Invariant cache hit.
[2023-03-16 21:03:22] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:03:46] [INFO ] After 24027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 21:03:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:04:07] [INFO ] After 21594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 21:04:07] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 21:04:11] [INFO ] After 3207ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 21:04:11] [INFO ] After 3208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-16 21:04:11] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 318 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 24350 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24350 steps, saw 22042 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 21:04:14] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:04:14] [INFO ] Computed 13 place invariants in 49 ms
[2023-03-16 21:04:15] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:04:33] [INFO ] After 18841ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 21:04:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:04:54] [INFO ] After 20423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 21:04:54] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:04:58] [INFO ] After 4376ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 21:04:58] [INFO ] After 4378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-16 21:04:58] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 156 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 156 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:04:59] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:04:59] [INFO ] Invariant cache hit.
[2023-03-16 21:05:01] [INFO ] Implicit Places using invariants in 1852 ms returned []
Implicit Place search using SMT only with invariants took 1853 ms to find 0 implicit places.
[2023-03-16 21:05:01] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:05:01] [INFO ] Invariant cache hit.
[2023-03-16 21:05:09] [INFO ] Dead Transitions using invariants and state equation in 8822 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10835 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 295 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
[2023-03-16 21:05:10] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:05:10] [INFO ] Computed 13 place invariants in 53 ms
Could not prove EG (NOT p0)
[2023-03-16 21:05:25] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:05:25] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
[2023-03-16 21:05:40] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:05:41] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 3609 ms.
Product exploration explored 100000 steps with 0 reset in 3658 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 181 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:06:03] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:06:03] [INFO ] Invariant cache hit.
[2023-03-16 21:06:12] [INFO ] Dead Transitions using invariants and state equation in 8756 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8938 ms. Remains : 627/627 places, 31353/31353 transitions.
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 74 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:06:12] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:06:12] [INFO ] Invariant cache hit.
[2023-03-16 21:06:14] [INFO ] Implicit Places using invariants in 1854 ms returned []
Implicit Place search using SMT only with invariants took 1855 ms to find 0 implicit places.
[2023-03-16 21:06:14] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:06:14] [INFO ] Invariant cache hit.
[2023-03-16 21:06:22] [INFO ] Dead Transitions using invariants and state equation in 8288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10219 ms. Remains : 627/627 places, 31353/31353 transitions.
Treatment of property RERS17pb113-PT-7-LTLFireability-05 finished in 398623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 70 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:06:24] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:06:24] [INFO ] Invariant cache hit.
[2023-03-16 21:06:26] [INFO ] Implicit Places using invariants in 1892 ms returned []
Implicit Place search using SMT only with invariants took 1893 ms to find 0 implicit places.
[2023-03-16 21:06:26] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:06:26] [INFO ] Invariant cache hit.
[2023-03-16 21:06:35] [INFO ] Dead Transitions using invariants and state equation in 9124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11089 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RERS17pb113-PT-7-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s431 1) (LT s540 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3422 steps with 0 reset in 103 ms.
FORMULA RERS17pb113-PT-7-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb113-PT-7-LTLFireability-07 finished in 11471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(p1))))))'
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 79 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:06:35] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:06:35] [INFO ] Invariant cache hit.
[2023-03-16 21:06:37] [INFO ] Implicit Places using invariants in 1940 ms returned []
Implicit Place search using SMT only with invariants took 1943 ms to find 0 implicit places.
[2023-03-16 21:06:37] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:06:37] [INFO ] Invariant cache hit.
[2023-03-16 21:06:46] [INFO ] Dead Transitions using invariants and state equation in 8699 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10724 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RERS17pb113-PT-7-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s263 1) (GEQ s587 1)), p1:(AND (GEQ s561 1) (GEQ s569 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14 reset in 3313 ms.
Product exploration explored 100000 steps with 12 reset in 3175 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8428 steps, including 2 resets, run visited all 1 properties in 192 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-16 21:06:54] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:06:54] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 75 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:07:09] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:07:09] [INFO ] Invariant cache hit.
[2023-03-16 21:07:11] [INFO ] Implicit Places using invariants in 1970 ms returned []
Implicit Place search using SMT only with invariants took 1972 ms to find 0 implicit places.
[2023-03-16 21:07:11] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:07:11] [INFO ] Invariant cache hit.
[2023-03-16 21:07:20] [INFO ] Dead Transitions using invariants and state equation in 8951 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11002 ms. Remains : 627/627 places, 31353/31353 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3059 steps, including 0 resets, run visited all 1 properties in 82 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-16 21:07:21] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:07:21] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14 reset in 3540 ms.
Product exploration explored 100000 steps with 8 reset in 3569 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 177 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:07:43] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:07:43] [INFO ] Invariant cache hit.
[2023-03-16 21:07:52] [INFO ] Dead Transitions using invariants and state equation in 8366 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8556 ms. Remains : 627/627 places, 31353/31353 transitions.
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 73 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:07:52] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:07:52] [INFO ] Invariant cache hit.
[2023-03-16 21:07:54] [INFO ] Implicit Places using invariants in 1871 ms returned []
Implicit Place search using SMT only with invariants took 1872 ms to find 0 implicit places.
[2023-03-16 21:07:54] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:07:54] [INFO ] Invariant cache hit.
[2023-03-16 21:08:02] [INFO ] Dead Transitions using invariants and state equation in 8689 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10637 ms. Remains : 627/627 places, 31353/31353 transitions.
Treatment of property RERS17pb113-PT-7-LTLFireability-08 finished in 88657 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' '!((p0 U G(!p1)))'
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 181 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:08:04] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:08:04] [INFO ] Invariant cache hit.
[2023-03-16 21:08:06] [INFO ] Implicit Places using invariants in 1950 ms returned []
Implicit Place search using SMT only with invariants took 1951 ms to find 0 implicit places.
[2023-03-16 21:08:06] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:08:06] [INFO ] Invariant cache hit.
[2023-03-16 21:08:15] [INFO ] Dead Transitions using invariants and state equation in 8837 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10971 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 88 ms :[p1, true, p1]
Running random walk in product with property : RERS17pb113-PT-7-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s416 1) (GEQ s585 1)), p0:(AND (GEQ s317 1) (GEQ s606 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 3800 ms.
Product exploration explored 100000 steps with 0 reset in 3665 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 421 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26649 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26649 steps, saw 24074 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:08:26] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:08:26] [INFO ] Invariant cache hit.
[2023-03-16 21:08:26] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:08:42] [INFO ] After 15831ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:08:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:08:56] [INFO ] After 13605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:08:56] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 21:09:07] [INFO ] After 10475ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 21:09:07] [INFO ] After 24289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 153 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 627/627 places, 31353/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26760 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26760 steps, saw 24174 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:09:10] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:09:10] [INFO ] Invariant cache hit.
[2023-03-16 21:09:10] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:09:23] [INFO ] After 12722ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:09:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:09:37] [INFO ] After 13990ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:09:37] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 21:09:47] [INFO ] After 10470ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 21:09:47] [INFO ] After 24689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 164 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 627/627 places, 31353/31353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 154 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:09:48] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:09:48] [INFO ] Invariant cache hit.
[2023-03-16 21:09:50] [INFO ] Implicit Places using invariants in 1832 ms returned []
Implicit Place search using SMT only with invariants took 1857 ms to find 0 implicit places.
[2023-03-16 21:09:50] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:09:50] [INFO ] Invariant cache hit.
[2023-03-16 21:09:59] [INFO ] Dead Transitions using invariants and state equation in 9124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11139 ms. Remains : 627/627 places, 31353/31353 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 627 transition count 18326
Applied a total of 13027 rules in 492 ms. Remains 627 /627 variables (removed 0) and now considering 18326/31353 (removed 13027) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:09:59] [INFO ] Computed 13 place invariants in 49 ms
[2023-03-16 21:09:59] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:10:18] [INFO ] After 18202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:10:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:10:34] [INFO ] After 16397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:10:35] [INFO ] After 17012ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 325 ms.
[2023-03-16 21:10:35] [INFO ] After 17412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 401 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 74 ms :[true, p1, p1]
Support contains 2 out of 627 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 69 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:10:36] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:10:36] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 21:10:38] [INFO ] Implicit Places using invariants in 1904 ms returned []
Implicit Place search using SMT only with invariants took 1929 ms to find 0 implicit places.
[2023-03-16 21:10:38] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:10:38] [INFO ] Invariant cache hit.
[2023-03-16 21:10:47] [INFO ] Dead Transitions using invariants and state equation in 9013 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11015 ms. Remains : 627/627 places, 31353/31353 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26515 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26515 steps, saw 23956 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:10:50] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:10:50] [INFO ] Invariant cache hit.
[2023-03-16 21:10:50] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:11:04] [INFO ] After 13807ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:11:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:11:18] [INFO ] After 13351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:11:18] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 21:11:28] [INFO ] After 10515ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 21:11:28] [INFO ] After 24084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 170 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 627/627 places, 31353/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26881 steps, run timeout after 3002 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26881 steps, saw 24284 distinct states, run finished after 3003 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:11:32] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:11:32] [INFO ] Invariant cache hit.
[2023-03-16 21:11:32] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:11:45] [INFO ] After 13581ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:11:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:11:59] [INFO ] After 13700ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:11:59] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 21:12:10] [INFO ] After 10526ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 21:12:10] [INFO ] After 24464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 160 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 627/627 places, 31353/31353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 159 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:12:10] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:12:10] [INFO ] Invariant cache hit.
[2023-03-16 21:12:12] [INFO ] Implicit Places using invariants in 1850 ms returned []
Implicit Place search using SMT only with invariants took 1851 ms to find 0 implicit places.
[2023-03-16 21:12:12] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:12:12] [INFO ] Invariant cache hit.
[2023-03-16 21:12:21] [INFO ] Dead Transitions using invariants and state equation in 8952 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10975 ms. Remains : 627/627 places, 31353/31353 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 627 transition count 18326
Applied a total of 13027 rules in 606 ms. Remains 627 /627 variables (removed 0) and now considering 18326/31353 (removed 13027) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:12:22] [INFO ] Computed 13 place invariants in 51 ms
[2023-03-16 21:12:22] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:12:41] [INFO ] After 19031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:12:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:13:00] [INFO ] After 18944ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:13:00] [INFO ] After 19573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 391 ms.
[2023-03-16 21:13:01] [INFO ] After 20053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 94 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 81 ms :[true, p1, p1]
Product exploration explored 100000 steps with 0 reset in 2931 ms.
Product exploration explored 100000 steps with 0 reset in 3035 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 93 ms :[true, p1, p1]
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 153 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:13:07] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:13:08] [INFO ] Computed 13 place invariants in 53 ms
[2023-03-16 21:13:16] [INFO ] Dead Transitions using invariants and state equation in 8763 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8917 ms. Remains : 627/627 places, 31353/31353 transitions.
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 67 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:13:16] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:13:16] [INFO ] Invariant cache hit.
[2023-03-16 21:13:18] [INFO ] Implicit Places using invariants in 1848 ms returned []
Implicit Place search using SMT only with invariants took 1854 ms to find 0 implicit places.
[2023-03-16 21:13:18] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:13:18] [INFO ] Invariant cache hit.
[2023-03-16 21:13:27] [INFO ] Dead Transitions using invariants and state equation in 8821 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10745 ms. Remains : 627/627 places, 31353/31353 transitions.
Treatment of property RERS17pb113-PT-7-LTLFireability-10 finished in 324533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U X(G(p0)))))'
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 75 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:13:28] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:13:28] [INFO ] Invariant cache hit.
[2023-03-16 21:13:30] [INFO ] Implicit Places using invariants in 1914 ms returned []
Implicit Place search using SMT only with invariants took 1915 ms to find 0 implicit places.
[2023-03-16 21:13:30] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:13:30] [INFO ] Invariant cache hit.
[2023-03-16 21:13:39] [INFO ] Dead Transitions using invariants and state equation in 8320 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10313 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : RERS17pb113-PT-7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s44 1) (GEQ s423 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3131 ms.
Product exploration explored 100000 steps with 0 reset in 3222 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26730 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26730 steps, saw 24147 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:13:49] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:13:49] [INFO ] Invariant cache hit.
[2023-03-16 21:13:49] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:14:00] [INFO ] After 11482ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:14:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:14:12] [INFO ] After 11769ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:14:12] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 21:14:23] [INFO ] After 10557ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 21:14:23] [INFO ] After 22556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 371 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 372 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26638 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26638 steps, saw 24080 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:14:27] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:14:27] [INFO ] Computed 13 place invariants in 50 ms
[2023-03-16 21:14:27] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:14:40] [INFO ] After 13617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:14:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:14:53] [INFO ] After 12941ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:14:53] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:15:01] [INFO ] After 7909ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 21:15:02] [INFO ] Deduced a trap composed of 64 places in 697 ms of which 0 ms to minimize.
[2023-03-16 21:15:03] [INFO ] Deduced a trap composed of 48 places in 453 ms of which 1 ms to minimize.
[2023-03-16 21:15:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2265 ms
[2023-03-16 21:15:04] [INFO ] After 10541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 432 ms.
[2023-03-16 21:15:04] [INFO ] After 24109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 158 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 151 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:15:05] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:15:05] [INFO ] Invariant cache hit.
[2023-03-16 21:15:07] [INFO ] Implicit Places using invariants in 1850 ms returned []
Implicit Place search using SMT only with invariants took 1870 ms to find 0 implicit places.
[2023-03-16 21:15:07] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:15:07] [INFO ] Invariant cache hit.
[2023-03-16 21:15:16] [INFO ] Dead Transitions using invariants and state equation in 9094 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11131 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 509 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:15:16] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 21:15:16] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:15:35] [INFO ] After 18327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:15:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:15:52] [INFO ] After 17304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:15:53] [INFO ] After 18037ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 407 ms.
[2023-03-16 21:15:53] [INFO ] After 18539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), true]
[2023-03-16 21:15:54] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:15:54] [INFO ] Computed 13 place invariants in 53 ms
Could not prove EG (NOT p0)
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 68 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:16:09] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:16:09] [INFO ] Invariant cache hit.
[2023-03-16 21:16:11] [INFO ] Implicit Places using invariants in 1789 ms returned []
Implicit Place search using SMT only with invariants took 1811 ms to find 0 implicit places.
[2023-03-16 21:16:11] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:16:11] [INFO ] Invariant cache hit.
[2023-03-16 21:16:20] [INFO ] Dead Transitions using invariants and state equation in 9188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11083 ms. Remains : 627/627 places, 31353/31353 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 25868 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25868 steps, saw 23383 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:16:24] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:16:24] [INFO ] Invariant cache hit.
[2023-03-16 21:16:24] [INFO ] [Real]Absence check using 13 positive place invariants in 29 ms returned sat
[2023-03-16 21:16:34] [INFO ] After 10678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:16:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:16:45] [INFO ] After 10357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:16:45] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 21:16:55] [INFO ] After 10446ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 21:16:55] [INFO ] After 21018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 331 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 332 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26621 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26621 steps, saw 24065 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:16:59] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:16:59] [INFO ] Computed 13 place invariants in 50 ms
[2023-03-16 21:16:59] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:17:12] [INFO ] After 13290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:17:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:17:26] [INFO ] After 13102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:17:26] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:17:34] [INFO ] After 7976ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 21:17:35] [INFO ] Deduced a trap composed of 64 places in 698 ms of which 1 ms to minimize.
[2023-03-16 21:17:36] [INFO ] Deduced a trap composed of 48 places in 429 ms of which 1 ms to minimize.
[2023-03-16 21:17:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2223 ms
[2023-03-16 21:17:36] [INFO ] After 10566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 420 ms.
[2023-03-16 21:17:37] [INFO ] After 24299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 187 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 162 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:17:37] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:17:37] [INFO ] Invariant cache hit.
[2023-03-16 21:17:39] [INFO ] Implicit Places using invariants in 1824 ms returned []
Implicit Place search using SMT only with invariants took 1836 ms to find 0 implicit places.
[2023-03-16 21:17:39] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:17:39] [INFO ] Invariant cache hit.
[2023-03-16 21:17:48] [INFO ] Dead Transitions using invariants and state equation in 9102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11128 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 523 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:17:49] [INFO ] Computed 13 place invariants in 49 ms
[2023-03-16 21:17:49] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:18:07] [INFO ] After 18871ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:18:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:18:24] [INFO ] After 16307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:18:25] [INFO ] After 17023ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 394 ms.
[2023-03-16 21:18:25] [INFO ] After 17501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0), true]
[2023-03-16 21:18:25] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:18:26] [INFO ] Computed 13 place invariants in 51 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 0 reset in 2794 ms.
Product exploration explored 100000 steps with 0 reset in 3596 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 172 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:18:47] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:18:47] [INFO ] Invariant cache hit.
[2023-03-16 21:18:56] [INFO ] Dead Transitions using invariants and state equation in 9060 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9233 ms. Remains : 627/627 places, 31353/31353 transitions.
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 72 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:18:57] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:18:57] [INFO ] Invariant cache hit.
[2023-03-16 21:18:59] [INFO ] Implicit Places using invariants in 1951 ms returned []
Implicit Place search using SMT only with invariants took 1951 ms to find 0 implicit places.
[2023-03-16 21:18:59] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:18:59] [INFO ] Invariant cache hit.
[2023-03-16 21:19:08] [INFO ] Dead Transitions using invariants and state equation in 8997 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11020 ms. Remains : 627/627 places, 31353/31353 transitions.
Treatment of property RERS17pb113-PT-7-LTLFireability-11 finished in 340480 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||X(p1))))))'
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 74 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:19:09] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:19:09] [INFO ] Invariant cache hit.
[2023-03-16 21:19:11] [INFO ] Implicit Places using invariants in 1928 ms returned []
Implicit Place search using SMT only with invariants took 1928 ms to find 0 implicit places.
[2023-03-16 21:19:11] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:19:11] [INFO ] Invariant cache hit.
[2023-03-16 21:19:19] [INFO ] Dead Transitions using invariants and state equation in 8469 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10474 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RERS17pb113-PT-7-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s157 1) (GEQ s469 1)), p0:(AND (GEQ s301 1) (GEQ s375 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA RERS17pb113-PT-7-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb113-PT-7-LTLFireability-12 finished in 10737 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)))'
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 174 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 21:19:20] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:19:20] [INFO ] Computed 13 place invariants in 50 ms
[2023-03-16 21:19:22] [INFO ] Implicit Places using invariants in 1946 ms returned []
Implicit Place search using SMT only with invariants took 1947 ms to find 0 implicit places.
[2023-03-16 21:19:22] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:19:22] [INFO ] Invariant cache hit.
[2023-03-16 21:19:30] [INFO ] Dead Transitions using invariants and state equation in 8766 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10888 ms. Remains : 626/627 places, 31352/31353 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS17pb113-PT-7-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s258 1) (LT s374 1) (AND (GEQ s254 1) (GEQ s396 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 2732 ms.
Product exploration explored 100000 steps with 0 reset in 2816 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26947 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26947 steps, saw 24359 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:19:40] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:19:40] [INFO ] Invariant cache hit.
[2023-03-16 21:19:40] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:19:52] [INFO ] After 12285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:19:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:20:05] [INFO ] After 13176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:20:05] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:20:10] [INFO ] After 4379ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 21:20:11] [INFO ] After 5435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 809 ms.
[2023-03-16 21:20:12] [INFO ] After 19614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 156 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26967 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26967 steps, saw 24377 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:20:15] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:20:15] [INFO ] Invariant cache hit.
[2023-03-16 21:20:15] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:20:27] [INFO ] After 12488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:20:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:20:40] [INFO ] After 12916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:20:41] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:20:45] [INFO ] After 4141ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 21:20:46] [INFO ] After 5176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 785 ms.
[2023-03-16 21:20:47] [INFO ] After 19071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 147 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 147 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:20:47] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:20:47] [INFO ] Invariant cache hit.
[2023-03-16 21:20:49] [INFO ] Implicit Places using invariants in 1770 ms returned []
Implicit Place search using SMT only with invariants took 1782 ms to find 0 implicit places.
[2023-03-16 21:20:49] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:20:49] [INFO ] Invariant cache hit.
[2023-03-16 21:20:57] [INFO ] Dead Transitions using invariants and state equation in 8580 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10514 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 480 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:20:58] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 21:20:58] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:21:09] [INFO ] After 10680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:21:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:21:19] [INFO ] After 10393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:21:20] [INFO ] After 11707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 503 ms.
[2023-03-16 21:21:21] [INFO ] After 12319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 147 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:21:21] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:21:21] [INFO ] Computed 13 place invariants in 50 ms
[2023-03-16 21:21:23] [INFO ] Implicit Places using invariants in 1782 ms returned []
Implicit Place search using SMT only with invariants took 1791 ms to find 0 implicit places.
[2023-03-16 21:21:23] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:21:23] [INFO ] Invariant cache hit.
[2023-03-16 21:21:32] [INFO ] Dead Transitions using invariants and state equation in 9007 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10954 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26396 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26396 steps, saw 23870 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:21:36] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:21:36] [INFO ] Invariant cache hit.
[2023-03-16 21:21:36] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:21:50] [INFO ] After 13908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:21:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:22:02] [INFO ] After 12252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:22:02] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:22:06] [INFO ] After 4055ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 21:22:07] [INFO ] After 5094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 772 ms.
[2023-03-16 21:22:08] [INFO ] After 18299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 156 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26888 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26888 steps, saw 24306 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:22:11] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:22:11] [INFO ] Invariant cache hit.
[2023-03-16 21:22:12] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-16 21:22:24] [INFO ] After 12207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:22:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:22:36] [INFO ] After 12380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:22:36] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:22:40] [INFO ] After 4151ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 21:22:41] [INFO ] After 5216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 794 ms.
[2023-03-16 21:22:42] [INFO ] After 18575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 206 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 199 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:22:43] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:22:43] [INFO ] Invariant cache hit.
[2023-03-16 21:22:44] [INFO ] Implicit Places using invariants in 1776 ms returned []
Implicit Place search using SMT only with invariants took 1789 ms to find 0 implicit places.
[2023-03-16 21:22:44] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:22:44] [INFO ] Invariant cache hit.
[2023-03-16 21:22:53] [INFO ] Dead Transitions using invariants and state equation in 8351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10354 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 476 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:22:53] [INFO ] Computed 13 place invariants in 47 ms
[2023-03-16 21:22:53] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:23:04] [INFO ] After 10555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:23:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-16 21:23:15] [INFO ] After 10540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:23:16] [INFO ] After 11832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 462 ms.
[2023-03-16 21:23:16] [INFO ] After 12399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2672 ms.
Product exploration explored 100000 steps with 0 reset in 3742 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 173 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:23:23] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:23:23] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 21:23:25] [INFO ] Implicit Places using invariants in 1826 ms returned []
Implicit Place search using SMT only with invariants took 1827 ms to find 0 implicit places.
[2023-03-16 21:23:25] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:23:25] [INFO ] Invariant cache hit.
[2023-03-16 21:23:34] [INFO ] Dead Transitions using invariants and state equation in 9249 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11256 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-7-LTLFireability-13 finished in 256187 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(G((p0 U (!p1&&F(!p2))))) U p3)))'
Support contains 8 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 69 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:23:36] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:23:36] [INFO ] Computed 13 place invariants in 42 ms
[2023-03-16 21:23:38] [INFO ] Implicit Places using invariants in 1912 ms returned []
Implicit Place search using SMT only with invariants took 1913 ms to find 0 implicit places.
[2023-03-16 21:23:38] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:23:38] [INFO ] Invariant cache hit.
[2023-03-16 21:23:46] [INFO ] Dead Transitions using invariants and state equation in 8480 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10464 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p3), (NOT p3), (OR p1 p2), p2, (OR p2 p1)]
Running random walk in product with property : RERS17pb113-PT-7-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 4}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s419 1) (GEQ s587 1)), p1:(AND (GEQ s99 1) (GEQ s167 1)), p2:(AND (GEQ s492 1) (GEQ s615 1)), p0:(AND (GEQ s479 1) (GEQ s566 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2967 ms.
Product exploration explored 100000 steps with 0 reset in 2997 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 p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p3) p1 p0))), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 596 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p3) p1 p2), (NOT p3), (OR p1 p2), p2, (OR p1 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 505 ms. (steps per millisecond=19 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 21:23:54] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:23:54] [INFO ] Invariant cache hit.
[2023-03-16 21:23:54] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-16 21:24:11] [INFO ] After 16976ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 21:24:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:24:29] [INFO ] After 17579ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 21:24:29] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 21:24:36] [INFO ] After 7190ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 21:24:36] [INFO ] After 7191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-16 21:24:36] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 291 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 26321 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26321 steps, saw 23807 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 21:24:40] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:24:40] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 21:24:40] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-16 21:24:58] [INFO ] After 18158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 21:24:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:25:18] [INFO ] After 19900ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 21:25:18] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:25:23] [INFO ] After 4896ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 21:25:23] [INFO ] After 4897ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-16 21:25:23] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 164 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 153 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:25:23] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:25:23] [INFO ] Invariant cache hit.
[2023-03-16 21:25:25] [INFO ] Implicit Places using invariants in 1821 ms returned []
Implicit Place search using SMT only with invariants took 1833 ms to find 0 implicit places.
[2023-03-16 21:25:25] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:25:25] [INFO ] Invariant cache hit.
[2023-03-16 21:25:35] [INFO ] Dead Transitions using invariants and state equation in 9539 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11531 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p3) p1 p0))), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F p2), (F p3), (F (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1)))))]
Knowledge based reduction with 12 factoid took 593 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p3) p1 p2), (NOT p3), (OR p1 p2), p2, (OR p1 p2)]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p3) p1 p2), (NOT p3), (OR p1 p2), p2, (OR p1 p2)]
[2023-03-16 21:25:36] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:25:36] [INFO ] Computed 13 place invariants in 48 ms
Could not prove EG (NOT p3)
Support contains 8 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 70 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:25:51] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:25:51] [INFO ] Invariant cache hit.
[2023-03-16 21:25:53] [INFO ] Implicit Places using invariants in 1795 ms returned []
Implicit Place search using SMT only with invariants took 1806 ms to find 0 implicit places.
[2023-03-16 21:25:53] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:25:53] [INFO ] Invariant cache hit.
[2023-03-16 21:26:02] [INFO ] Dead Transitions using invariants and state equation in 9450 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11331 ms. Remains : 627/627 places, 31353/31353 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p3)), (X (OR p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p3))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 667 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p3) p1 p2), (NOT p3), (OR p1 p2), p2, (OR p1 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 21:26:04] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:26:04] [INFO ] Invariant cache hit.
[2023-03-16 21:26:04] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:26:22] [INFO ] After 18110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 21:26:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:26:42] [INFO ] After 19444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 21:26:42] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 21:26:47] [INFO ] After 5322ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 21:26:47] [INFO ] After 5323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-16 21:26:47] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 348 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 24548 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24548 steps, saw 22221 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 21:26:51] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:26:51] [INFO ] Computed 13 place invariants in 52 ms
[2023-03-16 21:26:51] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:27:09] [INFO ] After 17147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 21:27:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-16 21:27:31] [INFO ] After 22237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 21:27:31] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:27:34] [INFO ] After 2553ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 21:27:34] [INFO ] After 2554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-16 21:27:34] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 190 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 191 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:27:34] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:27:34] [INFO ] Invariant cache hit.
[2023-03-16 21:27:36] [INFO ] Implicit Places using invariants in 1955 ms returned []
Implicit Place search using SMT only with invariants took 1955 ms to find 0 implicit places.
[2023-03-16 21:27:36] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:27:36] [INFO ] Invariant cache hit.
[2023-03-16 21:27:45] [INFO ] Dead Transitions using invariants and state equation in 8661 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10812 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p3)), (X (OR p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p3))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F p2), (F p3), (F (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) (NOT p1)))))]
Knowledge based reduction with 14 factoid took 717 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p3) p1 p2), (NOT p3), (OR p1 p2), p2, (OR p1 p2)]
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p3) p1 p2), (NOT p3), (OR p1 p2), p2, (OR p1 p2)]
[2023-03-16 21:27:46] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:27:46] [INFO ] Computed 13 place invariants in 47 ms
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p3) p1 p2), (NOT p3), (OR p1 p2), p2, (OR p1 p2)]
Product exploration explored 100000 steps with 0 reset in 3402 ms.
Product exploration explored 100000 steps with 0 reset in 3326 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p3) p1 p2), (NOT p3), (OR p1 p2), p2, (OR p1 p2)]
Support contains 8 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 182 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:28:08] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:28:08] [INFO ] Invariant cache hit.
[2023-03-16 21:28:18] [INFO ] Dead Transitions using invariants and state equation in 9176 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9364 ms. Remains : 627/627 places, 31353/31353 transitions.
Support contains 8 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 74 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:28:18] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:28:18] [INFO ] Invariant cache hit.
[2023-03-16 21:28:20] [INFO ] Implicit Places using invariants in 1911 ms returned []
Implicit Place search using SMT only with invariants took 1912 ms to find 0 implicit places.
[2023-03-16 21:28:20] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:28:20] [INFO ] Invariant cache hit.
[2023-03-16 21:28:28] [INFO ] Dead Transitions using invariants and state equation in 8624 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10610 ms. Remains : 627/627 places, 31353/31353 transitions.
Treatment of property RERS17pb113-PT-7-LTLFireability-15 finished in 293775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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(X((F(G(p0))||G((p1||F(p2)))))))))'
Found a Lengthening insensitive property : RERS17pb113-PT-7-LTLFireability-04
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 175 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:28:30] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:28:30] [INFO ] Invariant cache hit.
[2023-03-16 21:28:32] [INFO ] Implicit Places using invariants in 1877 ms returned []
Implicit Place search using SMT only with invariants took 1883 ms to find 0 implicit places.
[2023-03-16 21:28:32] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:28:32] [INFO ] Invariant cache hit.
[2023-03-16 21:28:41] [INFO ] Dead Transitions using invariants and state equation in 9023 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11086 ms. Remains : 627/627 places, 31353/31353 transitions.
Running random walk in product with property : RERS17pb113-PT-7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(AND (GEQ s207 1) (GEQ s366 1)), p2:(AND (GEQ s133 1) (GEQ s452 1)), p0:(AND (GEQ s222 1) (GEQ s355 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3063 ms.
Product exploration explored 100000 steps with 0 reset in 3016 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-16 21:28:48] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:28:48] [INFO ] Invariant cache hit.
[2023-03-16 21:28:48] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:28:48] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:28:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:29:06] [INFO ] After 17604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:29:06] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 21:29:13] [INFO ] After 7181ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 21:29:13] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 353 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26422 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26422 steps, saw 23892 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:29:17] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:29:17] [INFO ] Computed 13 place invariants in 50 ms
[2023-03-16 21:29:17] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:29:17] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:29:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:29:34] [INFO ] After 16561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:29:34] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:29:41] [INFO ] After 7406ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 21:29:43] [INFO ] Deduced a trap composed of 24 places in 897 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 21:29:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 21:29:43] [INFO ] After 25858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 169 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 154 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:29:43] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:29:43] [INFO ] Invariant cache hit.
[2023-03-16 21:29:45] [INFO ] Implicit Places using invariants in 1904 ms returned []
Implicit Place search using SMT only with invariants took 1907 ms to find 0 implicit places.
[2023-03-16 21:29:45] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:29:45] [INFO ] Invariant cache hit.
[2023-03-16 21:29:54] [INFO ] Dead Transitions using invariants and state equation in 9062 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11126 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 554 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:29:55] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 21:29:55] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:29:55] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:29:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:30:26] [INFO ] After 30860ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:30:30] [INFO ] After 34483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2180 ms.
[2023-03-16 21:30:32] [INFO ] After 36767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
[2023-03-16 21:30:33] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:30:33] [INFO ] Computed 13 place invariants in 51 ms
Could not prove EG (AND (NOT p1) (NOT p2) (NOT p0))
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 72 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:30:48] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:30:48] [INFO ] Invariant cache hit.
[2023-03-16 21:30:50] [INFO ] Implicit Places using invariants in 1948 ms returned []
Implicit Place search using SMT only with invariants took 1953 ms to find 0 implicit places.
[2023-03-16 21:30:50] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:30:50] [INFO ] Invariant cache hit.
[2023-03-16 21:30:59] [INFO ] Dead Transitions using invariants and state equation in 8906 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10933 ms. Remains : 627/627 places, 31353/31353 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:31:00] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:31:00] [INFO ] Invariant cache hit.
[2023-03-16 21:31:00] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:31:00] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:31:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:31:18] [INFO ] After 17570ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:31:18] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 21:31:25] [INFO ] After 7228ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 21:31:25] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 347 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 347 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26258 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26258 steps, saw 23751 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:31:29] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:31:29] [INFO ] Computed 13 place invariants in 45 ms
[2023-03-16 21:31:29] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:31:29] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:31:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:31:46] [INFO ] After 17306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:31:46] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:31:54] [INFO ] After 7535ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 21:31:54] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 155 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 151 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:31:54] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:31:54] [INFO ] Invariant cache hit.
[2023-03-16 21:31:56] [INFO ] Implicit Places using invariants in 1873 ms returned []
Implicit Place search using SMT only with invariants took 1886 ms to find 0 implicit places.
[2023-03-16 21:31:56] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:31:56] [INFO ] Invariant cache hit.
[2023-03-16 21:32:05] [INFO ] Dead Transitions using invariants and state equation in 9066 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11115 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 503 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:32:06] [INFO ] Computed 13 place invariants in 50 ms
[2023-03-16 21:32:06] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:32:06] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:32:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-16 21:32:36] [INFO ] After 30025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:32:40] [INFO ] After 33493ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2110 ms.
[2023-03-16 21:32:42] [INFO ] After 35722ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
[2023-03-16 21:32:42] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:32:42] [INFO ] Computed 13 place invariants in 51 ms
Could not prove EG (AND (NOT p1) (NOT p2) (NOT p0))
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 2972 ms.
Product exploration explored 100000 steps with 0 reset in 3080 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 151 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:33:04] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:33:04] [INFO ] Invariant cache hit.
[2023-03-16 21:33:14] [INFO ] Dead Transitions using invariants and state equation in 9336 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9514 ms. Remains : 627/627 places, 31353/31353 transitions.
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 69 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:33:14] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:33:14] [INFO ] Invariant cache hit.
[2023-03-16 21:33:16] [INFO ] Implicit Places using invariants in 1867 ms returned []
Implicit Place search using SMT only with invariants took 1869 ms to find 0 implicit places.
[2023-03-16 21:33:16] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:33:16] [INFO ] Invariant cache hit.
[2023-03-16 21:33:25] [INFO ] Dead Transitions using invariants and state equation in 9532 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11484 ms. Remains : 627/627 places, 31353/31353 transitions.
Treatment of property RERS17pb113-PT-7-LTLFireability-04 finished in 296554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((F(G(p2))&&p1)))))'
Found a Shortening insensitive property : RERS17pb113-PT-7-LTLFireability-05
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 168 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 21:33:27] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:33:27] [INFO ] Computed 13 place invariants in 49 ms
[2023-03-16 21:33:29] [INFO ] Implicit Places using invariants in 1881 ms returned []
Implicit Place search using SMT only with invariants took 1896 ms to find 0 implicit places.
[2023-03-16 21:33:29] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:33:29] [INFO ] Invariant cache hit.
[2023-03-16 21:33:38] [INFO ] Dead Transitions using invariants and state equation in 9316 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11400 ms. Remains : 626/627 places, 31352/31353 transitions.
Running random walk in product with property : RERS17pb113-PT-7-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s161 1) (GEQ s342 1)), p1:(AND (GEQ s161 1) (GEQ s342 1)), p2:(AND (GEQ s263 1) (GEQ s364 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3194 ms.
Product exploration explored 100000 steps with 0 reset in 2993 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 21:33:45] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:33:45] [INFO ] Invariant cache hit.
[2023-03-16 21:33:45] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:34:07] [INFO ] After 21401ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 21:34:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:34:28] [INFO ] After 21641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 21:34:28] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:34:32] [INFO ] After 3170ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 21:34:32] [INFO ] After 3171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-16 21:34:32] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 171 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 25543 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25543 steps, saw 23105 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 21:34:35] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:34:35] [INFO ] Invariant cache hit.
[2023-03-16 21:34:35] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:34:57] [INFO ] After 21348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 21:34:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:35:18] [INFO ] After 21204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 21:35:18] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:35:22] [INFO ] After 3613ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 21:35:22] [INFO ] After 3614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 21:35:22] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 153 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 153 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:35:22] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:35:22] [INFO ] Invariant cache hit.
[2023-03-16 21:35:24] [INFO ] Implicit Places using invariants in 1852 ms returned []
Implicit Place search using SMT only with invariants took 1876 ms to find 0 implicit places.
[2023-03-16 21:35:24] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:35:24] [INFO ] Invariant cache hit.
[2023-03-16 21:35:33] [INFO ] Dead Transitions using invariants and state equation in 9377 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11410 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 6 factoid took 268 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
[2023-03-16 21:35:34] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:35:34] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-16 21:35:49] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:35:49] [INFO ] Invariant cache hit.
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:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 21:36:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
[2023-03-16 21:36:04] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:36:04] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 67 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:36:19] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:36:19] [INFO ] Invariant cache hit.
[2023-03-16 21:36:21] [INFO ] Implicit Places using invariants in 1849 ms returned []
Implicit Place search using SMT only with invariants took 1860 ms to find 0 implicit places.
[2023-03-16 21:36:21] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:36:21] [INFO ] Invariant cache hit.
[2023-03-16 21:36:30] [INFO ] Dead Transitions using invariants and state equation in 9261 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11195 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 358 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 24085 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24085 steps, saw 21804 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 21:36:34] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:36:34] [INFO ] Invariant cache hit.
[2023-03-16 21:36:34] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:36:52] [INFO ] After 17685ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 21:36:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:37:10] [INFO ] After 18085ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 21:37:10] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:37:16] [INFO ] After 5928ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 21:37:17] [INFO ] Deduced a trap composed of 64 places in 492 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 21:37:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 21:37:17] [INFO ] After 25115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 153 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 23873 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23873 steps, saw 21623 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 21:37:21] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:37:21] [INFO ] Invariant cache hit.
[2023-03-16 21:37:21] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:37:38] [INFO ] After 17569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 21:37:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:37:57] [INFO ] After 18122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 21:37:57] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:38:03] [INFO ] After 5927ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 21:38:04] [INFO ] Deduced a trap composed of 64 places in 521 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 21:38:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 21:38:04] [INFO ] After 25201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 155 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 154 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:38:04] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:38:04] [INFO ] Invariant cache hit.
[2023-03-16 21:38:06] [INFO ] Implicit Places using invariants in 1797 ms returned []
Implicit Place search using SMT only with invariants took 1816 ms to find 0 implicit places.
[2023-03-16 21:38:06] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:38:06] [INFO ] Invariant cache hit.
[2023-03-16 21:38:15] [INFO ] Dead Transitions using invariants and state equation in 9351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11337 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
[2023-03-16 21:38:16] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:38:16] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-16 21:38:31] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:38:31] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
[2023-03-16 21:38:46] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:38:46] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 2874 ms.
Product exploration explored 100000 steps with 0 reset in 2944 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 150 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:39:08] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:39:08] [INFO ] Invariant cache hit.
[2023-03-16 21:39:17] [INFO ] Dead Transitions using invariants and state equation in 9030 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9182 ms. Remains : 626/626 places, 31352/31352 transitions.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 63 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:39:17] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:39:17] [INFO ] Invariant cache hit.
[2023-03-16 21:39:18] [INFO ] Implicit Places using invariants in 1787 ms returned []
Implicit Place search using SMT only with invariants took 1788 ms to find 0 implicit places.
[2023-03-16 21:39:19] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:39:19] [INFO ] Invariant cache hit.
[2023-03-16 21:39:27] [INFO ] Dead Transitions using invariants and state equation in 8862 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10714 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-7-LTLFireability-05 finished in 362142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(p1))))))'
Found a Shortening insensitive property : RERS17pb113-PT-7-LTLFireability-08
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 154 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 21:39:29] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:39:29] [INFO ] Invariant cache hit.
[2023-03-16 21:39:30] [INFO ] Implicit Places using invariants in 1908 ms returned []
Implicit Place search using SMT only with invariants took 1908 ms to find 0 implicit places.
[2023-03-16 21:39:30] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:39:30] [INFO ] Invariant cache hit.
[2023-03-16 21:39:39] [INFO ] Dead Transitions using invariants and state equation in 8922 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10994 ms. Remains : 626/627 places, 31352/31353 transitions.
Running random walk in product with property : RERS17pb113-PT-7-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s263 1) (GEQ s587 1)), p1:(AND (GEQ s561 1) (GEQ s569 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12 reset in 2875 ms.
Product exploration explored 100000 steps with 14 reset in 2991 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1403 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=70 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-16 21:39:46] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:39:46] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 64 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:40:01] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:40:01] [INFO ] Invariant cache hit.
[2023-03-16 21:40:03] [INFO ] Implicit Places using invariants in 1807 ms returned []
Implicit Place search using SMT only with invariants took 1821 ms to find 0 implicit places.
[2023-03-16 21:40:03] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:40:03] [INFO ] Invariant cache hit.
[2023-03-16 21:40:13] [INFO ] Dead Transitions using invariants and state equation in 9529 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11416 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 6106 steps, including 1 resets, run visited all 1 properties in 212 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-16 21:40:14] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:40:14] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 18 reset in 3624 ms.
Product exploration explored 100000 steps with 10 reset in 3698 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 155 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:40:37] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:40:37] [INFO ] Invariant cache hit.
[2023-03-16 21:40:46] [INFO ] Dead Transitions using invariants and state equation in 9189 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9346 ms. Remains : 626/626 places, 31352/31352 transitions.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 70 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:40:46] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:40:46] [INFO ] Invariant cache hit.
[2023-03-16 21:40:48] [INFO ] Implicit Places using invariants in 1858 ms returned []
Implicit Place search using SMT only with invariants took 1862 ms to find 0 implicit places.
[2023-03-16 21:40:48] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:40:48] [INFO ] Invariant cache hit.
[2023-03-16 21:40:57] [INFO ] Dead Transitions using invariants and state equation in 9183 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11119 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-7-LTLFireability-08 finished in 89830 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' '!((p0 U G(!p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U X(G(p0)))))'
Found a Lengthening insensitive property : RERS17pb113-PT-7-LTLFireability-11
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 179 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 21:40:59] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:40:59] [INFO ] Invariant cache hit.
[2023-03-16 21:41:01] [INFO ] Implicit Places using invariants in 1923 ms returned []
Implicit Place search using SMT only with invariants took 1927 ms to find 0 implicit places.
[2023-03-16 21:41:01] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:41:01] [INFO ] Invariant cache hit.
[2023-03-16 21:41:10] [INFO ] Dead Transitions using invariants and state equation in 9092 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11202 ms. Remains : 626/627 places, 31352/31353 transitions.
Running random walk in product with property : RERS17pb113-PT-7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s44 1) (GEQ s423 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3305 ms.
Product exploration explored 100000 steps with 0 reset in 3222 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 117 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 25221 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25221 steps, saw 22820 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:41:20] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:41:20] [INFO ] Invariant cache hit.
[2023-03-16 21:41:20] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:41:34] [INFO ] After 13606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:41:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:41:49] [INFO ] After 15217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:41:49] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:41:59] [INFO ] After 9594ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 21:41:59] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 175 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 25200 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25200 steps, saw 22802 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:42:02] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:42:02] [INFO ] Invariant cache hit.
[2023-03-16 21:42:02] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:42:15] [INFO ] After 13077ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:42:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:42:31] [INFO ] After 15377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:42:31] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:42:40] [INFO ] After 9452ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 21:42:40] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 163 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 157 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:42:41] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:42:41] [INFO ] Invariant cache hit.
[2023-03-16 21:42:43] [INFO ] Implicit Places using invariants in 1940 ms returned []
Implicit Place search using SMT only with invariants took 1941 ms to find 0 implicit places.
[2023-03-16 21:42:43] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:42:43] [INFO ] Invariant cache hit.
[2023-03-16 21:42:52] [INFO ] Dead Transitions using invariants and state equation in 9519 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11630 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 527 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:42:53] [INFO ] Computed 13 place invariants in 52 ms
[2023-03-16 21:42:53] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:43:13] [INFO ] After 20288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:43:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:43:32] [INFO ] After 18362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:43:32] [INFO ] After 19145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 437 ms.
[2023-03-16 21:43:33] [INFO ] After 19684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0), true]
[2023-03-16 21:43:33] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:43:33] [INFO ] Computed 13 place invariants in 55 ms
Could not prove EG (NOT p0)
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 74 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:43:49] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:43:49] [INFO ] Invariant cache hit.
[2023-03-16 21:43:50] [INFO ] Implicit Places using invariants in 1914 ms returned []
Implicit Place search using SMT only with invariants took 1923 ms to find 0 implicit places.
[2023-03-16 21:43:51] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:43:51] [INFO ] Invariant cache hit.
[2023-03-16 21:44:00] [INFO ] Dead Transitions using invariants and state equation in 9419 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11418 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 5162 steps, including 1 resets, run visited all 1 properties in 109 ms. (steps per millisecond=47 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), true]
[2023-03-16 21:44:01] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:44:01] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 0 reset in 3166 ms.
Product exploration explored 100000 steps with 0 reset in 3360 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 163 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:44:23] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:44:23] [INFO ] Invariant cache hit.
[2023-03-16 21:44:32] [INFO ] Dead Transitions using invariants and state equation in 9478 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9652 ms. Remains : 626/626 places, 31352/31352 transitions.
Support contains 2 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 72 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:44:33] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:44:33] [INFO ] Invariant cache hit.
[2023-03-16 21:44:34] [INFO ] Implicit Places using invariants in 1873 ms returned []
Implicit Place search using SMT only with invariants took 1884 ms to find 0 implicit places.
[2023-03-16 21:44:34] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:44:34] [INFO ] Invariant cache hit.
[2023-03-16 21:44:44] [INFO ] Dead Transitions using invariants and state equation in 9401 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11373 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-7-LTLFireability-11 finished in 226703 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)))'
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(G((p0 U (!p1&&F(!p2))))) U p3)))'
[2023-03-16 21:44:46] [INFO ] Flatten gal took : 723 ms
[2023-03-16 21:44:46] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-16 21:44:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 627 places, 31353 transitions and 125406 arcs took 100 ms.
Total runtime 3179806 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3956/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3956/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3956/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3956/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3956/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3956/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3956/ltl_6_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3956/ltl_7_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : RERS17pb113-PT-7-LTLFireability-00
Could not compute solution for formula : RERS17pb113-PT-7-LTLFireability-04
Could not compute solution for formula : RERS17pb113-PT-7-LTLFireability-05
Could not compute solution for formula : RERS17pb113-PT-7-LTLFireability-08
Could not compute solution for formula : RERS17pb113-PT-7-LTLFireability-10
Could not compute solution for formula : RERS17pb113-PT-7-LTLFireability-11
Could not compute solution for formula : RERS17pb113-PT-7-LTLFireability-13
Could not compute solution for formula : RERS17pb113-PT-7-LTLFireability-15
BK_STOP 1679003148751
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name RERS17pb113-PT-7-LTLFireability-00
ltl formula formula --ltl=/tmp/3956/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 627 places, 31353 transitions and 125406 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.410 real 0.950 user 0.740 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3956/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3956/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3956/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3956/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name RERS17pb113-PT-7-LTLFireability-04
ltl formula formula --ltl=/tmp/3956/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 627 places, 31353 transitions and 125406 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.960 real 0.980 user 1.160 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3956/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3956/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3956/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3956/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name RERS17pb113-PT-7-LTLFireability-05
ltl formula formula --ltl=/tmp/3956/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 627 places, 31353 transitions and 125406 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.050 real 1.030 user 1.360 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3956/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3956/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3956/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3956/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name RERS17pb113-PT-7-LTLFireability-08
ltl formula formula --ltl=/tmp/3956/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 627 places, 31353 transitions and 125406 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3956/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3956/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.990 real 1.150 user 1.140 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3956/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3956/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name RERS17pb113-PT-7-LTLFireability-10
ltl formula formula --ltl=/tmp/3956/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 627 places, 31353 transitions and 125406 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.690 real 1.310 user 0.960 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3956/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3956/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3956/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3956/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name RERS17pb113-PT-7-LTLFireability-11
ltl formula formula --ltl=/tmp/3956/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 627 places, 31353 transitions and 125406 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.000 real 1.050 user 1.290 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3956/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3956/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3956/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3956/ltl_5_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name RERS17pb113-PT-7-LTLFireability-13
ltl formula formula --ltl=/tmp/3956/ltl_6_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 627 places, 31353 transitions and 125406 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.980 real 1.320 user 1.550 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3956/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3956/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3956/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3956/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name RERS17pb113-PT-7-LTLFireability-15
ltl formula formula --ltl=/tmp/3956/ltl_7_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 627 places, 31353 transitions and 125406 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.150 real 1.110 user 1.210 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3956/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3956/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3956/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3956/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS17pb113-PT-7"
export BK_EXAMINATION="LTLFireability"
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 RERS17pb113-PT-7, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889201500052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb113-PT-7.tgz
mv RERS17pb113-PT-7 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;