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 |
| 6006.396 | 2632124.00 | 2908088.00 | 6748.90 | FT????F?FT??F??F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r329-tall-167889201500051.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889201500051
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME RERS17pb113-PT-7-LTLCardinality-01
FORMULA_NAME RERS17pb113-PT-7-LTLCardinality-02
FORMULA_NAME RERS17pb113-PT-7-LTLCardinality-03
FORMULA_NAME RERS17pb113-PT-7-LTLCardinality-04
FORMULA_NAME RERS17pb113-PT-7-LTLCardinality-05
FORMULA_NAME RERS17pb113-PT-7-LTLCardinality-06
FORMULA_NAME RERS17pb113-PT-7-LTLCardinality-07
FORMULA_NAME RERS17pb113-PT-7-LTLCardinality-08
FORMULA_NAME RERS17pb113-PT-7-LTLCardinality-09
FORMULA_NAME RERS17pb113-PT-7-LTLCardinality-10
FORMULA_NAME RERS17pb113-PT-7-LTLCardinality-11
FORMULA_NAME RERS17pb113-PT-7-LTLCardinality-12
FORMULA_NAME RERS17pb113-PT-7-LTLCardinality-13
FORMULA_NAME RERS17pb113-PT-7-LTLCardinality-14
FORMULA_NAME RERS17pb113-PT-7-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678999306052
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-7
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 20:41:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 20:41:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 20:41:48] [INFO ] Load time of PNML (sax parser for PT used): 625 ms
[2023-03-16 20:41:48] [INFO ] Transformed 639 places.
[2023-03-16 20:41:48] [INFO ] Transformed 31353 transitions.
[2023-03-16 20:41:48] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 833 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA RERS17pb113-PT-7-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-7-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-7-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-7-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 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 228 ms. Remains 627 /639 variables (removed 12) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 20:41:49] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 20:41:49] [INFO ] Computed 13 place invariants in 107 ms
[2023-03-16 20:41:51] [INFO ] Implicit Places using invariants in 2289 ms returned []
Implicit Place search using SMT only with invariants took 2319 ms to find 0 implicit places.
[2023-03-16 20:41:51] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:41:51] [INFO ] Invariant cache hit.
[2023-03-16 20:42:00] [INFO ] Dead Transitions using invariants and state equation in 8761 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 11322 ms. Remains : 627/639 places, 31353/31353 transitions.
Support contains 42 out of 627 places after structural reductions.
[2023-03-16 20:42:01] [INFO ] Flatten gal took : 1111 ms
[2023-03-16 20:42:02] [INFO ] Flatten gal took : 896 ms
[2023-03-16 20:42:04] [INFO ] Input system was already deterministic with 31353 transitions.
Support contains 41 out of 627 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 815 ms. (steps per millisecond=12 ) properties (out of 28) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-16 20:42:06] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:42:06] [INFO ] Invariant cache hit.
[2023-03-16 20:42:06] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:42:06] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-16 20:42:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-16 20:42:24] [INFO ] After 17845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-16 20:42:25] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 20:42:31] [INFO ] After 6580ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-16 20:42:31] [INFO ] After 6580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-16 20:42:31] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 81 ms.
Support contains 18 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 518 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 519 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-16 20:42:33] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:42:33] [INFO ] Computed 13 place invariants in 64 ms
[2023-03-16 20:42:33] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:42:33] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-16 20:42:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:42:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:42:58] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 204 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-16 20:42:59] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:42:59] [INFO ] Invariant cache hit.
[2023-03-16 20:42:59] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-16 20:42:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 20:43:19] [INFO ] After 19606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-16 20:43:19] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 20:43:24] [INFO ] After 4861ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 20:43:24] [INFO ] After 4863ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-16 20:43:24] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 34 ms.
Support contains 10 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 223 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 223 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-16 20:43:25] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:43:25] [INFO ] Invariant cache hit.
[2023-03-16 20:43:25] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-16 20:43:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:43:44] [INFO ] After 18286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-16 20:43:44] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 20:43:50] [INFO ] After 6400ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-16 20:43:50] [INFO ] After 6478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-16 20:43:50] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 19 ms.
Support contains 8 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 175 ms. Remains : 626/626 places, 31352/31352 transitions.
FORMULA RERS17pb113-PT-7-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((G(F(p0))&&F(p1)))'
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 201 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 20:43:51] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:43:51] [INFO ] Invariant cache hit.
[2023-03-16 20:43:53] [INFO ] Implicit Places using invariants in 1895 ms returned []
Implicit Place search using SMT only with invariants took 1897 ms to find 0 implicit places.
[2023-03-16 20:43:53] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:43:53] [INFO ] Invariant cache hit.
[2023-03-16 20:44:02] [INFO ] Dead Transitions using invariants and state equation in 8791 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10892 ms. Remains : 626/627 places, 31352/31353 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : RERS17pb113-PT-7-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 3 s541), p1:(AND (GT s192 s295) (LEQ 2 s537))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 3161 ms.
Product exploration explored 100000 steps with 0 reset in 3120 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 p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 281 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 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
Interrupted probabilistic random walk after 23374 steps, run timeout after 3002 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23374 steps, saw 21175 distinct states, run finished after 3003 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 20:44:13] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:44:13] [INFO ] Invariant cache hit.
[2023-03-16 20:44:13] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-16 20:44:13] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 20:44:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:44:28] [INFO ] After 15121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 20:44:28] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 20:44:38] [INFO ] After 9716ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 20:44:38] [INFO ] After 9718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-16 20:44:38] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 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 169 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 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 23482 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23482 steps, saw 21271 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 20:44:41] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:44:41] [INFO ] Invariant cache hit.
[2023-03-16 20:44:42] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:44:42] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 20:44:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 20:44:57] [INFO ] After 15356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 20:44:57] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 20:45:07] [INFO ] After 9469ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 20:45:07] [INFO ] After 9471ms 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 20:45:07] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 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 168 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 20:45:07] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:45:07] [INFO ] Invariant cache hit.
[2023-03-16 20:45:09] [INFO ] Implicit Places using invariants in 1837 ms returned []
Implicit Place search using SMT only with invariants took 1840 ms to find 0 implicit places.
[2023-03-16 20:45:09] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:45:09] [INFO ] Invariant cache hit.
[2023-03-16 20:45:17] [INFO ] Dead Transitions using invariants and state equation in 8357 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10369 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 649 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:45:18] [INFO ] Computed 13 place invariants in 58 ms
[2023-03-16 20:45:18] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:45:18] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 20:45:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:45:40] [INFO ] After 21916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 20:45:42] [INFO ] After 23437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 886 ms.
[2023-03-16 20:45:43] [INFO ] After 24428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
[2023-03-16 20:45:43] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:45:43] [INFO ] Computed 13 place invariants in 58 ms
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 70 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 20:45:58] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:45:58] [INFO ] Invariant cache hit.
[2023-03-16 20:46:00] [INFO ] Implicit Places using invariants in 1863 ms returned []
Implicit Place search using SMT only with invariants took 1867 ms to find 0 implicit places.
[2023-03-16 20:46:00] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:46:00] [INFO ] Invariant cache hit.
[2023-03-16 20:46:09] [INFO ] Dead Transitions using invariants and state equation in 8341 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10280 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 p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 244 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) 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
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 24078 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24078 steps, saw 21798 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 20:46:13] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:46:13] [INFO ] Invariant cache hit.
[2023-03-16 20:46:13] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 20:46:13] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 20:46:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:46:28] [INFO ] After 15230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 20:46:28] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 20:46:38] [INFO ] After 9594ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 20:46:38] [INFO ] After 9595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-16 20:46:38] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 168 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 2) 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 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 24227 steps, run timeout after 3002 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24227 steps, saw 21931 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 20:46:41] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:46:41] [INFO ] Invariant cache hit.
[2023-03-16 20:46:41] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:46:41] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 20:46:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:46:57] [INFO ] After 15294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 20:46:57] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 20:47:07] [INFO ] After 9526ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 20:47:07] [INFO ] After 9527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-16 20:47:07] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 188 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 188 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 164 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 20:47:07] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:47:07] [INFO ] Invariant cache hit.
[2023-03-16 20:47:09] [INFO ] Implicit Places using invariants in 1811 ms returned []
Implicit Place search using SMT only with invariants took 1812 ms to find 0 implicit places.
[2023-03-16 20:47:09] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:47:09] [INFO ] Invariant cache hit.
[2023-03-16 20:47:17] [INFO ] Dead Transitions using invariants and state equation in 8370 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10350 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 552 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:47:18] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 20:47:18] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:47:18] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 20:47:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:47:40] [INFO ] After 21990ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 20:47:41] [INFO ] After 23464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 861 ms.
[2023-03-16 20:47:42] [INFO ] After 24437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 239 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
[2023-03-16 20:47:43] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:47:43] [INFO ] Computed 13 place invariants in 51 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 2971 ms.
Product exploration explored 100000 steps with 0 reset in 3071 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (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 259 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 20:48:05] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:48:05] [INFO ] Invariant cache hit.
[2023-03-16 20:48:13] [INFO ] Dead Transitions using invariants and state equation in 8382 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8642 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 74 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 20:48:13] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:48:13] [INFO ] Invariant cache hit.
[2023-03-16 20:48:15] [INFO ] Implicit Places using invariants in 1885 ms returned []
Implicit Place search using SMT only with invariants took 1889 ms to find 0 implicit places.
[2023-03-16 20:48:15] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:48:15] [INFO ] Invariant cache hit.
[2023-03-16 20:48:24] [INFO ] Dead Transitions using invariants and state equation in 8402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10368 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-7-LTLCardinality-02 finished in 273982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((X(p0)&&(p1||G(F(p2))))||G(p0)))))'
Support contains 3 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 78 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 20:48:25] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 20:48:25] [INFO ] Computed 13 place invariants in 43 ms
[2023-03-16 20:48:27] [INFO ] Implicit Places using invariants in 1917 ms returned []
Implicit Place search using SMT only with invariants took 1918 ms to find 0 implicit places.
[2023-03-16 20:48:27] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:48:27] [INFO ] Invariant cache hit.
[2023-03-16 20:48:35] [INFO ] Dead Transitions using invariants and state equation in 8266 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10266 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : RERS17pb113-PT-7-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 0}]], initial=6, aps=[p1:(GT 1 s333), p2:(GT 2 s302), p0:(LEQ 2 s312)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3288 ms.
Product exploration explored 100000 steps with 0 reset in 3476 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 439 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-16 20:48:44] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:48:44] [INFO ] Invariant cache hit.
[2023-03-16 20:48:44] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:48:59] [INFO ] After 15385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 20:48:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 20:49:23] [INFO ] After 23720ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 20:49:23] [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: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 20:49:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:49:24] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 16 ms.
Support contains 3 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 313 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 314 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 24341 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24341 steps, saw 22034 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-16 20:49:28] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:49:28] [INFO ] Computed 13 place invariants in 49 ms
[2023-03-16 20:49:28] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:49:43] [INFO ] After 14901ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 20:49:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 20:50:03] [INFO ] After 19697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 20:50:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 20:50:08] [INFO ] After 5090ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 20:50:08] [INFO ] After 5091ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-16 20:50:08] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 18 ms.
Support contains 3 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 153 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 20:50:09] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:50:09] [INFO ] Invariant cache hit.
[2023-03-16 20:50:10] [INFO ] Implicit Places using invariants in 1883 ms returned []
Implicit Place search using SMT only with invariants took 1884 ms to find 0 implicit places.
[2023-03-16 20:50:10] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:50:10] [INFO ] Invariant cache hit.
[2023-03-16 20:50:19] [INFO ] Dead Transitions using invariants and state equation in 8566 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10608 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 574 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:50:20] [INFO ] Computed 13 place invariants in 50 ms
[2023-03-16 20:50:20] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:50:34] [INFO ] After 14280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 20:50:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 20:50:51] [INFO ] After 16757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 20:50:54] [INFO ] After 19909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1862 ms.
[2023-03-16 20:50:56] [INFO ] After 21919ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 540 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 318 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
[2023-03-16 20:50:57] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 20:50:57] [INFO ] Computed 13 place invariants in 49 ms
Could not prove EG (NOT p0)
Support contains 3 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:51:12] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:51:12] [INFO ] Invariant cache hit.
[2023-03-16 20:51:14] [INFO ] Implicit Places using invariants in 1832 ms returned []
Implicit Place search using SMT only with invariants took 1833 ms to find 0 implicit places.
[2023-03-16 20:51:14] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:51:14] [INFO ] Invariant cache hit.
[2023-03-16 20:51:23] [INFO ] Dead Transitions using invariants and state equation in 8509 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10418 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) p1 p2), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 224 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-16 20:51:24] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:51:24] [INFO ] Invariant cache hit.
[2023-03-16 20:51:24] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:51:39] [INFO ] After 15151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 20:51:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 20:52:03] [INFO ] After 23636ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 20:52:03] [INFO ] State equation strengthened by 829 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:52:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:52:04] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 18 ms.
Support contains 3 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 307 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 307 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 23944 steps, run timeout after 3002 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23944 steps, saw 21683 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-16 20:52:08] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:52:08] [INFO ] Computed 13 place invariants in 47 ms
[2023-03-16 20:52:08] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 20:52:23] [INFO ] After 14962ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 20:52:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 20:52:44] [INFO ] After 20192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 20:52:44] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 20:52:48] [INFO ] After 4597ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 20:52:48] [INFO ] After 4598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-16 20:52:48] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 20 ms.
Support contains 3 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 170 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 170 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 171 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 20:52:49] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:52:49] [INFO ] Invariant cache hit.
[2023-03-16 20:52:51] [INFO ] Implicit Places using invariants in 1885 ms returned []
Implicit Place search using SMT only with invariants took 1886 ms to find 0 implicit places.
[2023-03-16 20:52:51] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:52:51] [INFO ] Invariant cache hit.
[2023-03-16 20:52:59] [INFO ] Dead Transitions using invariants and state equation in 8293 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10353 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 496 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:52:59] [INFO ] Computed 13 place invariants in 47 ms
[2023-03-16 20:53:00] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 20:53:14] [INFO ] After 14793ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 20:53:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:53:32] [INFO ] After 17118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 20:53:35] [INFO ] After 20295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1921 ms.
[2023-03-16 20:53:37] [INFO ] After 22350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 315 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
[2023-03-16 20:53:38] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 20:53:38] [INFO ] Computed 13 place invariants in 49 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 3164 ms.
Product exploration explored 100000 steps with 0 reset in 3233 ms.
Support contains 3 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:54:00] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:54:00] [INFO ] Invariant cache hit.
[2023-03-16 20:54:02] [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 20:54:02] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:54:02] [INFO ] Invariant cache hit.
[2023-03-16 20:54:10] [INFO ] Dead Transitions using invariants and state equation in 8319 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10299 ms. Remains : 627/627 places, 31353/31353 transitions.
Treatment of property RERS17pb113-PT-7-LTLCardinality-03 finished in 345815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 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 271 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 20:54:11] [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 48 ms
[2023-03-16 20:54:13] [INFO ] Implicit Places using invariants in 1972 ms returned []
Implicit Place search using SMT only with invariants took 1973 ms to find 0 implicit places.
[2023-03-16 20:54:13] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:54:13] [INFO ] Invariant cache hit.
[2023-03-16 20:54:21] [INFO ] Dead Transitions using invariants and state equation in 8123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10368 ms. Remains : 626/627 places, 31352/31353 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : RERS17pb113-PT-7-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GT s101 s583), p1:(GT 2 s186)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 3134 ms.
Product exploration explored 100000 steps with 0 reset in 3156 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 334 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) 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 20:54:29] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:54:29] [INFO ] Invariant cache hit.
[2023-03-16 20:54:29] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:54:45] [INFO ] After 16713ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 20:54:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:55:10] [INFO ] After 24928ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:55:10] [INFO ] State equation strengthened by 268 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:55:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:55:10] [INFO ] After 25129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 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 149 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 150 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 24966 steps, run timeout after 3002 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24966 steps, saw 22599 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 20:55:14] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:55:14] [INFO ] Invariant cache hit.
[2023-03-16 20:55:14] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:55:31] [INFO ] After 17224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 20:55:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:55:56] [INFO ] After 24929ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:55:56] [INFO ] State equation strengthened by 268 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:55:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:55:56] [INFO ] After 25132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 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 149 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 149 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 146 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 20:55:57] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:55:57] [INFO ] Invariant cache hit.
[2023-03-16 20:55:59] [INFO ] Implicit Places using invariants in 1901 ms returned []
Implicit Place search using SMT only with invariants took 1903 ms to find 0 implicit places.
[2023-03-16 20:55:59] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:55:59] [INFO ] Invariant cache hit.
[2023-03-16 20:56:07] [INFO ] Dead Transitions using invariants and state equation in 8090 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10142 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 2 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:56:07] [INFO ] Computed 13 place invariants in 45 ms
[2023-03-16 20:56:07] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:56:19] [INFO ] After 11843ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 20:56:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:56:35] [INFO ] After 15391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 20:56:36] [INFO ] After 16892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1338 ms.
[2023-03-16 20:56:38] [INFO ] After 18326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 362 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 148 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 20:56:38] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:56:38] [INFO ] Computed 13 place invariants in 50 ms
[2023-03-16 20:56:40] [INFO ] Implicit Places using invariants in 1869 ms returned []
Implicit Place search using SMT only with invariants took 1870 ms to find 0 implicit places.
[2023-03-16 20:56:40] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:56:40] [INFO ] Invariant cache hit.
[2023-03-16 20:56:48] [INFO ] Dead Transitions using invariants and state equation in 8054 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10075 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 335 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) 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 20:56:49] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:56:49] [INFO ] Invariant cache hit.
[2023-03-16 20:56:49] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:57:05] [INFO ] After 16038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 20:57:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:57:30] [INFO ] After 24930ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 20:57:30] [INFO ] State equation strengthened by 268 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:57:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:57:30] [INFO ] After 25127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 4 ms.
Support contains 3 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 140 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 140 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 2) 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 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
Interrupted probabilistic random walk after 25464 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25464 steps, saw 23034 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 20:57:34] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:57:34] [INFO ] Invariant cache hit.
[2023-03-16 20:57:34] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:57:50] [INFO ] After 16372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 20:57:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 20:58:15] [INFO ] After 24968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 20:58:16] [INFO ] State equation strengthened by 268 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:58:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:58:16] [INFO ] After 25174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 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 148 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 242 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 1779 ms returned []
Implicit Place search using SMT only with invariants took 1780 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 7894 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9919 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 475 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:58:26] [INFO ] Computed 13 place invariants in 45 ms
[2023-03-16 20:58:26] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-16 20:58:38] [INFO ] After 12109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 20:58:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 20:58:53] [INFO ] After 14943ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 20:58:55] [INFO ] After 16355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1218 ms.
[2023-03-16 20:58:56] [INFO ] After 17684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 314 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 2974 ms.
Product exploration explored 100000 steps with 0 reset in 3181 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 145 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 20:59:03] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 20:59:03] [INFO ] Computed 13 place invariants in 45 ms
[2023-03-16 20:59:05] [INFO ] Implicit Places using invariants in 1822 ms returned []
Implicit Place search using SMT only with invariants took 1836 ms to find 0 implicit places.
[2023-03-16 20:59:05] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 20:59:05] [INFO ] Invariant cache hit.
[2023-03-16 20:59:12] [INFO ] Dead Transitions using invariants and state equation in 7803 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9786 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-7-LTLCardinality-04 finished in 302860 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 3 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 20:59:14] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 20:59:14] [INFO ] Computed 13 place invariants in 44 ms
[2023-03-16 20:59:16] [INFO ] Implicit Places using invariants in 1882 ms returned []
Implicit Place search using SMT only with invariants took 1883 ms to find 0 implicit places.
[2023-03-16 20:59:16] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:59:16] [INFO ] Invariant cache hit.
[2023-03-16 20:59:24] [INFO ] Dead Transitions using invariants and state equation in 8074 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10034 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RERS17pb113-PT-7-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p1:(GT 2 s125), p0:(OR (GT s235 s506) (GT 2 s125))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 3757 ms.
Product exploration explored 100000 steps with 25000 reset in 3774 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2714 steps, including 0 resets, run visited all 3 properties in 77 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 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 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:34] [INFO ] Implicit Places using invariants in 1859 ms returned []
Implicit Place search using SMT only with invariants took 1860 ms to find 0 implicit places.
[2023-03-16 20:59:34] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:59:34] [INFO ] Invariant cache hit.
[2023-03-16 20:59:43] [INFO ] Dead Transitions using invariants and state equation in 8185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10114 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 p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3990 steps, including 1 resets, run visited all 3 properties in 193 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 3755 ms.
Product exploration explored 100000 steps with 25000 reset in 3770 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 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 163 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 20:59:52] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 20:59:52] [INFO ] Invariant cache hit.
[2023-03-16 21:00:00] [INFO ] Dead Transitions using invariants and state equation in 8155 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8322 ms. Remains : 627/627 places, 31353/31353 transitions.
Support contains 3 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:00:00] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:00:00] [INFO ] Invariant cache hit.
[2023-03-16 21:00:02] [INFO ] Implicit Places using invariants in 1832 ms returned []
Implicit Place search using SMT only with invariants took 1833 ms to find 0 implicit places.
[2023-03-16 21:00:02] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:00:02] [INFO ] Invariant cache hit.
[2023-03-16 21:00:10] [INFO ] Dead Transitions using invariants and state equation in 7978 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9882 ms. Remains : 627/627 places, 31353/31353 transitions.
Treatment of property RERS17pb113-PT-7-LTLCardinality-05 finished in 57444 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)))'
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 69 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:00:11] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:00:11] [INFO ] Invariant cache hit.
[2023-03-16 21:00:13] [INFO ] Implicit Places using invariants in 1935 ms returned []
Implicit Place search using SMT only with invariants took 1935 ms to find 0 implicit places.
[2023-03-16 21:00:13] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:00:13] [INFO ] Invariant cache hit.
[2023-03-16 21:00:21] [INFO ] Dead Transitions using invariants and state equation in 7853 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9858 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS17pb113-PT-7-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s247 s273)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 125 reset in 2680 ms.
Product exploration explored 100000 steps with 124 reset in 2686 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 102 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 852 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=65 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
[2023-03-16 21:00:27] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:00:27] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 159 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 21:00:42] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:00:42] [INFO ] Computed 13 place invariants in 43 ms
[2023-03-16 21:00:44] [INFO ] Implicit Places using invariants in 1736 ms returned []
Implicit Place search using SMT only with invariants took 1737 ms to find 0 implicit places.
[2023-03-16 21:00:44] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:00:44] [INFO ] Invariant cache hit.
[2023-03-16 21:00:52] [INFO ] Dead Transitions using invariants and state equation in 7803 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9704 ms. Remains : 626/627 places, 31352/31353 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 971 steps, including 0 resets, run visited all 1 properties in 22 ms. (steps per millisecond=44 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-16 21:00:52] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:00:52] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 129 reset in 2774 ms.
Product exploration explored 100000 steps with 138 reset in 2803 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 153 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:01:13] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:01:13] [INFO ] Invariant cache hit.
[2023-03-16 21:01:15] [INFO ] Implicit Places using invariants in 1844 ms returned []
Implicit Place search using SMT only with invariants took 1845 ms to find 0 implicit places.
[2023-03-16 21:01:15] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:01:15] [INFO ] Invariant cache hit.
[2023-03-16 21:01:23] [INFO ] Dead Transitions using invariants and state equation in 7959 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9960 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-7-LTLCardinality-07 finished in 72982 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(p1))&&G(p2))))'
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 67 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:01:24] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:01:24] [INFO ] Computed 13 place invariants in 43 ms
[2023-03-16 21:01:26] [INFO ] Implicit Places using invariants in 1839 ms returned []
Implicit Place search using SMT only with invariants took 1840 ms to find 0 implicit places.
[2023-03-16 21:01:26] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:01:26] [INFO ] Invariant cache hit.
[2023-03-16 21:01:34] [INFO ] Dead Transitions using invariants and state equation in 7891 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9799 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : RERS17pb113-PT-7-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 3}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(LEQ s417 s81), p2:(LEQ s359 s244), p1:(OR (LEQ 2 s291) (LEQ 3 s112))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1859 steps with 0 reset in 50 ms.
FORMULA RERS17pb113-PT-7-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb113-PT-7-LTLCardinality-08 finished in 10135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(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.
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:01:34] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:01:34] [INFO ] Computed 13 place invariants in 47 ms
[2023-03-16 21:01:36] [INFO ] Implicit Places using invariants in 1850 ms returned []
Implicit Place search using SMT only with invariants took 1850 ms to find 0 implicit places.
[2023-03-16 21:01:36] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:01:36] [INFO ] Invariant cache hit.
[2023-03-16 21:01:44] [INFO ] Dead Transitions using invariants and state equation in 7954 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9959 ms. Remains : 626/627 places, 31352/31353 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : RERS17pb113-PT-7-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s392), p1:(GT 2 s372)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 2765 ms.
Product exploration explored 100000 steps with 0 reset in 2811 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 272 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Finished random walk after 3806 steps, including 1 resets, run visited all 1 properties in 76 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 8 factoid took 405 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 56 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 626 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 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:01:51] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:01:51] [INFO ] Invariant cache hit.
[2023-03-16 21:01:53] [INFO ] Implicit Places using invariants in 1833 ms returned []
Implicit Place search using SMT only with invariants took 1834 ms to find 0 implicit places.
[2023-03-16 21:01:53] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:01:53] [INFO ] Invariant cache hit.
[2023-03-16 21:02:01] [INFO ] Dead Transitions using invariants and state equation in 7972 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9960 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 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 68 ms :[(NOT p1), (NOT p1)]
Finished random walk after 4086 steps, including 1 resets, run visited all 1 properties in 79 ms. (steps per millisecond=51 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 123 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 140 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 2745 ms.
Product exploration explored 100000 steps with 0 reset in 2860 ms.
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 145 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:02:08] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:02:08] [INFO ] Invariant cache hit.
[2023-03-16 21:02:09] [INFO ] Implicit Places using invariants in 1824 ms returned []
Implicit Place search using SMT only with invariants took 1825 ms to find 0 implicit places.
[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:17] [INFO ] Dead Transitions using invariants and state equation in 8004 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9977 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-7-LTLCardinality-10 finished in 44264 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((F(G(p0))&&G((p1&&X(p1))))))'
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 254 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 21:02:19] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:02:19] [INFO ] Invariant cache hit.
[2023-03-16 21:02:21] [INFO ] Implicit Places using invariants in 1832 ms returned []
Implicit Place search using SMT only with invariants took 1833 ms to find 0 implicit places.
[2023-03-16 21:02:21] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:02:21] [INFO ] Invariant cache hit.
[2023-03-16 21:02:29] [INFO ] Dead Transitions using invariants and state equation in 7990 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10079 ms. Remains : 626/627 places, 31352/31353 transitions.
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RERS17pb113-PT-7-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s375 s387), p0:(AND (GT 2 s483) (GT 2 s441))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 2755 ms.
Product exploration explored 100000 steps with 0 reset in 2858 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 274 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:02:35] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:02:35] [INFO ] Invariant cache hit.
[2023-03-16 21:02:35] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:02:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:02:56] [INFO ] After 20415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:02:56] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:03:00] [INFO ] After 4060ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 21:03:00] [INFO ] After 4431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-16 21:03:00] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
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 143 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 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 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26436 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26436 steps, saw 23904 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:03:04] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:03:04] [INFO ] Invariant cache hit.
[2023-03-16 21:03:04] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:03:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:03:24] [INFO ] After 20638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:03:25] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:03:29] [INFO ] After 3928ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 21:03:29] [INFO ] After 4159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-16 21:03:29] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 154 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 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 146 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:03:29] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:03:29] [INFO ] Invariant cache hit.
[2023-03-16 21:03:31] [INFO ] Implicit Places using invariants in 1887 ms returned []
Implicit Place search using SMT only with invariants took 1887 ms to find 0 implicit places.
[2023-03-16 21:03:31] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:03:31] [INFO ] Invariant cache hit.
[2023-03-16 21:03:39] [INFO ] Dead Transitions using invariants and state equation in 8145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10182 ms. Remains : 626/626 places, 31352/31352 transitions.
Ensure Unique test removed 13027 transitions
Reduce isomorphic transitions removed 13027 transitions.
Iterating post reduction 0 with 13027 rules applied. Total rules applied 13027 place count 626 transition count 18325
Applied a total of 13027 rules in 478 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:03:40] [INFO ] Computed 13 place invariants in 46 ms
[2023-03-16 21:03:40] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:03:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:03:58] [INFO ] After 18202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:03:59] [INFO ] After 19028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 617 ms.
[2023-03-16 21:03:59] [INFO ] After 19729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 337 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
[2023-03-16 21:04:00] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:04:00] [INFO ] Computed 13 place invariants in 49 ms
Could not prove EG (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 151 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:04:15] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:04:15] [INFO ] Invariant cache hit.
[2023-03-16 21:04:17] [INFO ] Implicit Places using invariants in 1866 ms returned []
Implicit Place search using SMT only with invariants took 1867 ms to find 0 implicit places.
[2023-03-16 21:04:17] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:04:17] [INFO ] Invariant cache hit.
[2023-03-16 21:04:25] [INFO ] Dead Transitions using invariants and state equation in 8200 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10220 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:04:26] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:04:26] [INFO ] Invariant cache hit.
[2023-03-16 21:04:26] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:04:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:04:47] [INFO ] After 20591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:04:47] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:04:51] [INFO ] After 4018ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 21:04:51] [INFO ] After 4270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-16 21:04:51] [INFO ] After 25033ms 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 152 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 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 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 26498 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 26498 steps, saw 23957 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:04:55] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:04:55] [INFO ] Invariant cache hit.
[2023-03-16 21:04:55] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:04:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:05:16] [INFO ] After 20944ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:05:16] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:05:20] [INFO ] After 3903ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-16 21:05:20] [INFO ] After 25023ms 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 151 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 147 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:05:20] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:05:20] [INFO ] Invariant cache hit.
[2023-03-16 21:05:22] [INFO ] Implicit Places using invariants in 1853 ms returned []
Implicit Place search using SMT only with invariants took 1854 ms to find 0 implicit places.
[2023-03-16 21:05:22] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:05:22] [INFO ] Invariant cache hit.
[2023-03-16 21:05:30] [INFO ] Dead Transitions using invariants and state equation in 8234 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10237 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 481 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:05:31] [INFO ] Computed 13 place invariants in 47 ms
[2023-03-16 21:05:31] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:05:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:05:49] [INFO ] After 18199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:05:50] [INFO ] After 19002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 596 ms.
[2023-03-16 21:05:51] [INFO ] After 19689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
[2023-03-16 21:05:51] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:05:51] [INFO ] Computed 13 place invariants in 45 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2894 ms.
Product exploration explored 100000 steps with 0 reset in 2997 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 152 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:06:13] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:06:13] [INFO ] Invariant cache hit.
[2023-03-16 21:06:14] [INFO ] Implicit Places using invariants in 1861 ms returned []
Implicit Place search using SMT only with invariants took 1861 ms to find 0 implicit places.
[2023-03-16 21:06:15] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:06:15] [INFO ] Invariant cache hit.
[2023-03-16 21:06:23] [INFO ] Dead Transitions using invariants and state equation in 8172 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10188 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-7-LTLCardinality-11 finished in 245212 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((!X(F(X(X(p1)))) U X(p2)))))'
Support contains 3 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:06:24] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:06:24] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 21:06:26] [INFO ] Implicit Places using invariants in 2021 ms returned []
Implicit Place search using SMT only with invariants took 2022 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:34] [INFO ] Dead Transitions using invariants and state equation in 8227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10319 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 367 ms :[(NOT p2), (NOT p2), (OR (NOT p2) p1), p1, true, (NOT p2), (NOT p2), (AND (NOT p2) p1), (AND p1 (NOT p2)), p1, (AND p1 (NOT p2))]
Running random walk in product with property : RERS17pb113-PT-7-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=1 dest: 6}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=6 dest: 6}, { cond=(NOT p0), acceptance={} source=6 dest: 7}, { cond=p0, acceptance={1} source=6 dest: 8}], [{ cond=p1, acceptance={} source=7 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 2}, { cond=(NOT p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 0}, { cond=(AND p0 p1), acceptance={1} source=8 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=8 dest: 10}], [{ cond=true, acceptance={} source=9 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=10 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=10 dest: 6}, { cond=(NOT p0), acceptance={} source=10 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 8}, { cond=(AND p0 p1), acceptance={1} source=10 dest: 8}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=10 dest: 10}]], initial=1, aps=[p2:(OR (LEQ 1 s31) (GT 1 s304)), p0:(LEQ 1 s219), p1:(LEQ 1 s31)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 337 steps with 0 reset in 9 ms.
FORMULA RERS17pb113-PT-7-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb113-PT-7-LTLCardinality-12 finished in 10780 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)||(F(G(p1)) U (p0&&F(p2)))))'
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 64 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:36] [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:36] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:06:36] [INFO ] Invariant cache hit.
[2023-03-16 21:06:45] [INFO ] Dead Transitions using invariants and state equation in 8373 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10310 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : RERS17pb113-PT-7-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT s499 s480), p2:(GT 2 s152), p1:(LEQ 3 s504)], 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 2850 ms.
Product exploration explored 100000 steps with 0 reset in 2978 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) p2 (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 270 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 5) seen :2
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 28 ms. (steps per millisecond=357 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 21:06:52] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:06:52] [INFO ] Invariant cache hit.
[2023-03-16 21:06:52] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:07:04] [INFO ] After 12469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 21:07:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:07:26] [INFO ] After 21635ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 21:07:26] [INFO ] State equation strengthened by 829 read => feed constraints.
[2023-03-16 21:07:29] [INFO ] After 3124ms SMT Verify possible using 829 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 21:07:29] [INFO ] After 3125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-16 21:07:29] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 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 316 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 317 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 3) seen :2
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
Running SMT prover for 1 properties.
[2023-03-16 21:07:30] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:07:30] [INFO ] Computed 13 place invariants in 47 ms
[2023-03-16 21:07:30] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:07:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:07:46] [INFO ] After 15910ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:07:46] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:07:53] [INFO ] After 6106ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 21:07:54] [INFO ] Deduced a trap composed of 40 places in 340 ms of which 1 ms to minimize.
[2023-03-16 21:07:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1127 ms
[2023-03-16 21:07:54] [INFO ] After 7884ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 798 ms.
[2023-03-16 21:07:55] [INFO ] After 24781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 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 150 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 150 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) 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 25722 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25722 steps, saw 23267 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 21:07:59] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:07:59] [INFO ] Invariant cache hit.
[2023-03-16 21:07:59] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:07:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:08:12] [INFO ] After 13492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:08:12] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:08:19] [INFO ] After 6451ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 21:08:20] [INFO ] Deduced a trap composed of 40 places in 327 ms of which 0 ms to minimize.
[2023-03-16 21:08:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1107 ms
[2023-03-16 21:08:20] [INFO ] After 7964ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 667 ms.
[2023-03-16 21:08:21] [INFO ] After 22303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 146 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 145 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:08:21] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:08:21] [INFO ] Invariant cache hit.
[2023-03-16 21:08:23] [INFO ] Implicit Places using invariants in 1856 ms returned []
Implicit Place search using SMT only with invariants took 1857 ms to find 0 implicit places.
[2023-03-16 21:08:23] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:08:23] [INFO ] Invariant cache hit.
[2023-03-16 21:08:31] [INFO ] Dead Transitions using invariants and state equation in 7829 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9835 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 466 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:08:32] [INFO ] Computed 13 place invariants in 46 ms
[2023-03-16 21:08:32] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 21:08:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:08:48] [INFO ] After 15854ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 21:08:49] [INFO ] After 17066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 600 ms.
[2023-03-16 21:08:49] [INFO ] After 17755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 392 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2)]
[2023-03-16 21:08:50] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:08:50] [INFO ] Computed 13 place invariants in 46 ms
Could not prove EG (NOT p1)
[2023-03-16 21:09:05] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:09:05] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 69 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:09:21] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:09:21] [INFO ] Invariant cache hit.
[2023-03-16 21:09:22] [INFO ] Implicit Places using invariants in 1743 ms returned []
Implicit Place search using SMT only with invariants took 1744 ms to find 0 implicit places.
[2023-03-16 21:09:22] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:09:22] [INFO ] Invariant cache hit.
[2023-03-16 21:09:30] [INFO ] Dead Transitions using invariants and state equation in 8235 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10053 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 p0) p2), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 436 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 24672 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{2=1}
Probabilistic random walk after 24672 steps, saw 22316 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :1
Running SMT prover for 4 properties.
[2023-03-16 21:09:35] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:09:35] [INFO ] Invariant cache hit.
[2023-03-16 21:09:35] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:09:48] [INFO ] After 13084ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 21:09:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:10:08] [INFO ] After 20406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 21:10:09] [INFO ] State equation strengthened by 829 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 21:10:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 21:10:13] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
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 283 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 22938 steps, run timeout after 3002 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22938 steps, saw 20781 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-16 21:10:17] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:10:17] [INFO ] Computed 13 place invariants in 49 ms
[2023-03-16 21:10:17] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:10:38] [INFO ] After 21526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 21:10:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:10:56] [INFO ] After 17716ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 21:10:56] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:11:03] [INFO ] After 7077ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 21:11:03] [INFO ] After 7078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-16 21:11:03] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 17 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 156 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:11:04] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:11:04] [INFO ] Invariant cache hit.
[2023-03-16 21:11:06] [INFO ] Implicit Places using invariants in 1858 ms returned []
Implicit Place search using SMT only with invariants took 1863 ms to find 0 implicit places.
[2023-03-16 21:11:06] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:11:06] [INFO ] Invariant cache hit.
[2023-03-16 21:11:14] [INFO ] Dead Transitions using invariants and state equation in 8254 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10277 ms. Remains : 626/626 places, 31352/31352 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 10 factoid took 473 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2)]
[2023-03-16 21:11:15] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:11:15] [INFO ] Computed 13 place invariants in 47 ms
Could not prove EG (NOT p1)
[2023-03-16 21:11:30] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:11:30] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 2770 ms.
Product exploration explored 100000 steps with 1 reset in 2868 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2)]
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 153 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:11:51] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:11:51] [INFO ] Invariant cache hit.
[2023-03-16 21:11:59] [INFO ] Dead Transitions using invariants and state equation in 7944 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8097 ms. Remains : 627/627 places, 31353/31353 transitions.
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 66 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:11:59] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:11:59] [INFO ] Invariant cache hit.
[2023-03-16 21:12:01] [INFO ] Implicit Places using invariants in 1784 ms returned []
Implicit Place search using SMT only with invariants took 1785 ms to find 0 implicit places.
[2023-03-16 21:12:01] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:12:01] [INFO ] Invariant cache hit.
[2023-03-16 21:12:09] [INFO ] Dead Transitions using invariants and state equation in 7891 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9742 ms. Remains : 627/627 places, 31353/31353 transitions.
Treatment of property RERS17pb113-PT-7-LTLCardinality-13 finished in 335337 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(!p0)||(!p0&&(p1 U (p2||G(p1)))))) U X(X(p3))))'
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 65 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 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 1785 ms returned []
Implicit Place search using SMT only with invariants took 1786 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:20] [INFO ] Dead Transitions using invariants and state equation in 8028 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9880 ms. Remains : 627/627 places, 31353/31353 transitions.
Stuttering acceptance computed with spot in 679 ms :[(NOT p3), (NOT p3), (AND p0 (NOT p3)), (NOT p3), (AND (NOT p3) p0 (NOT p2) (NOT p1)), (NOT p3), true, (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3)), (AND p0 (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) p0 (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p3)), p0, (AND p0 (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : RERS17pb113-PT-7-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 9}, { cond=(NOT p0), acceptance={} source=3 dest: 10}, { cond=p0, acceptance={} source=3 dest: 11}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 13}], [{ cond=(NOT p3), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=7 dest: 14}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=7 dest: 15}], [{ cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 14}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=8 dest: 15}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={} source=8 dest: 16}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=9 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=10 dest: 9}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=10 dest: 10}, { cond=(AND p0 (NOT p3)), acceptance={0} source=10 dest: 11}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={0} source=10 dest: 12}], [{ cond=(NOT p3), acceptance={} source=11 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=12 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={} source=12 dest: 13}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=13 dest: 16}], [{ cond=p0, acceptance={} source=14 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=14 dest: 14}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=14 dest: 15}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=15 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=15 dest: 14}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=15 dest: 15}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=15 dest: 16}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=16 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=16 dest: 16}]], initial=0, aps=[p0:(AND (LEQ 2 s357) (LEQ s336 s317)), p2:(AND (GT 1 s128) (GT s549 s238)), p1:(GT s549 s238), p3:(GT s336 s317)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23 reset in 2901 ms.
Product exploration explored 100000 steps with 22 reset in 2885 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 756 ms. Reduced automaton from 17 states, 48 edges and 4 AP (stutter sensitive) to 14 states, 35 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 570 ms :[(NOT p3), (NOT p3), (NOT p3), true, (AND p0 (NOT p3)), (AND (NOT p1) (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), p0, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-16 21:12:29] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:12:29] [INFO ] Invariant cache hit.
[2023-03-16 21:12:29] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:12:29] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-16 21:12:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:12:53] [INFO ] After 23579ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-16 21:12:53] [INFO ] State equation strengthened by 829 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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:12:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 21:12:54] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Parikh walk visited 0 properties in 61 ms.
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 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 553 ms. (steps per millisecond=18 ) properties (out of 12) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-16 21:12:56] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:12:56] [INFO ] Computed 13 place invariants in 40 ms
[2023-03-16 21:12:56] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-16 21:12:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:13:20] [INFO ] After 23302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-16 21:13:20] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:13:21] [INFO ] After 1427ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 21:13:21] [INFO ] After 1428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-16 21:13:21] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 34 ms.
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 144 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 22763 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22763 steps, saw 20628 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-16 21:13:25] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:13:25] [INFO ] Invariant cache hit.
[2023-03-16 21:13:25] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-16 21:13:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:13:47] [INFO ] After 20968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-16 21:13:47] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:13:50] [INFO ] After 3786ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 21:13:50] [INFO ] After 3787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 21:13:50] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 30 ms.
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 229 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 229 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:13:51] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:13:51] [INFO ] Invariant cache hit.
[2023-03-16 21:13:53] [INFO ] Implicit Places using invariants in 1759 ms returned []
Implicit Place search using SMT only with invariants took 1760 ms to find 0 implicit places.
[2023-03-16 21:13:53] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:13:53] [INFO ] Invariant cache hit.
[2023-03-16 21:14:01] [INFO ] Dead Transitions using invariants and state equation in 8055 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9968 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 464 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:14:01] [INFO ] Computed 13 place invariants in 49 ms
[2023-03-16 21:14:01] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-16 21:14:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:14:23] [INFO ] After 21709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-16 21:14:29] [INFO ] After 27820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 5038 ms.
[2023-03-16 21:14:34] [INFO ] After 33037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p0 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND (NOT p1) (NOT p2) p0)), (F p3), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (F (AND p0 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 15 factoid took 1092 ms. Reduced automaton from 14 states, 35 edges and 4 AP (stutter sensitive) to 14 states, 35 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 482 ms :[(NOT p3), (NOT p3), (NOT p3), true, (AND p0 (NOT p3)), (AND (NOT p1) (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), p0, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 483 ms :[(NOT p3), (NOT p3), (NOT p3), true, (AND p0 (NOT p3)), (AND (NOT p1) (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), p0, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-16 21:14:37] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:14:37] [INFO ] Computed 13 place invariants in 46 ms
Could not prove EG (NOT p3)
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 66 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:14:52] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:14:52] [INFO ] Invariant cache hit.
[2023-03-16 21:14:54] [INFO ] Implicit Places using invariants in 1857 ms returned []
Implicit Place search using SMT only with invariants took 1858 ms to find 0 implicit places.
[2023-03-16 21:14:54] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:14:54] [INFO ] Invariant cache hit.
[2023-03-16 21:15:02] [INFO ] Dead Transitions using invariants and state equation in 7898 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9823 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 (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 14 states, 35 edges and 4 AP (stutter sensitive) to 14 states, 35 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 472 ms :[(NOT p3), (NOT p3), (NOT p3), true, (AND p0 (NOT p3)), (AND (NOT p1) (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), p0, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-16 21:15:04] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:15:04] [INFO ] Invariant cache hit.
[2023-03-16 21:15:04] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:15:04] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-16 21:15:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:15:27] [INFO ] After 23354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-16 21:15:28] [INFO ] State equation strengthened by 829 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 21:15:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 21:15:29] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Parikh walk visited 0 properties in 37 ms.
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 31352
Applied a total of 1 rules in 273 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 274 ms. Remains : 626/627 places, 31352/31353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 12) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-16 21:15:30] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:15:30] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 21:15:30] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-16 21:15:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:15:53] [INFO ] After 22655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-16 21:15:53] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:15:55] [INFO ] After 2103ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 21:15:55] [INFO ] After 2105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 21:15:55] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 29 ms.
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 144 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 25322 steps, run timeout after 3002 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25322 steps, saw 22907 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-16 21:15:59] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:15:59] [INFO ] Invariant cache hit.
[2023-03-16 21:16:00] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-16 21:16:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:16:20] [INFO ] After 20770ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-16 21:16:21] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:16:25] [INFO ] After 3988ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-16 21:16:25] [INFO ] After 3989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-16 21:16:25] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 30 ms.
Support contains 6 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 141 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 140 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:16:25] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:16:25] [INFO ] Invariant cache hit.
[2023-03-16 21:16:27] [INFO ] Implicit Places using invariants in 1782 ms returned []
Implicit Place search using SMT only with invariants took 1792 ms to find 0 implicit places.
[2023-03-16 21:16:27] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:16:27] [INFO ] Invariant cache hit.
[2023-03-16 21:16:34] [INFO ] Dead Transitions using invariants and state equation in 7843 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9778 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 461 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:16:35] [INFO ] Computed 13 place invariants in 44 ms
[2023-03-16 21:16:35] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-16 21:16:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 21:16:57] [INFO ] After 21374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-16 21:17:03] [INFO ] After 27366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 4913 ms.
[2023-03-16 21:17:08] [INFO ] After 32459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p0 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND (NOT p1) (NOT p2) p0)), (F p3), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (F (AND p0 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 5 factoid took 493 ms. Reduced automaton from 14 states, 35 edges and 4 AP (stutter sensitive) to 14 states, 35 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 524 ms :[(NOT p3), (NOT p3), (NOT p3), true, (AND p0 (NOT p3)), (AND (NOT p1) (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), p0, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 469 ms :[(NOT p3), (NOT p3), (NOT p3), true, (AND p0 (NOT p3)), (AND (NOT p1) (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), p0, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-16 21:17:09] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2023-03-16 21:17:09] [INFO ] Computed 13 place invariants in 46 ms
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 590 ms :[(NOT p3), (NOT p3), (NOT p3), true, (AND p0 (NOT p3)), (AND (NOT p1) (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), p0, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 23 reset in 2798 ms.
Product exploration explored 100000 steps with 20 reset in 2891 ms.
Applying partial POR strategy [false, false, true, true, true, true, false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 530 ms :[(NOT p3), (NOT p3), (NOT p3), true, (AND p0 (NOT p3)), (AND (NOT p1) (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), p0, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 153 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:17:31] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:17:31] [INFO ] Invariant cache hit.
[2023-03-16 21:17:39] [INFO ] Dead Transitions using invariants and state equation in 7874 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8028 ms. Remains : 627/627 places, 31353/31353 transitions.
Support contains 6 out of 627 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 65 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2023-03-16 21:17:39] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:17:39] [INFO ] Invariant cache hit.
[2023-03-16 21:17:41] [INFO ] Implicit Places using invariants in 1723 ms returned []
Implicit Place search using SMT only with invariants took 1723 ms to find 0 implicit places.
[2023-03-16 21:17:41] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2023-03-16 21:17:41] [INFO ] Invariant cache hit.
[2023-03-16 21:17:49] [INFO ] Dead Transitions using invariants and state equation in 7805 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9594 ms. Remains : 627/627 places, 31353/31353 transitions.
Treatment of property RERS17pb113-PT-7-LTLCardinality-14 finished in 340206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(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(F(((X(p0)&&(p1||G(F(p2))))||G(p0)))))'
Found a Shortening insensitive property : RERS17pb113-PT-7-LTLCardinality-03
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 3 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 163 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 21:17:51] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:17:51] [INFO ] Computed 13 place invariants in 44 ms
[2023-03-16 21:17:53] [INFO ] Implicit Places using invariants in 1996 ms returned []
Implicit Place search using SMT only with invariants took 1997 ms to find 0 implicit places.
[2023-03-16 21:17:53] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:17:53] [INFO ] Invariant cache hit.
[2023-03-16 21:18:02] [INFO ] Dead Transitions using invariants and state equation in 8883 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11046 ms. Remains : 626/627 places, 31352/31353 transitions.
Running random walk in product with property : RERS17pb113-PT-7-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 0}]], initial=6, aps=[p1:(GT 1 s333), p2:(GT 2 s302), p0:(LEQ 2 s312)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2797 ms.
Product exploration explored 100000 steps with 0 reset in 2922 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 561 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-16 21:18:09] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:18:09] [INFO ] Invariant cache hit.
[2023-03-16 21:18:09] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:18:23] [INFO ] After 14405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 21:18:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:18:41] [INFO ] After 17399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 21:18:41] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:18:48] [INFO ] After 7406ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 21:18:48] [INFO ] After 7406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-16 21:18:48] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 164 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 24779 steps, run timeout after 3002 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24779 steps, saw 22429 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-16 21:18:52] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:18:52] [INFO ] Invariant cache hit.
[2023-03-16 21:18:52] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:19:06] [INFO ] After 13811ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 21:19:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:19:26] [INFO ] After 20059ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 21:19:26] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:19:31] [INFO ] After 4745ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-16 21:19:31] [INFO ] After 4745ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-16 21:19:31] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 146 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 145 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:19:31] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:19:31] [INFO ] Invariant cache hit.
[2023-03-16 21:19:33] [INFO ] Implicit Places using invariants in 1838 ms returned []
Implicit Place search using SMT only with invariants took 1839 ms to find 0 implicit places.
[2023-03-16 21:19:33] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:19:33] [INFO ] Invariant cache hit.
[2023-03-16 21:19:42] [INFO ] Dead Transitions using invariants and state equation in 8934 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10924 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 4 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:19:42] [INFO ] Computed 13 place invariants in 47 ms
[2023-03-16 21:19:43] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:19:56] [INFO ] After 13665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 21:19:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:20:16] [INFO ] After 19309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 21:20:19] [INFO ] After 22533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1828 ms.
[2023-03-16 21:20:21] [INFO ] After 24512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 553 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
[2023-03-16 21:20:22] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:20:22] [INFO ] Computed 13 place invariants in 47 ms
Could not prove EG (NOT p0)
Support contains 3 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:20:37] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:20:37] [INFO ] Invariant cache hit.
[2023-03-16 21:20:39] [INFO ] Implicit Places using invariants in 1870 ms returned []
Implicit Place search using SMT only with invariants took 1871 ms to find 0 implicit places.
[2023-03-16 21:20:39] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:20:39] [INFO ] Invariant cache hit.
[2023-03-16 21:20:48] [INFO ] Dead Transitions using invariants and state equation in 8819 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10765 ms. Remains : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[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:49] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:21:04] [INFO ] After 14843ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 21:21:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:21:22] [INFO ] After 17991ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 21:21:22] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:21:29] [INFO ] After 6807ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 21:21:29] [INFO ] After 6809ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-16 21:21:29] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 154 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 626/626 places, 31352/31352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 25030 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25030 steps, saw 22656 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-16 21:21:32] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:21:32] [INFO ] Invariant cache hit.
[2023-03-16 21:21:33] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 21:21:48] [INFO ] After 15014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 21:21:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:22:06] [INFO ] After 17992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 21:22:06] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-16 21:22:13] [INFO ] After 6819ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 21:22:13] [INFO ] After 6820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-16 21:22:13] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 18 ms.
Support contains 3 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 148 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:22:13] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:22:13] [INFO ] Invariant cache hit.
[2023-03-16 21:22:15] [INFO ] Implicit Places using invariants in 1853 ms returned []
Implicit Place search using SMT only with invariants took 1853 ms to find 0 implicit places.
[2023-03-16 21:22:15] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:22:15] [INFO ] Invariant cache hit.
[2023-03-16 21:22:23] [INFO ] Dead Transitions using invariants and state equation in 8278 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10282 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 481 ms. Remains 626 /626 variables (removed 0) and now considering 18325/31352 (removed 13027) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:22:24] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-16 21:22:24] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:22:38] [INFO ] After 14027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 21:22:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-16 21:22:55] [INFO ] After 16940ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 21:22:58] [INFO ] After 20037ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1820 ms.
[2023-03-16 21:23:00] [INFO ] After 21998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 324 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
[2023-03-16 21:23:01] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-16 21:23:01] [INFO ] Computed 13 place invariants in 46 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2897 ms.
Product exploration explored 100000 steps with 0 reset in 3055 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 66 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:23:22] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:23:22] [INFO ] Invariant cache hit.
[2023-03-16 21:23:24] [INFO ] Implicit Places using invariants in 1898 ms returned []
Implicit Place search using SMT only with invariants took 1899 ms to find 0 implicit places.
[2023-03-16 21:23:24] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:23:24] [INFO ] Invariant cache hit.
[2023-03-16 21:23:32] [INFO ] Dead Transitions using invariants and state equation in 8269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10236 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-7-LTLCardinality-03 finished in 343115 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(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(X((G(p0)||X(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(F(p0)))'
Found a Shortening insensitive property : RERS17pb113-PT-7-LTLCardinality-07
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 160 ms. Remains 626 /627 variables (removed 1) and now considering 31352/31353 (removed 1) transitions.
[2023-03-16 21:23:34] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:23:34] [INFO ] Invariant cache hit.
[2023-03-16 21:23:35] [INFO ] Implicit Places using invariants in 1815 ms returned []
Implicit Place search using SMT only with invariants took 1815 ms to find 0 implicit places.
[2023-03-16 21:23:35] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:23:35] [INFO ] Invariant cache hit.
[2023-03-16 21:23:44] [INFO ] Dead Transitions using invariants and state equation in 8158 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10136 ms. Remains : 626/627 places, 31352/31353 transitions.
Running random walk in product with property : RERS17pb113-PT-7-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s247 s273)], 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][false, false]]
Product exploration explored 100000 steps with 124 reset in 2773 ms.
Product exploration explored 100000 steps with 133 reset in 2673 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 122 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 1930 steps, including 0 resets, run visited all 1 properties in 45 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-16 21:23:50] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:23:50] [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 151 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:24:05] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:24:05] [INFO ] Invariant cache hit.
[2023-03-16 21:24:07] [INFO ] Implicit Places using invariants in 1810 ms returned []
Implicit Place search using SMT only with invariants took 1811 ms to find 0 implicit places.
[2023-03-16 21:24:07] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:24:07] [INFO ] Invariant cache hit.
[2023-03-16 21:24:15] [INFO ] Dead Transitions using invariants and state equation in 8445 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10409 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 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 650 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=43 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-16 21:24:16] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:24:16] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 128 reset in 2863 ms.
Product exploration explored 100000 steps with 119 reset in 2823 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 156 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-16 21:24:37] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:24:37] [INFO ] Invariant cache hit.
[2023-03-16 21:24:39] [INFO ] Implicit Places using invariants in 1821 ms returned []
Implicit Place search using SMT only with invariants took 1821 ms to find 0 implicit places.
[2023-03-16 21:24:39] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-16 21:24:39] [INFO ] Invariant cache hit.
[2023-03-16 21:24:47] [INFO ] Dead Transitions using invariants and state equation in 8614 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10591 ms. Remains : 626/626 places, 31352/31352 transitions.
Treatment of property RERS17pb113-PT-7-LTLCardinality-07 finished in 74976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G((p1&&X(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)||(F(G(p1)) U (p0&&F(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||(!p0&&(p1 U (p2||G(p1)))))) U X(X(p3))))'
[2023-03-16 21:24:49] [INFO ] Flatten gal took : 698 ms
[2023-03-16 21:24:49] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-16 21:24:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 627 places, 31353 transitions and 125406 arcs took 92 ms.
Total runtime 2582482 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4212/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4212/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4212/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4212/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4212/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4212/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4212/ltl_6_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4212/ltl_7_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4212/ltl_8_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : RERS17pb113-PT-7-LTLCardinality-02
Could not compute solution for formula : RERS17pb113-PT-7-LTLCardinality-03
Could not compute solution for formula : RERS17pb113-PT-7-LTLCardinality-04
Could not compute solution for formula : RERS17pb113-PT-7-LTLCardinality-05
Could not compute solution for formula : RERS17pb113-PT-7-LTLCardinality-07
Could not compute solution for formula : RERS17pb113-PT-7-LTLCardinality-10
Could not compute solution for formula : RERS17pb113-PT-7-LTLCardinality-11
Could not compute solution for formula : RERS17pb113-PT-7-LTLCardinality-13
Could not compute solution for formula : RERS17pb113-PT-7-LTLCardinality-14
BK_STOP 1679001938176
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name RERS17pb113-PT-7-LTLCardinality-02
ltl formula formula --ltl=/tmp/4212/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 2.990 real 1.050 user 0.930 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4212/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4212/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4212/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4212/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 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:
ltl formula name RERS17pb113-PT-7-LTLCardinality-03
ltl formula formula --ltl=/tmp/4212/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: =============================================================================
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.020 real 1.100 user 0.890 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4212/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4212/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4212/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4212/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
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:
ltl formula name RERS17pb113-PT-7-LTLCardinality-04
ltl formula formula --ltl=/tmp/4212/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: =============================================================================
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
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.060 real 1.010 user 0.950 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4212/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4212/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4212/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4212/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name RERS17pb113-PT-7-LTLCardinality-05
ltl formula formula --ltl=/tmp/4212/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( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.060 real 1.030 user 0.940 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4212/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4212/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4212/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4212/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 7 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:
0: pnml2lts-mc(+0xa23f4) [0x563b820703f4]
1: pnml2lts-mc(+0xa2496) [0x563b82070496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f2e5a7be140]
3: pnml2lts-mc(+0x405be5) [0x563b823d3be5]
4: pnml2lts-mc(+0x16b3f9) [0x563b821393f9]
5: pnml2lts-mc(+0x164ac4) [0x563b82132ac4]
6: pnml2lts-mc(+0x272e0a) [0x563b82240e0a]
7: pnml2lts-mc(+0xb61f0) [0x563b820841f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f2e5a6114d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f2e5a61167a]
10: pnml2lts-mc(+0xa1581) [0x563b8206f581]
11: pnml2lts-mc(+0xa1910) [0x563b8206f910]
12: pnml2lts-mc(+0xa32a2) [0x563b820712a2]
13: pnml2lts-mc(+0xa50f4) [0x563b820730f4]
14: pnml2lts-mc(+0xa516b) [0x563b8207316b]
15: pnml2lts-mc(+0x3f34b3) [0x563b823c14b3]
16: pnml2lts-mc(+0x7c63d) [0x563b8204a63d]
17: pnml2lts-mc(+0x67d86) [0x563b82035d86]
18: pnml2lts-mc(+0x60a8a) [0x563b8202ea8a]
19: pnml2lts-mc(+0x5eb15) [0x563b8202cb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f2e5a5f9d0a]
21: pnml2lts-mc(+0x6075e) [0x563b8202e75e]
ltl formula name RERS17pb113-PT-7-LTLCardinality-07
ltl formula formula --ltl=/tmp/4212/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.130 real 1.020 user 1.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4212/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4212/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4212/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4212/ltl_4_
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
double free or corruption (fasttop)
ltl formula name RERS17pb113-PT-7-LTLCardinality-10
ltl formula formula --ltl=/tmp/4212/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: =============================================================================
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.030 real 1.150 user 0.940 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4212/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4212/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4212/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4212/ltl_5_
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-LTLCardinality-11
ltl formula formula --ltl=/tmp/4212/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 3.020 real 1.050 user 0.930 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4212/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4212/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4212/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4212/ltl_6_
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-LTLCardinality-13
ltl formula formula --ltl=/tmp/4212/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 3.120 real 1.080 user 0.910 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4212/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4212/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4212/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4212/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 7 states
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:
ltl formula name RERS17pb113-PT-7-LTLCardinality-14
ltl formula formula --ltl=/tmp/4212/ltl_8_
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.060 real 1.000 user 0.980 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4212/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4212/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4212/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4212/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 21 states
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:
0: pnml2lts-mc(+0xa23f4) [0x556d97bb33f4]
1: pnml2lts-mc(+0xa2496) [0x556d97bb3496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f17bbb65140]
3: pnml2lts-mc(+0x405be5) [0x556d97f16be5]
4: pnml2lts-mc(+0x16b3f9) [0x556d97c7c3f9]
5: pnml2lts-mc(+0x164ac4) [0x556d97c75ac4]
6: pnml2lts-mc(+0x272e0a) [0x556d97d83e0a]
7: pnml2lts-mc(+0xb61f0) [0x556d97bc71f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f17bb9b84d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f17bb9b867a]
10: pnml2lts-mc(+0xa1581) [0x556d97bb2581]
11: pnml2lts-mc(+0xa1910) [0x556d97bb2910]
12: pnml2lts-mc(+0xa32a2) [0x556d97bb42a2]
13: pnml2lts-mc(+0xa50f4) [0x556d97bb60f4]
14: pnml2lts-mc(+0xa516b) [0x556d97bb616b]
15: pnml2lts-mc(+0x3f34b3) [0x556d97f044b3]
16: pnml2lts-mc(+0x7c63d) [0x556d97b8d63d]
17: pnml2lts-mc(+0x67d86) [0x556d97b78d86]
18: pnml2lts-mc(+0x60a8a) [0x556d97b71a8a]
19: pnml2lts-mc(+0x5eb15) [0x556d97b6fb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f17bb9a0d0a]
21: pnml2lts-mc(+0x6075e) [0x556d97b7175e]
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="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is RERS17pb113-PT-7, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889201500051"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;