About the Execution of ITS-Tools for DNAwalker-PT-17redondantChoiceL
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2313.195 | 3600000.00 | 3965316.00 | 11694.50 | F?FFF?F?FF??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/mcc2024-input.r114-smll-171624276100500.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DNAwalker-PT-17redondantChoiceL, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-171624276100500
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 13:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 13 13:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 13:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 13 13:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 19 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 211K May 18 16:42 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 DNAwalker-PT-17redondantChoiceL-LTLFireability-00
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-01
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-02
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-03
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-04
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-05
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-06
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-07
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-08
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-09
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-10
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-11
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-12
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-13
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-14
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716529609524
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-17redondantChoiceL
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 05:46:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 05:46:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 05:46:51] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2024-05-24 05:46:51] [INFO ] Transformed 43 places.
[2024-05-24 05:46:51] [INFO ] Transformed 490 transitions.
[2024-05-24 05:46:51] [INFO ] Parsed PT model containing 43 places and 490 transitions and 1438 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 22 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 05:46:52] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2024-05-24 05:46:52] [INFO ] Computed 0 invariants in 25 ms
[2024-05-24 05:46:52] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20093 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 41243ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 41290ms
[2024-05-24 05:47:33] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:47:33] [INFO ] Invariant cache hit.
[2024-05-24 05:47:33] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-24 05:47:33] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:47:33] [INFO ] Invariant cache hit.
[2024-05-24 05:47:33] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 05:47:34] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-05-24 05:47:34] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:47:34] [INFO ] Invariant cache hit.
[2024-05-24 05:47:34] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30021 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 669 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30023 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
After SMT, in 60832ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60849ms
Finished structural reductions in LTL mode , in 1 iterations and 103043 ms. Remains : 43/43 places, 490/490 transitions.
Support contains 29 out of 43 places after structural reductions.
[2024-05-24 05:48:35] [INFO ] Flatten gal took : 126 ms
[2024-05-24 05:48:35] [INFO ] Flatten gal took : 68 ms
[2024-05-24 05:48:35] [INFO ] Input system was already deterministic with 490 transitions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 2589 steps (94 resets) in 364 ms. (7 steps per ms) remains 0/26 properties
Computed a total of 43 stabilizing places and 488 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&G(p1)))&&F(!p1)))'
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 9 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 05:48:36] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:48:36] [INFO ] Invariant cache hit.
[2024-05-24 05:48:36] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20027 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40811ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40822ms
[2024-05-24 05:49:17] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:49:17] [INFO ] Invariant cache hit.
[2024-05-24 05:49:17] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-24 05:49:17] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:49:17] [INFO ] Invariant cache hit.
[2024-05-24 05:49:17] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 05:49:18] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 1585 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-05-24 05:49:18] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:49:18] [INFO ] Invariant cache hit.
[2024-05-24 05:49:18] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 30798ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 30807ms
Finished structural reductions in LTL mode , in 1 iterations and 73227 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 359 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : DNAwalker-PT-17redondantChoiceL-LTLFireability-00
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 2 ms.
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-17redondantChoiceL-LTLFireability-00 finished in 73669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((G(!p0)||((!p1||G(!p0))&&G(F(!p2)))||G(!p1))))))))'
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 7 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 05:49:50] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:49:50] [INFO ] Invariant cache hit.
[2024-05-24 05:49:50] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20020 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40585ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40593ms
[2024-05-24 05:50:30] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:50:30] [INFO ] Invariant cache hit.
[2024-05-24 05:50:30] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-24 05:50:30] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:50:30] [INFO ] Invariant cache hit.
[2024-05-24 05:50:30] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 05:50:31] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-05-24 05:50:31] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:50:31] [INFO ] Invariant cache hit.
[2024-05-24 05:50:31] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30019 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 669 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30021 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
After SMT, in 60760ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60769ms
Finished structural reductions in LTL mode , in 1 iterations and 102477 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 369 ms :[(AND p0 p1), (AND p2 p1 p0), (AND p2 p1 p0), (AND p1 p0), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : DNAwalker-PT-17redondantChoiceL-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 411 ms.
Product exploration explored 100000 steps with 0 reset in 278 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 264 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 475 ms :[(AND p0 p1), (AND p2 p1 p0), (AND p2 p1 p0), (AND p1 p0), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (1537 resets) in 1990 ms. (20 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (110 resets) in 348 ms. (114 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (110 resets) in 589 ms. (67 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (111 resets) in 292 ms. (136 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (111 resets) in 260 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (107 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
[2024-05-24 05:51:35] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:51:35] [INFO ] Invariant cache hit.
[2024-05-24 05:51:35] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 142/147 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 356/503 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 133/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 28/531 variables, 14/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 5 unsolved in 619 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 142/147 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 356/503 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 133/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 208 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5006 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 5665ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Graph (complete) has 478 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 42 transition count 472
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 34 transition count 464
Applied a total of 26 rules in 55 ms. Remains 34 /43 variables (removed 9) and now considering 464/490 (removed 26) transitions.
Running 457 sub problems to find dead transitions.
// Phase 1: matrix 464 rows 34 cols
[2024-05-24 05:51:41] [INFO ] Computed 0 invariants in 6 ms
[2024-05-24 05:51:41] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 464/496 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 27/59 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (OVERLAPS) 2/498 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/498 variables, and 61 constraints, problems are : Problem set: 0 solved, 457 unsolved in 20019 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 464/496 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/498 variables, and 59 constraints, problems are : Problem set: 0 solved, 457 unsolved in 20015 ms.
Refiners :[State Equation: 32/34 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 0/457 constraints, Known Traps: 0/0 constraints]
After SMT, in 40843ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 40848ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40906 ms. Remains : 34/43 places, 464/490 transitions.
RANDOM walk for 40000 steps (1619 resets) in 953 ms. (41 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (164 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (163 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (170 resets) in 224 ms. (177 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (179 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (168 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 276566 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 5
Probabilistic random walk after 276566 steps, saw 69352 distinct states, run finished after 3007 ms. (steps per millisecond=91 ) properties seen :0
[2024-05-24 05:52:25] [INFO ] Invariant cache hit.
[2024-05-24 05:52:25] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 142/147 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 342/489 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 9/498 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/498 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 61 constraints, problems are : Problem set: 0 solved, 5 unsolved in 378 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 142/147 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 342/489 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 66 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45007 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 45406ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 464/464 transitions.
Applied a total of 0 rules in 10 ms. Remains 34 /34 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 34/34 places, 464/464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 464/464 transitions.
Applied a total of 0 rules in 9 ms. Remains 34 /34 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-24 05:53:11] [INFO ] Invariant cache hit.
[2024-05-24 05:53:11] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-24 05:53:11] [INFO ] Invariant cache hit.
[2024-05-24 05:53:11] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 05:53:12] [INFO ] Implicit Places using invariants and state equation in 796 ms returned [33]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 905 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 33/34 places, 460/464 transitions.
Applied a total of 0 rules in 11 ms. Remains 33 /33 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 926 ms. Remains : 33/34 places, 460/464 transitions.
RANDOM walk for 40000 steps (1430 resets) in 1497 ms. (26 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (151 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (150 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (158 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (159 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (158 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 260451 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 5
Probabilistic random walk after 260451 steps, saw 66879 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
// Phase 1: matrix 460 rows 33 cols
[2024-05-24 05:53:15] [INFO ] Computed 0 invariants in 6 ms
[2024-05-24 05:53:15] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 142/147 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 337/484 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 9/493 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/493 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 60 constraints, problems are : Problem set: 0 solved, 5 unsolved in 477 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 142/147 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 337/484 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/493 variables, and 65 constraints, problems are : Problem set: 0 solved, 5 unsolved in 75004 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 75524ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 460/460 transitions.
Applied a total of 0 rules in 12 ms. Remains 33 /33 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 33/33 places, 460/460 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 460/460 transitions.
Applied a total of 0 rules in 8 ms. Remains 33 /33 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2024-05-24 05:54:31] [INFO ] Invariant cache hit.
[2024-05-24 05:54:31] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-24 05:54:31] [INFO ] Invariant cache hit.
[2024-05-24 05:54:31] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 05:54:32] [INFO ] Implicit Places using invariants and state equation in 1231 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2024-05-24 05:54:32] [INFO ] Redundant transitions in 36 ms returned []
Running 453 sub problems to find dead transitions.
[2024-05-24 05:54:32] [INFO ] Invariant cache hit.
[2024-05-24 05:54:32] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 460/491 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 27/58 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (OVERLAPS) 2/493 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 6 (OVERLAPS) 0/493 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 453 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 60 constraints, problems are : Problem set: 0 solved, 453 unsolved in 23884 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 460/491 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 27/58 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 453/511 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/493 variables, and 513 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30013 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
After SMT, in 54348ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 54353ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55733 ms. Remains : 33/33 places, 460/460 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) p0))), (F p2), (F p1), (F (NOT (OR (NOT p2) p1 p0)))]
Knowledge based reduction with 4 factoid took 684 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 410 ms :[(AND p0 p1), (AND p2 p1 p0), (AND p2 p1 p0), (AND p1 p0), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 508 ms :[(AND p0 p1), (AND p2 p1 p0), (AND p2 p1 p0), (AND p1 p0), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 05:55:28] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2024-05-24 05:55:28] [INFO ] Computed 0 invariants in 4 ms
[2024-05-24 05:55:28] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20018 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40756ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40765ms
[2024-05-24 05:56:09] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:56:09] [INFO ] Invariant cache hit.
[2024-05-24 05:56:09] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-24 05:56:09] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:56:09] [INFO ] Invariant cache hit.
[2024-05-24 05:56:09] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 05:56:10] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1417 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-05-24 05:56:10] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:56:10] [INFO ] Invariant cache hit.
[2024-05-24 05:56:10] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 30459ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 30464ms
Finished structural reductions in LTL mode , in 1 iterations and 72653 ms. Remains : 43/43 places, 490/490 transitions.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[(AND p0 p1), (AND p2 p1 p0), (AND p2 p1 p0), (AND p1 p0), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (1520 resets) in 411 ms. (97 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (111 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (110 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (106 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (114 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (109 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
[2024-05-24 05:56:42] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 05:56:42] [INFO ] Invariant cache hit.
[2024-05-24 05:56:42] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 142/147 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 356/503 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 133/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 28/531 variables, 14/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 5 unsolved in 871 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 142/147 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 356/503 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 133/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 208 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5007 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 5912ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Graph (complete) has 478 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 42 transition count 472
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 34 transition count 464
Applied a total of 26 rules in 19 ms. Remains 34 /43 variables (removed 9) and now considering 464/490 (removed 26) transitions.
Running 457 sub problems to find dead transitions.
// Phase 1: matrix 464 rows 34 cols
[2024-05-24 05:56:48] [INFO ] Computed 0 invariants in 3 ms
[2024-05-24 05:56:48] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 464/496 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 27/59 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (OVERLAPS) 2/498 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (OVERLAPS) 0/498 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 457 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 61 constraints, problems are : Problem set: 0 solved, 457 unsolved in 20014 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 464/496 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/498 variables, and 59 constraints, problems are : Problem set: 0 solved, 457 unsolved in 20024 ms.
Refiners :[State Equation: 32/34 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 0/457 constraints, Known Traps: 0/0 constraints]
After SMT, in 40490ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 40495ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40515 ms. Remains : 34/43 places, 464/490 transitions.
RANDOM walk for 40000 steps (1636 resets) in 1000 ms. (39 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (163 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (159 resets) in 219 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (171 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (185 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (168 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 326281 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 5
Probabilistic random walk after 326281 steps, saw 80242 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2024-05-24 05:57:32] [INFO ] Invariant cache hit.
[2024-05-24 05:57:32] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 142/147 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 342/489 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 9/498 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/498 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 61 constraints, problems are : Problem set: 0 solved, 5 unsolved in 286 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 142/147 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 342/489 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 66 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45005 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 45311ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 464/464 transitions.
Applied a total of 0 rules in 9 ms. Remains 34 /34 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 34/34 places, 464/464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 464/464 transitions.
Applied a total of 0 rules in 6 ms. Remains 34 /34 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-24 05:58:17] [INFO ] Invariant cache hit.
[2024-05-24 05:58:17] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-24 05:58:17] [INFO ] Invariant cache hit.
[2024-05-24 05:58:18] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 05:58:18] [INFO ] Implicit Places using invariants and state equation in 999 ms returned [33]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 1094 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 33/34 places, 460/464 transitions.
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1105 ms. Remains : 33/34 places, 460/464 transitions.
RANDOM walk for 40000 steps (1426 resets) in 843 ms. (47 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (151 resets) in 156 ms. (254 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (147 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (154 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (162 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (152 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 299692 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 5
Probabilistic random walk after 299692 steps, saw 75600 distinct states, run finished after 3003 ms. (steps per millisecond=99 ) properties seen :0
// Phase 1: matrix 460 rows 33 cols
[2024-05-24 05:58:22] [INFO ] Computed 0 invariants in 3 ms
[2024-05-24 05:58:22] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 142/147 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 337/484 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 9/493 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/493 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 60 constraints, problems are : Problem set: 0 solved, 5 unsolved in 496 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 142/147 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 337/484 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/493 variables, and 65 constraints, problems are : Problem set: 0 solved, 5 unsolved in 75006 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 75526ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 460/460 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 33/33 places, 460/460 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 460/460 transitions.
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2024-05-24 05:59:38] [INFO ] Invariant cache hit.
[2024-05-24 05:59:38] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-24 05:59:38] [INFO ] Invariant cache hit.
[2024-05-24 05:59:38] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 05:59:39] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
[2024-05-24 05:59:39] [INFO ] Redundant transitions in 20 ms returned []
Running 453 sub problems to find dead transitions.
[2024-05-24 05:59:39] [INFO ] Invariant cache hit.
[2024-05-24 05:59:39] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 460/491 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 27/58 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (OVERLAPS) 2/493 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 6 (OVERLAPS) 0/493 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 453 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 60 constraints, problems are : Problem set: 0 solved, 453 unsolved in 24016 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 460/491 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 27/58 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 453/511 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/493 variables, and 513 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30019 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
After SMT, in 54789ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 54797ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55921 ms. Remains : 33/33 places, 460/460 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) p0))), (F p2), (F p1), (F (NOT (OR (NOT p2) p1 p0)))]
Knowledge based reduction with 4 factoid took 624 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[(AND p0 p1), (AND p2 p1 p0), (AND p2 p1 p0), (AND p1 p0), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 426 ms :[(AND p0 p1), (AND p2 p1 p0), (AND p2 p1 p0), (AND p1 p0), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 455 ms :[(AND p0 p1), (AND p2 p1 p0), (AND p2 p1 p0), (AND p1 p0), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 0 reset in 414 ms.
Product exploration explored 100000 steps with 0 reset in 123 ms.
Applying partial POR strategy [true, true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 453 ms :[(AND p0 p1), (AND p2 p1 p0), (AND p2 p1 p0), (AND p1 p0), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 17 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:00:37] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2024-05-24 06:00:37] [INFO ] Computed 0 invariants in 5 ms
[2024-05-24 06:00:37] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20039 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40764ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40773ms
[2024-05-24 06:01:18] [INFO ] Redundant transitions in 8 ms returned []
Running 466 sub problems to find dead transitions.
[2024-05-24 06:01:18] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:01:18] [INFO ] Invariant cache hit.
[2024-05-24 06:01:18] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30027 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 669 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30019 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
After SMT, in 60512ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60517ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 101325 ms. Remains : 43/43 places, 490/490 transitions.
Built C files in :
/tmp/ltsmin551309502056101592
[2024-05-24 06:02:18] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin551309502056101592
Running compilation step : cd /tmp/ltsmin551309502056101592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1524 ms.
Running link step : cd /tmp/ltsmin551309502056101592;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin551309502056101592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8699536260505845084.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 13 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:02:33] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:02:33] [INFO ] Invariant cache hit.
[2024-05-24 06:02:33] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20019 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40585ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40591ms
[2024-05-24 06:03:14] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:03:14] [INFO ] Invariant cache hit.
[2024-05-24 06:03:14] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-24 06:03:14] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:03:14] [INFO ] Invariant cache hit.
[2024-05-24 06:03:14] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 06:03:15] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:03:15] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:03:15] [INFO ] Invariant cache hit.
[2024-05-24 06:03:15] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30016 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 669 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30022 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
After SMT, in 60622ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60627ms
Finished structural reductions in LTL mode , in 1 iterations and 102355 ms. Remains : 43/43 places, 490/490 transitions.
Built C files in :
/tmp/ltsmin10872681637706804553
[2024-05-24 06:04:16] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10872681637706804553
Running compilation step : cd /tmp/ltsmin10872681637706804553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1431 ms.
Running link step : cd /tmp/ltsmin10872681637706804553;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10872681637706804553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1667041512212060698.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 06:04:31] [INFO ] Flatten gal took : 33 ms
[2024-05-24 06:04:31] [INFO ] Flatten gal took : 31 ms
[2024-05-24 06:04:31] [INFO ] Time to serialize gal into /tmp/LTL14484795155103931436.gal : 11 ms
[2024-05-24 06:04:31] [INFO ] Time to serialize properties into /tmp/LTL7748615532044253335.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14484795155103931436.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5634442309210133664.hoa' '-atoms' '/tmp/LTL7748615532044253335.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7748615532044253335.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5634442309210133664.hoa
Detected timeout of ITS tools.
[2024-05-24 06:04:46] [INFO ] Flatten gal took : 28 ms
[2024-05-24 06:04:46] [INFO ] Flatten gal took : 27 ms
[2024-05-24 06:04:46] [INFO ] Time to serialize gal into /tmp/LTL6427122836547545771.gal : 5 ms
[2024-05-24 06:04:46] [INFO ] Time to serialize properties into /tmp/LTL1735352743795272203.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6427122836547545771.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1735352743795272203.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F(((G("((A11<1)||(A12<2))"))||(G("((A20<2)||(A29<1))")))||((G(F("((A11<2)||(A27<1))")))&&(("((A20<2)||(A29<1))")||(G("((A11...180
Formula 0 simplified : XXXXG(F!"((A11<1)||(A12<2))" & F!"((A20<2)||(A29<1))" & (FG!"((A11<2)||(A27<1))" | (!"((A20<2)||(A29<1))" & F!"((A11<1)||(A12<2))"))...156
Detected timeout of ITS tools.
[2024-05-24 06:05:01] [INFO ] Flatten gal took : 26 ms
[2024-05-24 06:05:01] [INFO ] Applying decomposition
[2024-05-24 06:05:01] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13968736808381557168.txt' '-o' '/tmp/graph13968736808381557168.bin' '-w' '/tmp/graph13968736808381557168.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13968736808381557168.bin' '-l' '-1' '-v' '-w' '/tmp/graph13968736808381557168.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:05:01] [INFO ] Decomposing Gal with order
[2024-05-24 06:05:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:05:01] [INFO ] Removed a total of 872 redundant transitions.
[2024-05-24 06:05:01] [INFO ] Flatten gal took : 96 ms
[2024-05-24 06:05:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-24 06:05:01] [INFO ] Time to serialize gal into /tmp/LTL4726614000618705900.gal : 7 ms
[2024-05-24 06:05:01] [INFO ] Time to serialize properties into /tmp/LTL6846569558907037058.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4726614000618705900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6846569558907037058.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F(((G("((u10.A11<1)||(u11.A12<2))"))||(G("((u19.A20<2)||(u28.A29<1))")))||((G(F("((u10.A11<2)||(u26.A27<1))")))&&(("((u19.A...220
Formula 0 simplified : XXXXG(F!"((u10.A11<1)||(u11.A12<2))" & F!"((u19.A20<2)||(u28.A29<1))" & (FG!"((u10.A11<2)||(u26.A27<1))" | (!"((u19.A20<2)||(u28.A29...196
Detected timeout of ITS tools.
Treatment of property DNAwalker-PT-17redondantChoiceL-LTLFireability-01 finished in 926982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 10 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:05:17] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:05:17] [INFO ] Invariant cache hit.
[2024-05-24 06:05:17] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20014 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40588ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40593ms
[2024-05-24 06:05:57] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:05:57] [INFO ] Invariant cache hit.
[2024-05-24 06:05:57] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-24 06:05:57] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:05:57] [INFO ] Invariant cache hit.
[2024-05-24 06:05:57] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 06:05:58] [INFO ] Implicit Places using invariants and state equation in 973 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
[2024-05-24 06:05:58] [INFO ] Redundant transitions in 4 ms returned []
Running 466 sub problems to find dead transitions.
[2024-05-24 06:05:58] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:05:58] [INFO ] Invariant cache hit.
[2024-05-24 06:05:58] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30016 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 669 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30019 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
After SMT, in 60536ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60540ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 102218 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DNAwalker-PT-17redondantChoiceL-LTLFireability-02
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-17redondantChoiceL-LTLFireability-02 finished in 102277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 20 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:06:59] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:06:59] [INFO ] Invariant cache hit.
[2024-05-24 06:06:59] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20018 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40513ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40518ms
[2024-05-24 06:07:39] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:07:39] [INFO ] Invariant cache hit.
[2024-05-24 06:07:39] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-24 06:07:39] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:07:39] [INFO ] Invariant cache hit.
[2024-05-24 06:07:40] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 06:07:41] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
[2024-05-24 06:07:41] [INFO ] Redundant transitions in 4 ms returned []
Running 466 sub problems to find dead transitions.
[2024-05-24 06:07:41] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:07:41] [INFO ] Invariant cache hit.
[2024-05-24 06:07:41] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30017 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 669 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30027 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
After SMT, in 60506ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60511ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 102304 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : DNAwalker-PT-17redondantChoiceL-LTLFireability-03
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-17redondantChoiceL-LTLFireability-03 finished in 102382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(!p0)&&F(!p1))||G(!p0)))))'
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 8 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:08:41] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:08:41] [INFO ] Invariant cache hit.
[2024-05-24 06:08:41] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20016 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40486ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40491ms
[2024-05-24 06:09:22] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:09:22] [INFO ] Invariant cache hit.
[2024-05-24 06:09:22] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-24 06:09:22] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:09:22] [INFO ] Invariant cache hit.
[2024-05-24 06:09:22] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 06:09:23] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2024-05-24 06:09:23] [INFO ] Redundant transitions in 3 ms returned []
Running 466 sub problems to find dead transitions.
[2024-05-24 06:09:23] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:09:23] [INFO ] Invariant cache hit.
[2024-05-24 06:09:23] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30015 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 669 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30017 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
After SMT, in 60486ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60491ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 102127 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 128 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : DNAwalker-PT-17redondantChoiceL-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 261 ms.
Product exploration explored 100000 steps with 0 reset in 81 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 448 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p0, (AND p0 p1), p0]
RANDOM walk for 40000 steps (1526 resets) in 221 ms. (180 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (102 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
[2024-05-24 06:10:24] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:10:24] [INFO ] Invariant cache hit.
[2024-05-24 06:10:24] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 302/513 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 121/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 302/513 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 121/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1250 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1540ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Graph (complete) has 478 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 42 transition count 472
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 34 transition count 464
Applied a total of 26 rules in 13 ms. Remains 34 /43 variables (removed 9) and now considering 464/490 (removed 26) transitions.
Running 457 sub problems to find dead transitions.
// Phase 1: matrix 464 rows 34 cols
[2024-05-24 06:10:26] [INFO ] Computed 0 invariants in 5 ms
[2024-05-24 06:10:26] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 464/496 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 39/71 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (OVERLAPS) 2/498 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (OVERLAPS) 0/498 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 457 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 73 constraints, problems are : Problem set: 0 solved, 457 unsolved in 20023 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 464/496 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 39/71 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 457/528 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/498 variables, and 528 constraints, problems are : Problem set: 0 solved, 457 unsolved in 20016 ms.
Refiners :[State Equation: 32/34 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 0/0 constraints]
After SMT, in 40486ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 40491ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40506 ms. Remains : 34/43 places, 464/490 transitions.
RANDOM walk for 40000 steps (1651 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (169 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 805961 steps, run timeout after 3001 ms. (steps per millisecond=268 ) properties seen :0 out of 1
Probabilistic random walk after 805961 steps, saw 188294 distinct states, run finished after 3001 ms. (steps per millisecond=268 ) properties seen :0
[2024-05-24 06:11:10] [INFO ] Invariant cache hit.
[2024-05-24 06:11:10] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 286/497 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/498 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/498 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 215 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 286/497 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 74 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9187 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 9420ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 464/464 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 34/34 places, 464/464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 464/464 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-24 06:11:19] [INFO ] Invariant cache hit.
[2024-05-24 06:11:19] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-24 06:11:19] [INFO ] Invariant cache hit.
[2024-05-24 06:11:19] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-24 06:11:20] [INFO ] Implicit Places using invariants and state equation in 855 ms returned [33]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT with State Equation took 941 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 33/34 places, 459/464 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 459/459 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 949 ms. Remains : 33/34 places, 459/464 transitions.
RANDOM walk for 40000 steps (1385 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (151 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 828728 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :0 out of 1
Probabilistic random walk after 828728 steps, saw 193650 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
// Phase 1: matrix 459 rows 33 cols
[2024-05-24 06:11:23] [INFO ] Computed 0 invariants in 2 ms
[2024-05-24 06:11:23] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 280/491 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/492 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/492 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 280/491 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15184 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 15368ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 459/459 transitions.
Applied a total of 0 rules in 6 ms. Remains 33 /33 variables (removed 0) and now considering 459/459 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 33/33 places, 459/459 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 459/459 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 459/459 (removed 0) transitions.
[2024-05-24 06:11:38] [INFO ] Invariant cache hit.
[2024-05-24 06:11:39] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-24 06:11:39] [INFO ] Invariant cache hit.
[2024-05-24 06:11:39] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-24 06:11:39] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
[2024-05-24 06:11:39] [INFO ] Redundant transitions in 3 ms returned []
Running 452 sub problems to find dead transitions.
[2024-05-24 06:11:39] [INFO ] Invariant cache hit.
[2024-05-24 06:11:39] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 459/490 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 39/70 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 2/492 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (OVERLAPS) 0/492 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 452 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 72 constraints, problems are : Problem set: 0 solved, 452 unsolved in 19840 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 459/490 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 39/70 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 452/522 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 452 unsolved
SMT process timed out in 50307ms, After SMT, problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 50313ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51340 ms. Remains : 33/33 places, 459/459 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0)]
Knowledge based reduction with 9 factoid took 637 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[p0, (AND p0 p1), p0]
Stuttering acceptance computed with spot in 106 ms :[p0, (AND p0 p1), p0]
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 7 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:12:31] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2024-05-24 06:12:31] [INFO ] Computed 0 invariants in 2 ms
[2024-05-24 06:12:31] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20014 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40489ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40494ms
[2024-05-24 06:13:11] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:13:11] [INFO ] Invariant cache hit.
[2024-05-24 06:13:11] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-24 06:13:11] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:13:11] [INFO ] Invariant cache hit.
[2024-05-24 06:13:11] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 06:13:12] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
[2024-05-24 06:13:12] [INFO ] Redundant transitions in 4 ms returned []
Running 466 sub problems to find dead transitions.
[2024-05-24 06:13:12] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:13:12] [INFO ] Invariant cache hit.
[2024-05-24 06:13:12] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30014 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 669 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30014 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
After SMT, in 60487ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60492ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 102127 ms. Remains : 43/43 places, 490/490 transitions.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 456 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[p0, (AND p0 p1), p0]
RANDOM walk for 40000 steps (1516 resets) in 213 ms. (186 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (98 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
[2024-05-24 06:14:13] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:14:13] [INFO ] Invariant cache hit.
[2024-05-24 06:14:13] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 302/513 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 121/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 302/513 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 121/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1246 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1513ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Graph (complete) has 478 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 42 transition count 472
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 34 transition count 464
Applied a total of 26 rules in 15 ms. Remains 34 /43 variables (removed 9) and now considering 464/490 (removed 26) transitions.
Running 457 sub problems to find dead transitions.
// Phase 1: matrix 464 rows 34 cols
[2024-05-24 06:14:15] [INFO ] Computed 0 invariants in 3 ms
[2024-05-24 06:14:15] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 464/496 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 39/71 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (OVERLAPS) 2/498 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (OVERLAPS) 0/498 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 457 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 73 constraints, problems are : Problem set: 0 solved, 457 unsolved in 20009 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 464/496 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 39/71 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 457/528 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/496 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 457 unsolved
SMT process timed out in 40494ms, After SMT, problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 40499ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40515 ms. Remains : 34/43 places, 464/490 transitions.
RANDOM walk for 40000 steps (1627 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (172 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 808311 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :0 out of 1
Probabilistic random walk after 808311 steps, saw 188867 distinct states, run finished after 3001 ms. (steps per millisecond=269 ) properties seen :0
[2024-05-24 06:14:59] [INFO ] Invariant cache hit.
[2024-05-24 06:14:59] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 286/497 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/498 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/498 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 286/497 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 74 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9193 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 9417ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 464/464 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 34/34 places, 464/464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 464/464 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-24 06:15:08] [INFO ] Invariant cache hit.
[2024-05-24 06:15:08] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-24 06:15:08] [INFO ] Invariant cache hit.
[2024-05-24 06:15:08] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-24 06:15:09] [INFO ] Implicit Places using invariants and state equation in 862 ms returned [33]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT with State Equation took 952 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 33/34 places, 459/464 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 459/459 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 960 ms. Remains : 33/34 places, 459/464 transitions.
RANDOM walk for 40000 steps (1386 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (150 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 827968 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :0 out of 1
Probabilistic random walk after 827968 steps, saw 193472 distinct states, run finished after 3001 ms. (steps per millisecond=275 ) properties seen :0
// Phase 1: matrix 459 rows 33 cols
[2024-05-24 06:15:12] [INFO ] Computed 0 invariants in 2 ms
[2024-05-24 06:15:12] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 280/491 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/492 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/492 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 280/491 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15183 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 15364ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 459/459 transitions.
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 459/459 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 33/33 places, 459/459 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 459/459 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 459/459 (removed 0) transitions.
[2024-05-24 06:15:27] [INFO ] Invariant cache hit.
[2024-05-24 06:15:27] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-24 06:15:27] [INFO ] Invariant cache hit.
[2024-05-24 06:15:28] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-24 06:15:28] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
[2024-05-24 06:15:28] [INFO ] Redundant transitions in 4 ms returned []
Running 452 sub problems to find dead transitions.
[2024-05-24 06:15:28] [INFO ] Invariant cache hit.
[2024-05-24 06:15:28] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 459/490 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 39/70 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 2/492 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (OVERLAPS) 0/492 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 452 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 72 constraints, problems are : Problem set: 0 solved, 452 unsolved in 20128 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 459/490 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 39/70 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 452/522 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 452 unsolved
SMT process timed out in 50563ms, After SMT, problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 50568ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51574 ms. Remains : 33/33 places, 459/459 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0)]
Knowledge based reduction with 9 factoid took 654 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[p0, (AND p0 p1), p0]
Stuttering acceptance computed with spot in 104 ms :[p0, (AND p0 p1), p0]
Stuttering acceptance computed with spot in 114 ms :[p0, (AND p0 p1), p0]
Product exploration explored 100000 steps with 0 reset in 81 ms.
Product exploration explored 100000 steps with 0 reset in 186 ms.
Built C files in :
/tmp/ltsmin13404741012743448403
[2024-05-24 06:16:20] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2024-05-24 06:16:20] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:16:20] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2024-05-24 06:16:20] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:16:20] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2024-05-24 06:16:20] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:16:20] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13404741012743448403
Running compilation step : cd /tmp/ltsmin13404741012743448403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2146 ms.
Running link step : cd /tmp/ltsmin13404741012743448403;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13404741012743448403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9039618940689604015.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 7 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:16:35] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2024-05-24 06:16:35] [INFO ] Computed 0 invariants in 2 ms
[2024-05-24 06:16:35] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20017 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40519ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40525ms
[2024-05-24 06:17:16] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:17:16] [INFO ] Invariant cache hit.
[2024-05-24 06:17:16] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-24 06:17:16] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:17:16] [INFO ] Invariant cache hit.
[2024-05-24 06:17:16] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 06:17:17] [INFO ] Implicit Places using invariants and state equation in 1071 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
[2024-05-24 06:17:17] [INFO ] Redundant transitions in 4 ms returned []
Running 466 sub problems to find dead transitions.
[2024-05-24 06:17:17] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:17:17] [INFO ] Invariant cache hit.
[2024-05-24 06:17:17] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30016 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 669 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30018 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
After SMT, in 60494ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60499ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 102203 ms. Remains : 43/43 places, 490/490 transitions.
Built C files in :
/tmp/ltsmin18123396812218918809
[2024-05-24 06:18:18] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2024-05-24 06:18:18] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:18:18] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2024-05-24 06:18:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:18:18] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2024-05-24 06:18:18] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:18:18] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18123396812218918809
Running compilation step : cd /tmp/ltsmin18123396812218918809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2062 ms.
Running link step : cd /tmp/ltsmin18123396812218918809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin18123396812218918809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7426847909267332571.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 06:18:33] [INFO ] Flatten gal took : 22 ms
[2024-05-24 06:18:33] [INFO ] Flatten gal took : 19 ms
[2024-05-24 06:18:33] [INFO ] Time to serialize gal into /tmp/LTL9132452030872659134.gal : 5 ms
[2024-05-24 06:18:33] [INFO ] Time to serialize properties into /tmp/LTL15903019961198673209.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9132452030872659134.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6590424950024142112.hoa' '-atoms' '/tmp/LTL15903019961198673209.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15903019961198673209.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6590424950024142112.hoa
Detected timeout of ITS tools.
[2024-05-24 06:18:48] [INFO ] Flatten gal took : 18 ms
[2024-05-24 06:18:48] [INFO ] Flatten gal took : 16 ms
[2024-05-24 06:18:48] [INFO ] Time to serialize gal into /tmp/LTL1910048280978617241.gal : 5 ms
[2024-05-24 06:18:48] [INFO ] Time to serialize properties into /tmp/LTL11621846738394568071.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1910048280978617241.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11621846738394568071.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((A10<1)||(A24<2))"))||((X("((A10<1)||(A24<2))"))&&(F("((((A29>=2)&&(A30>=1))||(A7<1))||(A13<2))")))))))
Formula 0 simplified : G(F!"((A10<1)||(A24<2))" & F(G!"((((A29>=2)&&(A30>=1))||(A7<1))||(A13<2))" | G!"((A10<1)||(A24<2))"))
Detected timeout of ITS tools.
[2024-05-24 06:19:03] [INFO ] Flatten gal took : 17 ms
[2024-05-24 06:19:03] [INFO ] Applying decomposition
[2024-05-24 06:19:03] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph709575054653784055.txt' '-o' '/tmp/graph709575054653784055.bin' '-w' '/tmp/graph709575054653784055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph709575054653784055.bin' '-l' '-1' '-v' '-w' '/tmp/graph709575054653784055.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:19:03] [INFO ] Decomposing Gal with order
[2024-05-24 06:19:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:19:03] [INFO ] Removed a total of 872 redundant transitions.
[2024-05-24 06:19:03] [INFO ] Flatten gal took : 32 ms
[2024-05-24 06:19:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-24 06:19:03] [INFO ] Time to serialize gal into /tmp/LTL7495072447640319708.gal : 4 ms
[2024-05-24 06:19:03] [INFO ] Time to serialize properties into /tmp/LTL17285353844398422217.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7495072447640319708.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17285353844398422217.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((u9.A10<1)||(u23.A24<2))"))||((X("((u9.A10<1)||(u23.A24<2))"))&&(F("((((u28.A29>=2)&&(u29.A30>=1))||(u6.A7<1))||(u12.A13<2...165
Formula 0 simplified : G(F!"((u9.A10<1)||(u23.A24<2))" & F(G!"((((u28.A29>=2)&&(u29.A30>=1))||(u6.A7<1))||(u12.A13<2))" | G!"((u9.A10<1)||(u23.A24<2))"))
Detected timeout of ITS tools.
Treatment of property DNAwalker-PT-17redondantChoiceL-LTLFireability-05 finished in 636978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||G(p1)))'
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:19:18] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:19:18] [INFO ] Invariant cache hit.
[2024-05-24 06:19:18] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20015 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40484ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40490ms
[2024-05-24 06:19:59] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:19:59] [INFO ] Invariant cache hit.
[2024-05-24 06:19:59] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-24 06:19:59] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:19:59] [INFO ] Invariant cache hit.
[2024-05-24 06:19:59] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 06:20:00] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:20:00] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:20:00] [INFO ] Invariant cache hit.
[2024-05-24 06:20:00] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30015 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 669 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30017 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
After SMT, in 60523ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60528ms
Finished structural reductions in LTL mode , in 1 iterations and 101965 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 287 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DNAwalker-PT-17redondantChoiceL-LTLFireability-06
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-17redondantChoiceL-LTLFireability-06 finished in 102275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((F(!p1) U !p2)))))'
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:21:00] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:21:00] [INFO ] Invariant cache hit.
[2024-05-24 06:21:00] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20024 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40506ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40511ms
[2024-05-24 06:21:41] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:21:41] [INFO ] Invariant cache hit.
[2024-05-24 06:21:41] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-24 06:21:41] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:21:41] [INFO ] Invariant cache hit.
[2024-05-24 06:21:41] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 06:21:42] [INFO ] Implicit Places using invariants and state equation in 1145 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:21:42] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:21:42] [INFO ] Invariant cache hit.
[2024-05-24 06:21:42] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30016 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 669 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30017 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
After SMT, in 60486ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60490ms
Finished structural reductions in LTL mode , in 1 iterations and 102232 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 445 ms :[p2, p2, p1, p2, p2, p2, (AND p1 p2), (AND p1 p2)]
Running random walk in product with property : DNAwalker-PT-17redondantChoiceL-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 63 ms.
Product exploration explored 100000 steps with 1 reset in 107 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT p1)), (X (NOT (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 2468 ms. Reduced automaton from 8 states, 23 edges and 3 AP (stutter sensitive) to 7 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 278 ms :[p2, p1, p2, p2, p2, (AND p1 p2), (AND p1 p2)]
RANDOM walk for 40000 steps (1530 resets) in 238 ms. (167 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (105 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (106 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (105 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (103 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
[2024-05-24 06:22:46] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:22:46] [INFO ] Invariant cache hit.
[2024-05-24 06:22:46] [INFO ] State equation strengthened by 161 read => feed constraints.
Problem apf3 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/132 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 35/40 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 377/509 variables, 26/66 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 125/191 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/191 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/531 variables, 12/203 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/204 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/532 variables, 0/204 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 2 solved, 2 unsolved in 353 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/132 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 35/40 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 377/509 variables, 26/66 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 125/191 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 2/193 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/193 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 205 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2334 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2707ms problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Graph (complete) has 478 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 42 transition count 473
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 24 place count 35 transition count 466
Applied a total of 24 rules in 12 ms. Remains 35 /43 variables (removed 8) and now considering 466/490 (removed 24) transitions.
Running 458 sub problems to find dead transitions.
// Phase 1: matrix 466 rows 35 cols
[2024-05-24 06:22:49] [INFO ] Computed 0 invariants in 2 ms
[2024-05-24 06:22:49] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 465/497 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 51/83 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (OVERLAPS) 4/501 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 6 (OVERLAPS) 0/501 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 458 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 86 constraints, problems are : Problem set: 0 solved, 458 unsolved in 20013 ms.
Refiners :[State Equation: 35/35 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 465/497 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 51/83 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 458/541 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/501 variables, and 541 constraints, problems are : Problem set: 0 solved, 458 unsolved in 20023 ms.
Refiners :[State Equation: 32/35 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 0/0 constraints]
After SMT, in 40487ms problems are : Problem set: 0 solved, 458 unsolved
Search for dead transitions found 0 dead transitions in 40492ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40505 ms. Remains : 35/43 places, 466/490 transitions.
RANDOM walk for 40000 steps (1579 resets) in 1002 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (170 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (165 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 516755 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 2
Probabilistic random walk after 516755 steps, saw 106479 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
[2024-05-24 06:23:33] [INFO ] Invariant cache hit.
[2024-05-24 06:23:33] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/132 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 363/495 variables, 26/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/501 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/501 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 86 constraints, problems are : Problem set: 0 solved, 2 unsolved in 221 ms.
Refiners :[State Equation: 35/35 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/132 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 363/495 variables, 26/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 88 constraints, problems are : Problem set: 0 solved, 2 unsolved in 18186 ms.
Refiners :[State Equation: 35/35 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 18446ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 466/466 transitions.
Applied a total of 0 rules in 5 ms. Remains 35 /35 variables (removed 0) and now considering 466/466 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 35/35 places, 466/466 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 466/466 transitions.
Applied a total of 0 rules in 3 ms. Remains 35 /35 variables (removed 0) and now considering 466/466 (removed 0) transitions.
[2024-05-24 06:23:51] [INFO ] Invariant cache hit.
[2024-05-24 06:23:51] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-24 06:23:51] [INFO ] Invariant cache hit.
[2024-05-24 06:23:52] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-24 06:23:53] [INFO ] Implicit Places using invariants and state equation in 1423 ms returned [34]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT with State Equation took 1498 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 34/35 places, 461/466 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1506 ms. Remains : 34/35 places, 461/466 transitions.
RANDOM walk for 40000 steps (1350 resets) in 1199 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (154 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (148 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 542704 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 2
Probabilistic random walk after 542704 steps, saw 114926 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
// Phase 1: matrix 461 rows 34 cols
[2024-05-24 06:23:56] [INFO ] Computed 0 invariants in 3 ms
[2024-05-24 06:23:56] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/132 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 357/489 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/495 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/495 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 85 constraints, problems are : Problem set: 0 solved, 2 unsolved in 248 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/132 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 357/489 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 87 constraints, problems are : Problem set: 0 solved, 2 unsolved in 30225 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 30508ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 461/461 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 34/34 places, 461/461 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 461/461 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2024-05-24 06:24:27] [INFO ] Invariant cache hit.
[2024-05-24 06:24:27] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-24 06:24:27] [INFO ] Invariant cache hit.
[2024-05-24 06:24:27] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-24 06:24:29] [INFO ] Implicit Places using invariants and state equation in 1558 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
[2024-05-24 06:24:29] [INFO ] Redundant transitions in 3 ms returned []
Running 453 sub problems to find dead transitions.
[2024-05-24 06:24:29] [INFO ] Invariant cache hit.
[2024-05-24 06:24:29] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 460/491 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 51/82 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (OVERLAPS) 4/495 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 6 (OVERLAPS) 0/495 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 453 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 85 constraints, problems are : Problem set: 0 solved, 453 unsolved in 25270 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 460/491 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 51/82 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 453/535 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (OVERLAPS) 4/495 variables, 3/538 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 538 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30047 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
After SMT, in 55767ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 55771ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57451 ms. Remains : 34/34 places, 461/461 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT p1)), (X (NOT (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p2 (NOT p1)))), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 6967 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[p2, p1, p2]
Stuttering acceptance computed with spot in 152 ms :[p2, p1, p2]
Support contains 4 out of 43 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 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 9 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:25:32] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2024-05-24 06:25:32] [INFO ] Computed 0 invariants in 7 ms
[2024-05-24 06:25:32] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20031 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40749ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40756ms
[2024-05-24 06:26:12] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:26:12] [INFO ] Invariant cache hit.
[2024-05-24 06:26:12] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-24 06:26:12] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:26:12] [INFO ] Invariant cache hit.
[2024-05-24 06:26:13] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 06:26:14] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 1613 ms to find 0 implicit places.
[2024-05-24 06:26:14] [INFO ] Redundant transitions in 4 ms returned []
Running 466 sub problems to find dead transitions.
[2024-05-24 06:26:14] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:26:14] [INFO ] Invariant cache hit.
[2024-05-24 06:26:14] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30016 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 669 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30019 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
After SMT, in 60458ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60462ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 102856 ms. Remains : 43/43 places, 490/490 transitions.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 8 factoid took 398 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[p2, p1, p2]
RANDOM walk for 40000 steps (1531 resets) in 295 ms. (135 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (108 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
[2024-05-24 06:27:15] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:27:15] [INFO ] Invariant cache hit.
[2024-05-24 06:27:15] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 378/507 variables, 26/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 125/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/531 variables, 13/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 333 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 378/507 variables, 26/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 125/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1309 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1658ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Graph (complete) has 478 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 42 transition count 472
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 34 transition count 464
Applied a total of 26 rules in 16 ms. Remains 34 /43 variables (removed 9) and now considering 464/490 (removed 26) transitions.
Running 457 sub problems to find dead transitions.
// Phase 1: matrix 464 rows 34 cols
[2024-05-24 06:27:17] [INFO ] Computed 0 invariants in 2 ms
[2024-05-24 06:27:17] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 464/496 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 35/67 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (OVERLAPS) 2/498 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (OVERLAPS) 0/498 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 457 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 69 constraints, problems are : Problem set: 0 solved, 457 unsolved in 20019 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 464/496 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 35/67 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 457/524 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/498 variables, and 524 constraints, problems are : Problem set: 0 solved, 457 unsolved in 20020 ms.
Refiners :[State Equation: 32/34 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 0/0 constraints]
After SMT, in 40720ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 40728ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40747 ms. Remains : 34/43 places, 464/490 transitions.
RANDOM walk for 40000 steps (1632 resets) in 268 ms. (148 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (167 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 769374 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 1
Probabilistic random walk after 769374 steps, saw 181928 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
[2024-05-24 06:28:01] [INFO ] Invariant cache hit.
[2024-05-24 06:28:01] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 363/492 variables, 26/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/498 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/498 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 240 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 363/492 variables, 26/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9187 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 9439ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 464/464 transitions.
Applied a total of 0 rules in 6 ms. Remains 34 /34 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 34/34 places, 464/464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 464/464 transitions.
Applied a total of 0 rules in 6 ms. Remains 34 /34 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-24 06:28:10] [INFO ] Invariant cache hit.
[2024-05-24 06:28:10] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-24 06:28:10] [INFO ] Invariant cache hit.
[2024-05-24 06:28:10] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-24 06:28:12] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned [33]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT with State Equation took 1527 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 33/34 places, 459/464 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 459/459 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1537 ms. Remains : 33/34 places, 459/464 transitions.
RANDOM walk for 40000 steps (1374 resets) in 302 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (151 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 851534 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :0 out of 1
Probabilistic random walk after 851534 steps, saw 203395 distinct states, run finished after 3001 ms. (steps per millisecond=283 ) properties seen :0
// Phase 1: matrix 459 rows 33 cols
[2024-05-24 06:28:15] [INFO ] Computed 0 invariants in 7 ms
[2024-05-24 06:28:15] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 357/486 variables, 25/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 6/492 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/492 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 245 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 357/486 variables, 25/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15154 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 15412ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 459/459 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 459/459 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 33/33 places, 459/459 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 459/459 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 459/459 (removed 0) transitions.
[2024-05-24 06:28:30] [INFO ] Invariant cache hit.
[2024-05-24 06:28:30] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-24 06:28:30] [INFO ] Invariant cache hit.
[2024-05-24 06:28:30] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-24 06:28:31] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
[2024-05-24 06:28:31] [INFO ] Redundant transitions in 5 ms returned []
Running 452 sub problems to find dead transitions.
[2024-05-24 06:28:31] [INFO ] Invariant cache hit.
[2024-05-24 06:28:31] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 459/490 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 35/66 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 2/492 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (OVERLAPS) 0/492 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 452 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 68 constraints, problems are : Problem set: 0 solved, 452 unsolved in 20772 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 459/490 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 35/66 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 452/518 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 520 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30018 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 0/0 constraints]
After SMT, in 51229ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 51237ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52278 ms. Remains : 33/33 places, 459/459 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p2), (F p1)]
Knowledge based reduction with 8 factoid took 396 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[p2, p1, p2]
Stuttering acceptance computed with spot in 134 ms :[p2, p1, p2]
Stuttering acceptance computed with spot in 140 ms :[p2, p1, p2]
Product exploration explored 100000 steps with 0 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 92 ms.
Built C files in :
/tmp/ltsmin5802856281837955629
[2024-05-24 06:29:23] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2024-05-24 06:29:23] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:29:23] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2024-05-24 06:29:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:29:24] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2024-05-24 06:29:24] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:29:24] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5802856281837955629
Running compilation step : cd /tmp/ltsmin5802856281837955629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2411 ms.
Running link step : cd /tmp/ltsmin5802856281837955629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5802856281837955629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3378440708633400743.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 5 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:29:39] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2024-05-24 06:29:39] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 06:29:39] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20016 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40486ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40491ms
[2024-05-24 06:30:19] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:30:19] [INFO ] Invariant cache hit.
[2024-05-24 06:30:19] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-24 06:30:19] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:30:19] [INFO ] Invariant cache hit.
[2024-05-24 06:30:19] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 06:30:20] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
[2024-05-24 06:30:20] [INFO ] Redundant transitions in 6 ms returned []
Running 466 sub problems to find dead transitions.
[2024-05-24 06:30:20] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:30:20] [INFO ] Invariant cache hit.
[2024-05-24 06:30:20] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30030 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 669 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30020 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
After SMT, in 60769ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60777ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 102554 ms. Remains : 43/43 places, 490/490 transitions.
Built C files in :
/tmp/ltsmin10293212923422843878
[2024-05-24 06:31:21] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2024-05-24 06:31:21] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:31:21] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2024-05-24 06:31:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:31:21] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2024-05-24 06:31:21] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:31:21] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10293212923422843878
Running compilation step : cd /tmp/ltsmin10293212923422843878;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2044 ms.
Running link step : cd /tmp/ltsmin10293212923422843878;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin10293212923422843878;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16044589775841536396.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 06:31:36] [INFO ] Flatten gal took : 15 ms
[2024-05-24 06:31:36] [INFO ] Flatten gal took : 16 ms
[2024-05-24 06:31:36] [INFO ] Time to serialize gal into /tmp/LTL8292819533112946174.gal : 4 ms
[2024-05-24 06:31:36] [INFO ] Time to serialize properties into /tmp/LTL16033069162958661367.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8292819533112946174.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11397843732441788853.hoa' '-atoms' '/tmp/LTL16033069162958661367.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16033069162958661367.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11397843732441788853.hoa
Detected timeout of ITS tools.
[2024-05-24 06:31:51] [INFO ] Flatten gal took : 15 ms
[2024-05-24 06:31:51] [INFO ] Flatten gal took : 14 ms
[2024-05-24 06:31:51] [INFO ] Time to serialize gal into /tmp/LTL10721558865887253706.gal : 5 ms
[2024-05-24 06:31:51] [INFO ] Time to serialize properties into /tmp/LTL9321368707055310245.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10721558865887253706.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9321368707055310245.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("((!((A11>=2)&&(A28>=1)))&&(B9>=1))")U(G((F(!("((A10>=2)&&(A26>=1))")))U(!("((A11>=2)&&(A28>=1))")))))))
Formula 0 simplified : X(!"((!((A11>=2)&&(A28>=1)))&&(B9>=1))" R F(G"((A10>=2)&&(A26>=1))" R "((A11>=2)&&(A28>=1))"))
Detected timeout of ITS tools.
[2024-05-24 06:32:06] [INFO ] Flatten gal took : 11 ms
[2024-05-24 06:32:06] [INFO ] Applying decomposition
[2024-05-24 06:32:06] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10718901982751040642.txt' '-o' '/tmp/graph10718901982751040642.bin' '-w' '/tmp/graph10718901982751040642.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10718901982751040642.bin' '-l' '-1' '-v' '-w' '/tmp/graph10718901982751040642.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:32:06] [INFO ] Decomposing Gal with order
[2024-05-24 06:32:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:32:06] [INFO ] Removed a total of 872 redundant transitions.
[2024-05-24 06:32:07] [INFO ] Flatten gal took : 28 ms
[2024-05-24 06:32:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-24 06:32:07] [INFO ] Time to serialize gal into /tmp/LTL7608726752012039942.gal : 3 ms
[2024-05-24 06:32:07] [INFO ] Time to serialize properties into /tmp/LTL17067281668907621361.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7608726752012039942.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17067281668907621361.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(("((!((u10.A11>=2)&&(u27.A28>=1)))&&(u8.B9>=1))")U(G((F(!("((u9.A10>=2)&&(u25.A26>=1))")))U(!("((u10.A11>=2)&&(u27.A28>=1))")))))...157
Formula 0 simplified : X(!"((!((u10.A11>=2)&&(u27.A28>=1)))&&(u8.B9>=1))" R F(G"((u9.A10>=2)&&(u25.A26>=1))" R "((u10.A11>=2)&&(u27.A28>=1))"))
Detected timeout of ITS tools.
Treatment of property DNAwalker-PT-17redondantChoiceL-LTLFireability-07 finished in 681167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(!p1)||(!p1&&F(p2))))'
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 5 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:32:22] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:32:22] [INFO ] Invariant cache hit.
[2024-05-24 06:32:22] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20019 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40487ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40492ms
[2024-05-24 06:33:02] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:33:02] [INFO ] Invariant cache hit.
[2024-05-24 06:33:02] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-24 06:33:02] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:33:02] [INFO ] Invariant cache hit.
[2024-05-24 06:33:02] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 06:33:04] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
[2024-05-24 06:33:04] [INFO ] Redundant transitions in 5 ms returned []
Running 466 sub problems to find dead transitions.
[2024-05-24 06:33:04] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:33:04] [INFO ] Invariant cache hit.
[2024-05-24 06:33:04] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 30780ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 30788ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72780 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 305 ms :[true, (NOT p2), (AND (NOT p0) p1), (NOT p0), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DNAwalker-PT-17redondantChoiceL-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 140 ms.
Product exploration explored 100000 steps with 0 reset in 150 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p1)), (X (AND p0 (NOT p1) (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 19 factoid took 3558 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter insensitive) to 9 states, 37 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 419 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p1)]
RANDOM walk for 40000 steps (1527 resets) in 605 ms. (66 steps per ms) remains 4/15 properties
BEST_FIRST walk for 40003 steps (102 resets) in 245 ms. (162 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (99 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (98 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (103 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
[2024-05-24 06:33:40] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:33:40] [INFO ] Invariant cache hit.
[2024-05-24 06:33:40] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 178/184 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 330/514 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 126/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 17/531 variables, 9/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 4 unsolved in 461 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 178/184 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 330/514 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/532 variables, and 194 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4242 ms.
Refiners :[State Equation: 34/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 4725ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Graph (complete) has 478 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 42 transition count 472
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 34 transition count 464
Applied a total of 26 rules in 18 ms. Remains 34 /43 variables (removed 9) and now considering 464/490 (removed 26) transitions.
Running 458 sub problems to find dead transitions.
// Phase 1: matrix 464 rows 34 cols
[2024-05-24 06:33:44] [INFO ] Computed 0 invariants in 2 ms
[2024-05-24 06:33:44] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 464/496 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 34/66 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (OVERLAPS) 2/498 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/498 variables, and 68 constraints, problems are : Problem set: 0 solved, 458 unsolved in 20018 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 464/496 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 34/66 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 458/524 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/496 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 526 constraints, problems are : Problem set: 0 solved, 458 unsolved in 20020 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 0/0 constraints]
After SMT, in 40562ms problems are : Problem set: 0 solved, 458 unsolved
Search for dead transitions found 0 dead transitions in 40571ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40592 ms. Remains : 34/43 places, 464/490 transitions.
RANDOM walk for 40000 steps (1652 resets) in 2313 ms. (17 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (166 resets) in 223 ms. (178 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (164 resets) in 226 ms. (176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (165 resets) in 220 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (160 resets) in 217 ms. (183 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 247584 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 4
Probabilistic random walk after 247584 steps, saw 59816 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-05-24 06:34:29] [INFO ] Invariant cache hit.
[2024-05-24 06:34:29] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 178/184 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 314/498 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/498 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 68 constraints, problems are : Problem set: 0 solved, 4 unsolved in 506 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 178/184 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 68 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36227 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 36771ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 464/464 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 34/34 places, 464/464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 464/464 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-24 06:35:06] [INFO ] Invariant cache hit.
[2024-05-24 06:35:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-24 06:35:06] [INFO ] Invariant cache hit.
[2024-05-24 06:35:06] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-24 06:35:07] [INFO ] Implicit Places using invariants and state equation in 856 ms returned [33]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 940 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 33/34 places, 460/464 transitions.
Applied a total of 0 rules in 6 ms. Remains 33 /33 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 953 ms. Remains : 33/34 places, 460/464 transitions.
RANDOM walk for 40000 steps (1448 resets) in 2094 ms. (19 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (158 resets) in 361 ms. (110 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (154 resets) in 335 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (150 resets) in 334 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (150 resets) in 308 ms. (129 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 227261 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 4
Probabilistic random walk after 227261 steps, saw 55707 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 460 rows 33 cols
[2024-05-24 06:35:11] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 06:35:11] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 178/184 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 309/493 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/493 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 67 constraints, problems are : Problem set: 0 solved, 4 unsolved in 529 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 178/184 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/493 variables, and 67 constraints, problems are : Problem set: 0 solved, 4 unsolved in 60179 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 60740ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 460/460 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 33/33 places, 460/460 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 460/460 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2024-05-24 06:36:12] [INFO ] Invariant cache hit.
[2024-05-24 06:36:12] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-24 06:36:12] [INFO ] Invariant cache hit.
[2024-05-24 06:36:12] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-24 06:36:13] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
[2024-05-24 06:36:13] [INFO ] Redundant transitions in 5 ms returned []
Running 454 sub problems to find dead transitions.
[2024-05-24 06:36:13] [INFO ] Invariant cache hit.
[2024-05-24 06:36:13] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (OVERLAPS) 460/491 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (OVERLAPS) 2/493 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (OVERLAPS) 0/493 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 454 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 67 constraints, problems are : Problem set: 0 solved, 454 unsolved in 20104 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (OVERLAPS) 460/491 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 454/519 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 454 unsolved
SMT process timed out in 50855ms, After SMT, problems are : Problem set: 0 solved, 454 unsolved
Search for dead transitions found 0 dead transitions in 50862ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51966 ms. Remains : 33/33 places, 460/460 transitions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p1)), (X (AND p0 (NOT p1) (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) p0)))]
Knowledge based reduction with 19 factoid took 6344 ms. Reduced automaton from 9 states, 37 edges and 3 AP (stutter insensitive) to 9 states, 37 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 467 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 446 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p1)]
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 7 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:37:11] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2024-05-24 06:37:11] [INFO ] Computed 0 invariants in 3 ms
[2024-05-24 06:37:11] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20018 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40635ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40641ms
[2024-05-24 06:37:51] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:37:51] [INFO ] Invariant cache hit.
[2024-05-24 06:37:51] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-24 06:37:51] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:37:51] [INFO ] Invariant cache hit.
[2024-05-24 06:37:52] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 06:37:53] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
[2024-05-24 06:37:53] [INFO ] Redundant transitions in 4 ms returned []
Running 466 sub problems to find dead transitions.
[2024-05-24 06:37:53] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:37:53] [INFO ] Invariant cache hit.
[2024-05-24 06:37:53] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30014 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 669 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30032 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
After SMT, in 60479ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60483ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 102309 ms. Remains : 43/43 places, 490/490 transitions.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p2) p0)), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 29 factoid took 3991 ms. Reduced automaton from 9 states, 37 edges and 3 AP (stutter insensitive) to 9 states, 37 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 415 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p1)]
RANDOM walk for 40000 steps (1517 resets) in 2791 ms. (14 steps per ms) remains 4/15 properties
BEST_FIRST walk for 40004 steps (101 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (100 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (98 resets) in 210 ms. (189 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (104 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
[2024-05-24 06:38:59] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:38:59] [INFO ] Invariant cache hit.
[2024-05-24 06:38:59] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 178/184 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 330/514 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 126/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 17/531 variables, 9/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 4 unsolved in 494 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 178/184 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 330/514 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/532 variables, and 194 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4188 ms.
Refiners :[State Equation: 34/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 4704ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Graph (complete) has 478 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 42 transition count 472
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 34 transition count 464
Applied a total of 26 rules in 11 ms. Remains 34 /43 variables (removed 9) and now considering 464/490 (removed 26) transitions.
Running 458 sub problems to find dead transitions.
// Phase 1: matrix 464 rows 34 cols
[2024-05-24 06:39:03] [INFO ] Computed 0 invariants in 2 ms
[2024-05-24 06:39:03] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 464/496 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 34/66 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (OVERLAPS) 2/498 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 6 (OVERLAPS) 0/498 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 458 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 68 constraints, problems are : Problem set: 0 solved, 458 unsolved in 19533 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 464/496 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 34/66 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 458/524 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/496 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 526 constraints, problems are : Problem set: 0 solved, 458 unsolved in 20015 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 0/0 constraints]
After SMT, in 40205ms problems are : Problem set: 0 solved, 458 unsolved
Search for dead transitions found 0 dead transitions in 40210ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40223 ms. Remains : 34/43 places, 464/490 transitions.
RANDOM walk for 40000 steps (1653 resets) in 2158 ms. (18 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (176 resets) in 278 ms. (143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (163 resets) in 218 ms. (182 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (164 resets) in 277 ms. (143 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 233581 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 4
Probabilistic random walk after 233581 steps, saw 56868 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2024-05-24 06:39:47] [INFO ] Invariant cache hit.
[2024-05-24 06:39:47] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 178/184 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 314/498 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/498 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 68 constraints, problems are : Problem set: 0 solved, 4 unsolved in 405 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 178/184 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 68 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36147 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 36587ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 464/464 transitions.
Applied a total of 0 rules in 6 ms. Remains 34 /34 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 34/34 places, 464/464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 464/464 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-24 06:40:24] [INFO ] Invariant cache hit.
[2024-05-24 06:40:24] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-24 06:40:24] [INFO ] Invariant cache hit.
[2024-05-24 06:40:24] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-24 06:40:25] [INFO ] Implicit Places using invariants and state equation in 976 ms returned [33]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 1076 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 33/34 places, 460/464 transitions.
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1085 ms. Remains : 33/34 places, 460/464 transitions.
RANDOM walk for 40000 steps (1449 resets) in 2380 ms. (16 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (155 resets) in 331 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (159 resets) in 373 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (148 resets) in 337 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (149 resets) in 324 ms. (123 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 221998 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 4
Probabilistic random walk after 221998 steps, saw 54674 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
// Phase 1: matrix 460 rows 33 cols
[2024-05-24 06:40:29] [INFO ] Computed 0 invariants in 2 ms
[2024-05-24 06:40:29] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 178/184 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 309/493 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/493 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 67 constraints, problems are : Problem set: 0 solved, 4 unsolved in 501 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 178/184 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/493 variables, and 67 constraints, problems are : Problem set: 0 solved, 4 unsolved in 60210 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 60746ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 460/460 transitions.
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 33/33 places, 460/460 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 460/460 transitions.
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2024-05-24 06:41:30] [INFO ] Invariant cache hit.
[2024-05-24 06:41:30] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-24 06:41:30] [INFO ] Invariant cache hit.
[2024-05-24 06:41:30] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-24 06:41:31] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
[2024-05-24 06:41:31] [INFO ] Redundant transitions in 3 ms returned []
Running 454 sub problems to find dead transitions.
[2024-05-24 06:41:31] [INFO ] Invariant cache hit.
[2024-05-24 06:41:31] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (OVERLAPS) 460/491 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (OVERLAPS) 2/493 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (OVERLAPS) 0/493 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 454 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 67 constraints, problems are : Problem set: 0 solved, 454 unsolved in 19638 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (OVERLAPS) 460/491 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 454/519 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 454 unsolved
SMT process timed out in 50066ms, After SMT, problems are : Problem set: 0 solved, 454 unsolved
Search for dead transitions found 0 dead transitions in 50071ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51316 ms. Remains : 33/33 places, 460/460 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p2) p0)), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) p0)))]
Knowledge based reduction with 29 factoid took 7127 ms. Reduced automaton from 9 states, 37 edges and 3 AP (stutter insensitive) to 9 states, 37 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 406 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 429 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 424 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p1)]
Stuttering criterion allowed to conclude after 77 steps with 2 reset in 1 ms.
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-17redondantChoiceL-LTLFireability-08 finished in 608277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 5 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:42:30] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2024-05-24 06:42:30] [INFO ] Computed 0 invariants in 3 ms
[2024-05-24 06:42:30] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20015 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40504ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40509ms
[2024-05-24 06:43:10] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:43:10] [INFO ] Invariant cache hit.
[2024-05-24 06:43:10] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-24 06:43:10] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:43:10] [INFO ] Invariant cache hit.
[2024-05-24 06:43:11] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 06:43:12] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2024-05-24 06:43:12] [INFO ] Redundant transitions in 4 ms returned []
Running 466 sub problems to find dead transitions.
[2024-05-24 06:43:12] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:43:12] [INFO ] Invariant cache hit.
[2024-05-24 06:43:12] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 30459ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 30463ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72161 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DNAwalker-PT-17redondantChoiceL-LTLFireability-09
Product exploration explored 100000 steps with 1 reset in 66 ms.
Product exploration explored 100000 steps with 0 reset in 79 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 468 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 361 steps (11 resets) in 8 ms. (40 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 419 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-24 06:43:44] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:43:44] [INFO ] Invariant cache hit.
[2024-05-24 06:43:44] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-24 06:43:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 06:43:48] [INFO ] [Nat]Absence check using state equation in 3242 ms returned unknown
Could not prove EG (NOT p1)
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 5 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:43:48] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:43:48] [INFO ] Invariant cache hit.
[2024-05-24 06:43:48] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20019 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40525ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40536ms
[2024-05-24 06:44:28] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:44:28] [INFO ] Invariant cache hit.
[2024-05-24 06:44:28] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-24 06:44:28] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:44:28] [INFO ] Invariant cache hit.
[2024-05-24 06:44:28] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 06:44:29] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
[2024-05-24 06:44:29] [INFO ] Redundant transitions in 4 ms returned []
Running 466 sub problems to find dead transitions.
[2024-05-24 06:44:29] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:44:29] [INFO ] Invariant cache hit.
[2024-05-24 06:44:29] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30018 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 669 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30022 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
After SMT, in 60464ms problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60469ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 102152 ms. Remains : 43/43 places, 490/490 transitions.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 344 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 251 steps (8 resets) in 9 ms. (25 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 421 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-24 06:45:31] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:45:31] [INFO ] Invariant cache hit.
[2024-05-24 06:45:31] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-24 06:45:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 06:45:35] [INFO ] [Nat]Absence check using state equation in 3143 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 91 ms.
Product exploration explored 100000 steps with 0 reset in 85 ms.
Built C files in :
/tmp/ltsmin4854716151999031423
[2024-05-24 06:45:35] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2024-05-24 06:45:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:45:35] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2024-05-24 06:45:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:45:35] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2024-05-24 06:45:35] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:45:35] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4854716151999031423
Running compilation step : cd /tmp/ltsmin4854716151999031423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2079 ms.
Running link step : cd /tmp/ltsmin4854716151999031423;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin4854716151999031423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10992077566483212026.hoa' '--buchi-type=spotba'
LTSmin run took 1204 ms.
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DNAwalker-PT-17redondantChoiceL-LTLFireability-09 finished in 188756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running 466 sub problems to find dead transitions.
[2024-05-24 06:45:39] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:45:39] [INFO ] Invariant cache hit.
[2024-05-24 06:45:39] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/532 variables, and 203 constraints, problems are : Problem set: 0 solved, 466 unsolved in 20012 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 466/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 40462ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 40467ms
[2024-05-24 06:46:19] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:46:19] [INFO ] Invariant cache hit.
[2024-05-24 06:46:19] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-24 06:46:19] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:46:19] [INFO ] Invariant cache hit.
[2024-05-24 06:46:19] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 06:46:20] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1384 ms to find 0 implicit places.
[2024-05-24 06:46:20] [INFO ] Redundant transitions in 6 ms returned []
Running 466 sub problems to find dead transitions.
[2024-05-24 06:46:20] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-24 06:46:20] [INFO ] Invariant cache hit.
[2024-05-24 06:46:20] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (OVERLAPS) 20/531 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 466 unsolved
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-17redondantChoiceL"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DNAwalker-PT-17redondantChoiceL, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-171624276100500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-17redondantChoiceL.tgz
mv DNAwalker-PT-17redondantChoiceL execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;