About the Execution of LTSMin+red for EisenbergMcGuire-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3118.424 | 3600000.00 | 10002685.00 | 4222.40 | FFFFFFTFTFFF???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.r492-smll-171636266300188.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 ltsminxred
Input is EisenbergMcGuire-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300188
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 EisenbergMcGuire-PT-08-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717229882259
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:18:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:18:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:18:04] [INFO ] Load time of PNML (sax parser for PT used): 337 ms
[2024-06-01 08:18:04] [INFO ] Transformed 712 places.
[2024-06-01 08:18:04] [INFO ] Transformed 2816 transitions.
[2024-06-01 08:18:04] [INFO ] Found NUPN structural information;
[2024-06-01 08:18:04] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 613 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 663 transition count 2424
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 663 transition count 2424
Applied a total of 98 rules in 172 ms. Remains 663 /712 variables (removed 49) and now considering 2424/2816 (removed 392) transitions.
[2024-06-01 08:18:05] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
// Phase 1: matrix 976 rows 663 cols
[2024-06-01 08:18:05] [INFO ] Computed 25 invariants in 35 ms
[2024-06-01 08:18:06] [INFO ] Implicit Places using invariants in 1291 ms returned []
[2024-06-01 08:18:06] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2024-06-01 08:18:06] [INFO ] Invariant cache hit.
[2024-06-01 08:18:07] [INFO ] State equation strengthened by 333 read => feed constraints.
[2024-06-01 08:18:10] [INFO ] Implicit Places using invariants and state equation in 3577 ms returned []
Implicit Place search using SMT with State Equation took 4921 ms to find 0 implicit places.
Running 2416 sub problems to find dead transitions.
[2024-06-01 08:18:10] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2024-06-01 08:18:10] [INFO ] Invariant cache hit.
[2024-06-01 08:18:10] [INFO ] State equation strengthened by 333 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2416 unsolved
SMT process timed out in 32089ms, After SMT, problems are : Problem set: 0 solved, 2416 unsolved
Search for dead transitions found 0 dead transitions in 32159ms
Starting structural reductions in LTL mode, iteration 1 : 663/712 places, 2424/2816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37318 ms. Remains : 663/712 places, 2424/2816 transitions.
Support contains 38 out of 663 places after structural reductions.
[2024-06-01 08:18:42] [INFO ] Flatten gal took : 276 ms
[2024-06-01 08:18:43] [INFO ] Flatten gal took : 207 ms
[2024-06-01 08:18:43] [INFO ] Input system was already deterministic with 2424 transitions.
Support contains 35 out of 663 places (down from 38) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (8 resets) in 2306 ms. (17 steps per ms) remains 15/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
[2024-06-01 08:18:44] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2024-06-01 08:18:44] [INFO ] Invariant cache hit.
[2024-06-01 08:18:44] [INFO ] State equation strengthened by 333 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 517/548 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 25/573 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 64/637 variables, 8/23 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 26/663 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 976/1639 variables, 663/688 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1639 variables, 333/1021 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1639 variables, 0/1021 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/1639 variables, 0/1021 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1639/1639 variables, and 1021 constraints, problems are : Problem set: 1 solved, 14 unsolved in 2650 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 663/663 constraints, ReadFeed: 333/333 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 519/548 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 25/573 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 64/637 variables, 8/23 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-01 08:18:48] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 31 ms to minimize.
[2024-06-01 08:18:48] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 13 ms to minimize.
[2024-06-01 08:18:48] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 3 ms to minimize.
[2024-06-01 08:18:49] [INFO ] Deduced a trap composed of 142 places in 407 ms of which 6 ms to minimize.
[2024-06-01 08:18:49] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 3 ms to minimize.
[2024-06-01 08:18:49] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-06-01 08:18:49] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 4 ms to minimize.
[2024-06-01 08:18:50] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-06-01 08:18:50] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 9/32 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-01 08:18:50] [INFO ] Deduced a trap composed of 100 places in 427 ms of which 6 ms to minimize.
[2024-06-01 08:18:50] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2024-06-01 08:18:51] [INFO ] Deduced a trap composed of 143 places in 352 ms of which 4 ms to minimize.
[2024-06-01 08:18:51] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 4/36 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 26/663 variables, 2/38 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-01 08:18:52] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:18:52] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:18:52] [INFO ] Deduced a trap composed of 102 places in 460 ms of which 6 ms to minimize.
SMT process timed out in 8178ms, After SMT, problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 663 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 16 place count 655 transition count 2218
Deduced a syphon composed of 198 places in 5 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 412 place count 457 transition count 2218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 415 place count 454 transition count 2194
Iterating global reduction 2 with 3 rules applied. Total rules applied 418 place count 454 transition count 2194
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 530 place count 398 transition count 2138
Applied a total of 530 rules in 363 ms. Remains 398 /663 variables (removed 265) and now considering 2138/2424 (removed 286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 398/663 places, 2138/2424 transitions.
RANDOM walk for 40000 steps (8 resets) in 670 ms. (59 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 199548 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :1 out of 13
Probabilistic random walk after 199548 steps, saw 115350 distinct states, run finished after 3012 ms. (steps per millisecond=66 ) properties seen :1
[2024-06-01 08:18:56] [INFO ] Flow matrix only has 690 transitions (discarded 1448 similar events)
// Phase 1: matrix 690 rows 398 cols
[2024-06-01 08:18:56] [INFO ] Computed 25 invariants in 5 ms
[2024-06-01 08:18:56] [INFO ] State equation strengthened by 312 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 303/332 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 10/342 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 46/388 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 10/398 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 690/1088 variables, 398/423 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1088 variables, 312/735 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1088 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/1088 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 735 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1307 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 398/398 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 303/332 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 10/342 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 46/388 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 08:18:58] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2024-06-01 08:18:58] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 08:18:58] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:18:58] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2024-06-01 08:18:59] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:18:59] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:18:59] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:18:59] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2024-06-01 08:18:59] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 2 ms to minimize.
[2024-06-01 08:18:59] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 10/398 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 08:18:59] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:19:00] [INFO ] Deduced a trap composed of 76 places in 391 ms of which 4 ms to minimize.
[2024-06-01 08:19:00] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2024-06-01 08:19:00] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 690/1088 variables, 398/437 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1088 variables, 312/749 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1088 variables, 12/761 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1088 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/1088 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 761 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4580 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 398/398 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 14/14 constraints]
After SMT, in 5950ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 1 properties in 14206 ms.
Support contains 28 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 2138/2138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 397 transition count 2130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 397 transition count 2130
Applied a total of 2 rules in 166 ms. Remains 397 /398 variables (removed 1) and now considering 2130/2138 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 397/398 places, 2130/2138 transitions.
RANDOM walk for 40000 steps (8 resets) in 317 ms. (125 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 147384 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 11
Probabilistic random walk after 147384 steps, saw 88121 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-06-01 08:19:20] [INFO ] Flow matrix only has 682 transitions (discarded 1448 similar events)
// Phase 1: matrix 682 rows 397 cols
[2024-06-01 08:19:20] [INFO ] Computed 25 invariants in 6 ms
[2024-06-01 08:19:20] [INFO ] State equation strengthened by 305 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 303/331 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 10/341 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 46/387 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 10/397 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 682/1079 variables, 397/422 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1079 variables, 305/727 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1079 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/1079 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 727 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1353 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 397/397 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 303/331 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 10/341 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 46/387 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 08:19:22] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
[2024-06-01 08:19:22] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2024-06-01 08:19:22] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:19:22] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-06-01 08:19:23] [INFO ] Deduced a trap composed of 22 places in 260 ms of which 3 ms to minimize.
[2024-06-01 08:19:23] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2024-06-01 08:19:23] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 3 ms to minimize.
[2024-06-01 08:19:23] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:19:23] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-06-01 08:19:23] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 10/397 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 08:19:24] [INFO ] Deduced a trap composed of 98 places in 303 ms of which 4 ms to minimize.
[2024-06-01 08:19:24] [INFO ] Deduced a trap composed of 98 places in 336 ms of which 3 ms to minimize.
[2024-06-01 08:19:24] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:19:25] [INFO ] Deduced a trap composed of 21 places in 314 ms of which 3 ms to minimize.
[2024-06-01 08:19:25] [INFO ] Deduced a trap composed of 41 places in 316 ms of which 3 ms to minimize.
[2024-06-01 08:19:25] [INFO ] Deduced a trap composed of 95 places in 311 ms of which 4 ms to minimize.
[2024-06-01 08:19:26] [INFO ] Deduced a trap composed of 91 places in 323 ms of which 4 ms to minimize.
[2024-06-01 08:19:26] [INFO ] Deduced a trap composed of 77 places in 407 ms of which 4 ms to minimize.
[2024-06-01 08:19:26] [INFO ] Deduced a trap composed of 74 places in 402 ms of which 4 ms to minimize.
[2024-06-01 08:19:27] [INFO ] Deduced a trap composed of 90 places in 385 ms of which 4 ms to minimize.
[2024-06-01 08:19:27] [INFO ] Deduced a trap composed of 83 places in 381 ms of which 4 ms to minimize.
[2024-06-01 08:19:28] [INFO ] Deduced a trap composed of 81 places in 391 ms of which 4 ms to minimize.
[2024-06-01 08:19:28] [INFO ] Deduced a trap composed of 60 places in 418 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 08:19:29] [INFO ] Deduced a trap composed of 80 places in 396 ms of which 4 ms to minimize.
[2024-06-01 08:19:29] [INFO ] Deduced a trap composed of 91 places in 345 ms of which 3 ms to minimize.
[2024-06-01 08:19:29] [INFO ] Deduced a trap composed of 83 places in 350 ms of which 3 ms to minimize.
[2024-06-01 08:19:30] [INFO ] Deduced a trap composed of 75 places in 389 ms of which 4 ms to minimize.
[2024-06-01 08:19:30] [INFO ] Deduced a trap composed of 129 places in 377 ms of which 4 ms to minimize.
[2024-06-01 08:19:31] [INFO ] Deduced a trap composed of 84 places in 370 ms of which 4 ms to minimize.
[2024-06-01 08:19:31] [INFO ] Deduced a trap composed of 77 places in 365 ms of which 4 ms to minimize.
[2024-06-01 08:19:31] [INFO ] Deduced a trap composed of 104 places in 432 ms of which 4 ms to minimize.
[2024-06-01 08:19:32] [INFO ] Deduced a trap composed of 79 places in 395 ms of which 4 ms to minimize.
[2024-06-01 08:19:32] [INFO ] Deduced a trap composed of 81 places in 405 ms of which 4 ms to minimize.
[2024-06-01 08:19:33] [INFO ] Deduced a trap composed of 68 places in 398 ms of which 4 ms to minimize.
[2024-06-01 08:19:33] [INFO ] Deduced a trap composed of 76 places in 375 ms of which 3 ms to minimize.
[2024-06-01 08:19:33] [INFO ] Deduced a trap composed of 78 places in 384 ms of which 3 ms to minimize.
[2024-06-01 08:19:34] [INFO ] Deduced a trap composed of 75 places in 391 ms of which 4 ms to minimize.
[2024-06-01 08:19:34] [INFO ] Deduced a trap composed of 87 places in 392 ms of which 4 ms to minimize.
[2024-06-01 08:19:35] [INFO ] Deduced a trap composed of 31 places in 399 ms of which 3 ms to minimize.
[2024-06-01 08:19:35] [INFO ] Deduced a trap composed of 27 places in 395 ms of which 4 ms to minimize.
[2024-06-01 08:19:35] [INFO ] Deduced a trap composed of 108 places in 398 ms of which 4 ms to minimize.
[2024-06-01 08:19:36] [INFO ] Deduced a trap composed of 76 places in 362 ms of which 3 ms to minimize.
[2024-06-01 08:19:36] [INFO ] Deduced a trap composed of 53 places in 380 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 08:19:37] [INFO ] Deduced a trap composed of 103 places in 354 ms of which 4 ms to minimize.
[2024-06-01 08:19:37] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 3 ms to minimize.
[2024-06-01 08:19:37] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 2 ms to minimize.
[2024-06-01 08:19:37] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:19:37] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 1 ms to minimize.
[2024-06-01 08:19:37] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
[2024-06-01 08:19:38] [INFO ] Deduced a trap composed of 74 places in 333 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 08:19:38] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 682/1079 variables, 397/473 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1079 variables, 305/778 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1079 variables, 11/789 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 08:19:39] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1079 variables, 1/790 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1079 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 0/1079 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 790 constraints, problems are : Problem set: 0 solved, 11 unsolved in 19355 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 397/397 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 52/52 constraints]
After SMT, in 20746ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 9002 ms.
Support contains 28 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 2130/2130 transitions.
Applied a total of 0 rules in 95 ms. Remains 397 /397 variables (removed 0) and now considering 2130/2130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 397/397 places, 2130/2130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 2130/2130 transitions.
Applied a total of 0 rules in 81 ms. Remains 397 /397 variables (removed 0) and now considering 2130/2130 (removed 0) transitions.
[2024-06-01 08:19:50] [INFO ] Flow matrix only has 682 transitions (discarded 1448 similar events)
[2024-06-01 08:19:50] [INFO ] Invariant cache hit.
[2024-06-01 08:19:51] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-06-01 08:19:51] [INFO ] Flow matrix only has 682 transitions (discarded 1448 similar events)
[2024-06-01 08:19:51] [INFO ] Invariant cache hit.
[2024-06-01 08:19:51] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-06-01 08:19:53] [INFO ] Implicit Places using invariants and state equation in 2088 ms returned []
Implicit Place search using SMT with State Equation took 2647 ms to find 0 implicit places.
[2024-06-01 08:19:53] [INFO ] Redundant transitions in 131 ms returned []
Running 2122 sub problems to find dead transitions.
[2024-06-01 08:19:53] [INFO ] Flow matrix only has 682 transitions (discarded 1448 similar events)
[2024-06-01 08:19:53] [INFO ] Invariant cache hit.
[2024-06-01 08:19:53] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2122 unsolved
[2024-06-01 08:20:12] [INFO ] Deduced a trap composed of 3 places in 441 ms of which 5 ms to minimize.
[2024-06-01 08:20:13] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 2 ms to minimize.
[2024-06-01 08:20:13] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 2 ms to minimize.
[2024-06-01 08:20:13] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-06-01 08:20:13] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:20:13] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:20:13] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 3 ms to minimize.
[2024-06-01 08:20:15] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-06-01 08:20:16] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 3 ms to minimize.
[2024-06-01 08:20:16] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 3 ms to minimize.
[2024-06-01 08:20:16] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 4 ms to minimize.
[2024-06-01 08:20:17] [INFO ] Deduced a trap composed of 59 places in 203 ms of which 3 ms to minimize.
[2024-06-01 08:20:17] [INFO ] Deduced a trap composed of 58 places in 216 ms of which 2 ms to minimize.
[2024-06-01 08:20:17] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 3 ms to minimize.
[2024-06-01 08:20:17] [INFO ] Deduced a trap composed of 79 places in 210 ms of which 3 ms to minimize.
[2024-06-01 08:20:18] [INFO ] Deduced a trap composed of 53 places in 277 ms of which 3 ms to minimize.
[2024-06-01 08:20:18] [INFO ] Deduced a trap composed of 70 places in 227 ms of which 3 ms to minimize.
[2024-06-01 08:20:18] [INFO ] Deduced a trap composed of 63 places in 237 ms of which 2 ms to minimize.
[2024-06-01 08:20:18] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 3 ms to minimize.
[2024-06-01 08:20:19] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2122 unsolved
[2024-06-01 08:20:23] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 397/1079 variables, and 46 constraints, problems are : Problem set: 0 solved, 2122 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/397 constraints, ReadFeed: 0/305 constraints, PredecessorRefiner: 2122/2122 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 21/46 constraints. Problems are: Problem set: 0 solved, 2122 unsolved
[2024-06-01 08:20:34] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 2 ms to minimize.
[2024-06-01 08:20:34] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 2 ms to minimize.
[2024-06-01 08:20:37] [INFO ] Deduced a trap composed of 16 places in 271 ms of which 3 ms to minimize.
[2024-06-01 08:20:37] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:20:40] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-06-01 08:20:44] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:20:47] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-06-01 08:20:49] [INFO ] Deduced a trap composed of 24 places in 388 ms of which 3 ms to minimize.
[2024-06-01 08:20:49] [INFO ] Deduced a trap composed of 18 places in 372 ms of which 3 ms to minimize.
[2024-06-01 08:20:52] [INFO ] Deduced a trap composed of 20 places in 376 ms of which 3 ms to minimize.
[2024-06-01 08:20:52] [INFO ] Deduced a trap composed of 24 places in 407 ms of which 4 ms to minimize.
[2024-06-01 08:20:53] [INFO ] Deduced a trap composed of 22 places in 391 ms of which 4 ms to minimize.
[2024-06-01 08:20:53] [INFO ] Deduced a trap composed of 29 places in 377 ms of which 3 ms to minimize.
[2024-06-01 08:20:54] [INFO ] Deduced a trap composed of 21 places in 373 ms of which 4 ms to minimize.
[2024-06-01 08:20:54] [INFO ] Deduced a trap composed of 19 places in 399 ms of which 4 ms to minimize.
[2024-06-01 08:20:54] [INFO ] Deduced a trap composed of 24 places in 340 ms of which 3 ms to minimize.
SMT process timed out in 61643ms, After SMT, problems are : Problem set: 0 solved, 2122 unsolved
Search for dead transitions found 0 dead transitions in 61671ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64545 ms. Remains : 397/397 places, 2130/2130 transitions.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 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(G((!p0&&(p1 U p2)))))'
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 658 transition count 2384
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 658 transition count 2384
Applied a total of 10 rules in 59 ms. Remains 658 /663 variables (removed 5) and now considering 2384/2424 (removed 40) transitions.
[2024-06-01 08:20:55] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
// Phase 1: matrix 936 rows 658 cols
[2024-06-01 08:20:55] [INFO ] Computed 25 invariants in 12 ms
[2024-06-01 08:20:56] [INFO ] Implicit Places using invariants in 858 ms returned []
[2024-06-01 08:20:56] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2024-06-01 08:20:56] [INFO ] Invariant cache hit.
[2024-06-01 08:20:56] [INFO ] State equation strengthened by 298 read => feed constraints.
[2024-06-01 08:21:00] [INFO ] Implicit Places using invariants and state equation in 4099 ms returned []
Implicit Place search using SMT with State Equation took 4959 ms to find 0 implicit places.
Running 2376 sub problems to find dead transitions.
[2024-06-01 08:21:00] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2024-06-01 08:21:00] [INFO ] Invariant cache hit.
[2024-06-01 08:21:00] [INFO ] State equation strengthened by 298 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 1.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 1.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2376 unsolved
SMT process timed out in 31659ms, After SMT, problems are : Problem set: 0 solved, 2376 unsolved
Search for dead transitions found 0 dead transitions in 31690ms
Starting structural reductions in LTL mode, iteration 1 : 658/663 places, 2384/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36717 ms. Remains : 658/663 places, 2384/2424 transitions.
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), true, (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-00 finished in 37161 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(G(p0)))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 62 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-06-01 08:21:32] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2024-06-01 08:21:32] [INFO ] Computed 25 invariants in 6 ms
[2024-06-01 08:21:33] [INFO ] Implicit Places using invariants in 759 ms returned []
[2024-06-01 08:21:33] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-06-01 08:21:33] [INFO ] Invariant cache hit.
[2024-06-01 08:21:33] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:21:37] [INFO ] Implicit Places using invariants and state equation in 3981 ms returned []
Implicit Place search using SMT with State Equation took 4743 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2024-06-01 08:21:37] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-06-01 08:21:37] [INFO ] Invariant cache hit.
[2024-06-01 08:21:37] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)timeout
(s57 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31726ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31754ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36566 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-02 finished in 36681 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)))'
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 422 place count 449 transition count 2168
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 449 transition count 2168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 393 transition count 2112
Applied a total of 540 rules in 423 ms. Remains 393 /663 variables (removed 270) and now considering 2112/2424 (removed 312) transitions.
[2024-06-01 08:22:09] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-06-01 08:22:09] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 08:22:09] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-06-01 08:22:09] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:22:09] [INFO ] Invariant cache hit.
[2024-06-01 08:22:10] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-06-01 08:22:12] [INFO ] Implicit Places using invariants and state equation in 2442 ms returned []
Implicit Place search using SMT with State Equation took 3050 ms to find 0 implicit places.
[2024-06-01 08:22:12] [INFO ] Redundant transitions in 153 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-06-01 08:22:12] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:22:12] [INFO ] Invariant cache hit.
[2024-06-01 08:22:12] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 08:22:33] [INFO ] Deduced a trap composed of 3 places in 378 ms of which 4 ms to minimize.
[2024-06-01 08:22:33] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 3 ms to minimize.
[2024-06-01 08:22:34] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 2 ms to minimize.
[2024-06-01 08:22:34] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 2 ms to minimize.
[2024-06-01 08:22:34] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:22:34] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:22:34] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:22:34] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 3 ms to minimize.
[2024-06-01 08:22:35] [INFO ] Deduced a trap composed of 76 places in 227 ms of which 3 ms to minimize.
[2024-06-01 08:22:35] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 3 ms to minimize.
[2024-06-01 08:22:36] [INFO ] Deduced a trap composed of 70 places in 268 ms of which 4 ms to minimize.
[2024-06-01 08:22:37] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 3 ms to minimize.
[2024-06-01 08:22:37] [INFO ] Deduced a trap composed of 89 places in 250 ms of which 3 ms to minimize.
[2024-06-01 08:22:37] [INFO ] Deduced a trap composed of 37 places in 276 ms of which 4 ms to minimize.
[2024-06-01 08:22:38] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 3 ms to minimize.
[2024-06-01 08:22:38] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2024-06-01 08:22:38] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2024-06-01 08:22:38] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-06-01 08:22:38] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-06-01 08:22:38] [INFO ] Deduced a trap composed of 73 places in 327 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 08:22:40] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-06-01 08:22:41] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 3 ms to minimize.
[2024-06-01 08:22:42] [INFO ] Deduced a trap composed of 50 places in 251 ms of which 3 ms to minimize.
[2024-06-01 08:22:43] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/1057 variables, and 49 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 08:22:48] [INFO ] Deduced a trap composed of 71 places in 239 ms of which 4 ms to minimize.
[2024-06-01 08:22:48] [INFO ] Deduced a trap composed of 62 places in 227 ms of which 3 ms to minimize.
[2024-06-01 08:22:49] [INFO ] Deduced a trap composed of 80 places in 279 ms of which 3 ms to minimize.
[2024-06-01 08:22:49] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 4 ms to minimize.
[2024-06-01 08:22:49] [INFO ] Deduced a trap composed of 25 places in 289 ms of which 3 ms to minimize.
[2024-06-01 08:22:50] [INFO ] Deduced a trap composed of 26 places in 308 ms of which 3 ms to minimize.
[2024-06-01 08:22:51] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:22:51] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-01 08:22:51] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-06-01 08:22:51] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:22:52] [INFO ] Deduced a trap composed of 45 places in 311 ms of which 4 ms to minimize.
[2024-06-01 08:22:52] [INFO ] Deduced a trap composed of 29 places in 318 ms of which 4 ms to minimize.
[2024-06-01 08:22:52] [INFO ] Deduced a trap composed of 27 places in 315 ms of which 3 ms to minimize.
[2024-06-01 08:22:53] [INFO ] Deduced a trap composed of 51 places in 347 ms of which 3 ms to minimize.
[2024-06-01 08:22:53] [INFO ] Deduced a trap composed of 45 places in 310 ms of which 4 ms to minimize.
[2024-06-01 08:22:53] [INFO ] Deduced a trap composed of 61 places in 297 ms of which 3 ms to minimize.
[2024-06-01 08:22:54] [INFO ] Deduced a trap composed of 65 places in 362 ms of which 3 ms to minimize.
[2024-06-01 08:22:54] [INFO ] Deduced a trap composed of 18 places in 306 ms of which 4 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 60 places in 344 ms of which 3 ms to minimize.
[2024-06-01 08:22:55] [INFO ] Deduced a trap composed of 59 places in 393 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 08:23:03] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 3 ms to minimize.
[2024-06-01 08:23:06] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 3 ms to minimize.
[2024-06-01 08:23:09] [INFO ] Deduced a trap composed of 17 places in 287 ms of which 4 ms to minimize.
[2024-06-01 08:23:10] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-06-01 08:23:13] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/1057 variables, and 74 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 49/49 constraints]
After SMT, in 61509ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 61533ms
Starting structural reductions in SI_LTL mode, iteration 1 : 393/663 places, 2112/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65171 ms. Remains : 393/663 places, 2112/2424 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-03
Product exploration explored 100000 steps with 641 reset in 461 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-03 finished in 65736 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)))'
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 422 place count 449 transition count 2168
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 449 transition count 2168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 393 transition count 2112
Applied a total of 540 rules in 196 ms. Remains 393 /663 variables (removed 270) and now considering 2112/2424 (removed 312) transitions.
[2024-06-01 08:23:14] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-06-01 08:23:14] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 08:23:15] [INFO ] Implicit Places using invariants in 870 ms returned []
[2024-06-01 08:23:15] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:23:15] [INFO ] Invariant cache hit.
[2024-06-01 08:23:16] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-06-01 08:23:18] [INFO ] Implicit Places using invariants and state equation in 2391 ms returned []
Implicit Place search using SMT with State Equation took 3264 ms to find 0 implicit places.
[2024-06-01 08:23:18] [INFO ] Redundant transitions in 61 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-06-01 08:23:18] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:23:18] [INFO ] Invariant cache hit.
[2024-06-01 08:23:18] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 08:23:39] [INFO ] Deduced a trap composed of 3 places in 391 ms of which 4 ms to minimize.
[2024-06-01 08:23:39] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 2 ms to minimize.
[2024-06-01 08:23:39] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
[2024-06-01 08:23:39] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2024-06-01 08:23:40] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:23:40] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:23:40] [INFO ] Deduced a trap composed of 60 places in 205 ms of which 3 ms to minimize.
[2024-06-01 08:23:40] [INFO ] Deduced a trap composed of 77 places in 232 ms of which 3 ms to minimize.
[2024-06-01 08:23:42] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 3 ms to minimize.
[2024-06-01 08:23:42] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 3 ms to minimize.
[2024-06-01 08:23:42] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 2 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 3 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 3 ms to minimize.
[2024-06-01 08:23:43] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:23:44] [INFO ] Deduced a trap composed of 76 places in 290 ms of which 4 ms to minimize.
[2024-06-01 08:23:44] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 3 ms to minimize.
[2024-06-01 08:23:44] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-06-01 08:23:44] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 3 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 68 places in 311 ms of which 3 ms to minimize.
[2024-06-01 08:23:45] [INFO ] Deduced a trap composed of 47 places in 312 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
(s34 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/1057 variables, and 45 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 08:23:56] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:23:58] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 2 ms to minimize.
[2024-06-01 08:23:59] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 2 ms to minimize.
[2024-06-01 08:24:02] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:24:05] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:24:08] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-06-01 08:24:11] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:24:15] [INFO ] Deduced a trap composed of 21 places in 395 ms of which 4 ms to minimize.
[2024-06-01 08:24:16] [INFO ] Deduced a trap composed of 22 places in 411 ms of which 4 ms to minimize.
[2024-06-01 08:24:16] [INFO ] Deduced a trap composed of 19 places in 397 ms of which 4 ms to minimize.
[2024-06-01 08:24:17] [INFO ] Deduced a trap composed of 17 places in 405 ms of which 3 ms to minimize.
[2024-06-01 08:24:17] [INFO ] Deduced a trap composed of 23 places in 391 ms of which 4 ms to minimize.
[2024-06-01 08:24:18] [INFO ] Deduced a trap composed of 17 places in 373 ms of which 3 ms to minimize.
[2024-06-01 08:24:18] [INFO ] Deduced a trap composed of 28 places in 362 ms of which 4 ms to minimize.
[2024-06-01 08:24:18] [INFO ] Deduced a trap composed of 25 places in 354 ms of which 3 ms to minimize.
[2024-06-01 08:24:19] [INFO ] Deduced a trap composed of 26 places in 365 ms of which 4 ms to minimize.
[2024-06-01 08:24:19] [INFO ] Deduced a trap composed of 23 places in 357 ms of which 4 ms to minimize.
[2024-06-01 08:24:19] [INFO ] Deduced a trap composed of 21 places in 358 ms of which 3 ms to minimize.
SMT process timed out in 61730ms, After SMT, problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 61753ms
Starting structural reductions in SI_LTL mode, iteration 1 : 393/663 places, 2112/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65286 ms. Remains : 393/663 places, 2112/2424 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 298 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 18 in 55 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-04 finished in 65734 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 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 423 place count 448 transition count 2160
Iterating global reduction 2 with 7 rules applied. Total rules applied 430 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 542 place count 392 transition count 2104
Applied a total of 542 rules in 158 ms. Remains 392 /663 variables (removed 271) and now considering 2104/2424 (removed 320) transitions.
[2024-06-01 08:24:20] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-06-01 08:24:20] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 08:24:21] [INFO ] Implicit Places using invariants in 703 ms returned []
[2024-06-01 08:24:21] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:24:21] [INFO ] Invariant cache hit.
[2024-06-01 08:24:21] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:24:23] [INFO ] Implicit Places using invariants and state equation in 2436 ms returned []
Implicit Place search using SMT with State Equation took 3142 ms to find 0 implicit places.
[2024-06-01 08:24:23] [INFO ] Redundant transitions in 61 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-06-01 08:24:23] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:24:23] [INFO ] Invariant cache hit.
[2024-06-01 08:24:23] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:24:45] [INFO ] Deduced a trap composed of 3 places in 367 ms of which 4 ms to minimize.
[2024-06-01 08:24:45] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 2 ms to minimize.
[2024-06-01 08:24:45] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 08:24:45] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
[2024-06-01 08:24:45] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:24:45] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:24:45] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 3 ms to minimize.
[2024-06-01 08:24:46] [INFO ] Deduced a trap composed of 71 places in 219 ms of which 3 ms to minimize.
[2024-06-01 08:24:46] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 3 ms to minimize.
[2024-06-01 08:24:46] [INFO ] Deduced a trap composed of 61 places in 229 ms of which 3 ms to minimize.
[2024-06-01 08:24:46] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 3 ms to minimize.
[2024-06-01 08:24:47] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 4 ms to minimize.
[2024-06-01 08:24:47] [INFO ] Deduced a trap composed of 29 places in 264 ms of which 3 ms to minimize.
[2024-06-01 08:24:47] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 2 ms to minimize.
[2024-06-01 08:24:47] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 3 ms to minimize.
[2024-06-01 08:24:48] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 3 ms to minimize.
[2024-06-01 08:24:48] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 2 ms to minimize.
[2024-06-01 08:24:48] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-06-01 08:24:49] [INFO ] Deduced a trap composed of 48 places in 300 ms of which 4 ms to minimize.
[2024-06-01 08:24:50] [INFO ] Deduced a trap composed of 15 places in 309 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:24:51] [INFO ] Deduced a trap composed of 76 places in 228 ms of which 3 ms to minimize.
[2024-06-01 08:24:52] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 3 ms to minimize.
[2024-06-01 08:24:52] [INFO ] Deduced a trap composed of 48 places in 258 ms of which 3 ms to minimize.
[2024-06-01 08:24:53] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 3 ms to minimize.
[2024-06-01 08:24:53] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 3 ms to minimize.
[2024-06-01 08:24:53] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 4 ms to minimize.
[2024-06-01 08:24:54] [INFO ] Deduced a trap composed of 49 places in 258 ms of which 3 ms to minimize.
[2024-06-01 08:24:54] [INFO ] Deduced a trap composed of 45 places in 261 ms of which 3 ms to minimize.
[2024-06-01 08:24:54] [INFO ] Deduced a trap composed of 71 places in 254 ms of which 3 ms to minimize.
[2024-06-01 08:24:54] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 3 ms to minimize.
[2024-06-01 08:24:55] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 3 ms to minimize.
SMT process timed out in 31459ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31481ms
Starting structural reductions in SI_LTL mode, iteration 1 : 392/663 places, 2104/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34854 ms. Remains : 392/663 places, 2104/2424 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 246 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-07 finished in 35156 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 U (p1||G(!p0))))))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 421 place count 450 transition count 2176
Iterating global reduction 2 with 5 rules applied. Total rules applied 426 place count 450 transition count 2176
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 538 place count 394 transition count 2120
Applied a total of 538 rules in 155 ms. Remains 394 /663 variables (removed 269) and now considering 2120/2424 (removed 304) transitions.
[2024-06-01 08:24:55] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
// Phase 1: matrix 672 rows 394 cols
[2024-06-01 08:24:55] [INFO ] Computed 25 invariants in 3 ms
[2024-06-01 08:24:56] [INFO ] Implicit Places using invariants in 720 ms returned []
[2024-06-01 08:24:56] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
[2024-06-01 08:24:56] [INFO ] Invariant cache hit.
[2024-06-01 08:24:56] [INFO ] State equation strengthened by 298 read => feed constraints.
[2024-06-01 08:24:58] [INFO ] Implicit Places using invariants and state equation in 2338 ms returned []
Implicit Place search using SMT with State Equation took 3060 ms to find 0 implicit places.
[2024-06-01 08:24:58] [INFO ] Redundant transitions in 56 ms returned []
Running 2112 sub problems to find dead transitions.
[2024-06-01 08:24:58] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
[2024-06-01 08:24:58] [INFO ] Invariant cache hit.
[2024-06-01 08:24:58] [INFO ] State equation strengthened by 298 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 3 places in 386 ms of which 6 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 3 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 3 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-06-01 08:25:21] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:25:22] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 2 ms to minimize.
[2024-06-01 08:25:22] [INFO ] Deduced a trap composed of 75 places in 227 ms of which 3 ms to minimize.
[2024-06-01 08:25:24] [INFO ] Deduced a trap composed of 54 places in 221 ms of which 3 ms to minimize.
[2024-06-01 08:25:24] [INFO ] Deduced a trap composed of 50 places in 232 ms of which 3 ms to minimize.
[2024-06-01 08:25:24] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 3 ms to minimize.
[2024-06-01 08:25:24] [INFO ] Deduced a trap composed of 52 places in 228 ms of which 5 ms to minimize.
[2024-06-01 08:25:25] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 3 ms to minimize.
[2024-06-01 08:25:25] [INFO ] Deduced a trap composed of 69 places in 283 ms of which 3 ms to minimize.
[2024-06-01 08:25:26] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 3 ms to minimize.
[2024-06-01 08:25:26] [INFO ] Deduced a trap composed of 45 places in 230 ms of which 3 ms to minimize.
[2024-06-01 08:25:26] [INFO ] Deduced a trap composed of 78 places in 261 ms of which 3 ms to minimize.
[2024-06-01 08:25:26] [INFO ] Deduced a trap composed of 71 places in 229 ms of which 4 ms to minimize.
[2024-06-01 08:25:27] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:25:27] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1066 variables, and 45 constraints, problems are : Problem set: 0 solved, 2112 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/298 constraints, PredecessorRefiner: 2112/2112 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
[2024-06-01 08:25:38] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 4 ms to minimize.
[2024-06-01 08:25:38] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:25:39] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 3 ms to minimize.
[2024-06-01 08:25:39] [INFO ] Deduced a trap composed of 60 places in 239 ms of which 3 ms to minimize.
[2024-06-01 08:25:39] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 3 ms to minimize.
[2024-06-01 08:25:39] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 3 ms to minimize.
[2024-06-01 08:25:40] [INFO ] Deduced a trap composed of 52 places in 229 ms of which 4 ms to minimize.
[2024-06-01 08:25:40] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:25:41] [INFO ] Deduced a trap composed of 61 places in 245 ms of which 3 ms to minimize.
[2024-06-01 08:25:41] [INFO ] Deduced a trap composed of 60 places in 251 ms of which 3 ms to minimize.
[2024-06-01 08:25:41] [INFO ] Deduced a trap composed of 58 places in 248 ms of which 3 ms to minimize.
[2024-06-01 08:25:43] [INFO ] Deduced a trap composed of 74 places in 251 ms of which 3 ms to minimize.
[2024-06-01 08:25:43] [INFO ] Deduced a trap composed of 59 places in 319 ms of which 3 ms to minimize.
[2024-06-01 08:25:44] [INFO ] Deduced a trap composed of 70 places in 289 ms of which 3 ms to minimize.
[2024-06-01 08:25:44] [INFO ] Deduced a trap composed of 71 places in 286 ms of which 3 ms to minimize.
[2024-06-01 08:25:44] [INFO ] Deduced a trap composed of 72 places in 303 ms of which 4 ms to minimize.
[2024-06-01 08:25:44] [INFO ] Deduced a trap composed of 58 places in 300 ms of which 4 ms to minimize.
[2024-06-01 08:25:45] [INFO ] Deduced a trap composed of 70 places in 240 ms of which 3 ms to minimize.
[2024-06-01 08:25:45] [INFO ] Deduced a trap composed of 69 places in 285 ms of which 3 ms to minimize.
[2024-06-01 08:25:46] [INFO ] Deduced a trap composed of 48 places in 281 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
[2024-06-01 08:25:47] [INFO ] Deduced a trap composed of 73 places in 341 ms of which 4 ms to minimize.
[2024-06-01 08:25:47] [INFO ] Deduced a trap composed of 62 places in 223 ms of which 3 ms to minimize.
[2024-06-01 08:25:48] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 3 ms to minimize.
[2024-06-01 08:25:48] [INFO ] Deduced a trap composed of 28 places in 275 ms of which 3 ms to minimize.
[2024-06-01 08:25:48] [INFO ] Deduced a trap composed of 77 places in 283 ms of which 3 ms to minimize.
[2024-06-01 08:25:49] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 3 ms to minimize.
[2024-06-01 08:25:50] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-01 08:25:50] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-06-01 08:25:50] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:25:50] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-06-01 08:25:51] [INFO ] Deduced a trap composed of 68 places in 294 ms of which 3 ms to minimize.
[2024-06-01 08:25:51] [INFO ] Deduced a trap composed of 62 places in 231 ms of which 3 ms to minimize.
[2024-06-01 08:25:51] [INFO ] Deduced a trap composed of 62 places in 249 ms of which 3 ms to minimize.
[2024-06-01 08:25:52] [INFO ] Deduced a trap composed of 13 places in 358 ms of which 3 ms to minimize.
[2024-06-01 08:25:52] [INFO ] Deduced a trap composed of 67 places in 303 ms of which 3 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 27 places in 311 ms of which 3 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 3 ms to minimize.
[2024-06-01 08:25:53] [INFO ] Deduced a trap composed of 24 places in 340 ms of which 3 ms to minimize.
[2024-06-01 08:25:54] [INFO ] Deduced a trap composed of 78 places in 373 ms of which 4 ms to minimize.
[2024-06-01 08:25:55] [INFO ] Deduced a trap composed of 79 places in 332 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1066 variables, and 85 constraints, problems are : Problem set: 0 solved, 2112 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/298 constraints, PredecessorRefiner: 0/2112 constraints, Known Traps: 60/60 constraints]
After SMT, in 61443ms problems are : Problem set: 0 solved, 2112 unsolved
Search for dead transitions found 0 dead transitions in 61466ms
Starting structural reductions in SI_LTL mode, iteration 1 : 394/663 places, 2120/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64749 ms. Remains : 394/663 places, 2120/2424 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 287 ms.
Stack based approach found an accepted trace after 433 steps with 0 reset with depth 434 and stack size 387 in 2 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-09 finished in 65145 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(p1)&&p0) U X(G(p2))))'
Support contains 8 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 32 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-06-01 08:26:00] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2024-06-01 08:26:00] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 08:26:01] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-06-01 08:26:01] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-06-01 08:26:01] [INFO ] Invariant cache hit.
[2024-06-01 08:26:01] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:26:05] [INFO ] Implicit Places using invariants and state equation in 4043 ms returned []
Implicit Place search using SMT with State Equation took 4754 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2024-06-01 08:26:05] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-06-01 08:26:05] [INFO ] Invariant cache hit.
[2024-06-01 08:26:05] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31583ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31608ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36399 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-10
Entered a terminal (fully accepting) state of product in 411 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-10 finished in 36596 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(p0)||(G(!p1) U p0)))))'
Support contains 6 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 31 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-06-01 08:26:37] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-06-01 08:26:37] [INFO ] Invariant cache hit.
[2024-06-01 08:26:38] [INFO ] Implicit Places using invariants in 778 ms returned []
[2024-06-01 08:26:38] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-06-01 08:26:38] [INFO ] Invariant cache hit.
[2024-06-01 08:26:38] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:26:42] [INFO ] Implicit Places using invariants and state equation in 4624 ms returned []
Implicit Place search using SMT with State Equation took 5403 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2024-06-01 08:26:42] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-06-01 08:26:42] [INFO ] Invariant cache hit.
[2024-06-01 08:26:42] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31518ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31547ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36986 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 241 ms.
Product exploration explored 100000 steps with 0 reset in 357 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
RANDOM walk for 40000 steps (8 resets) in 772 ms. (51 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 127971 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 4
Probabilistic random walk after 127971 steps, saw 93936 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2024-06-01 08:27:19] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-06-01 08:27:19] [INFO ] Invariant cache hit.
[2024-06-01 08:27:19] [INFO ] State equation strengthened by 284 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) 216/222 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/246 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 61/307 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:27:19] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 25/332 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:27:19] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 516/848 variables, 332/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/848 variables, 84/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/848 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 88/936 variables, 40/471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/936 variables, 22/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 276/1212 variables, 8/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1212 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 8/1220 variables, 4/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1220 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 356/1576 variables, 284/789 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1576 variables, 178/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1576 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/1576 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1576/1576 variables, and 967 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1685 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 656/656 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 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) 216/222 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/246 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 61/307 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:27:21] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 1 ms to minimize.
[2024-06-01 08:27:21] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:27:21] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 25/332 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 516/848 variables, 332/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/848 variables, 84/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/848 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 88/936 variables, 40/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 22/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:27:21] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/936 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/936 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 276/1212 variables, 8/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1212 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 8/1220 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1220 variables, 4/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:27:22] [INFO ] Deduced a trap composed of 3 places in 474 ms of which 6 ms to minimize.
[2024-06-01 08:27:23] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2024-06-01 08:27:23] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:27:23] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:27:23] [INFO ] Deduced a trap composed of 103 places in 252 ms of which 3 ms to minimize.
[2024-06-01 08:27:23] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 3 ms to minimize.
[2024-06-01 08:27:24] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1220 variables, 7/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1220 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 356/1576 variables, 284/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1576 variables, 178/982 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1576 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/1576 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1576/1576 variables, and 982 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4394 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 656/656 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 13/13 constraints]
After SMT, in 6116ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2367 ms.
Support contains 6 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 162 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 392/656 places, 2104/2368 transitions.
RANDOM walk for 40000 steps (8 resets) in 333 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 145656 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 4
Probabilistic random walk after 145656 steps, saw 90245 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2024-06-01 08:27:31] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-06-01 08:27:31] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 08:27:31] [INFO ] State equation strengthened by 284 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) 132/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/147 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 43/190 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:27:31] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 10/200 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:27:31] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 384/584 variables, 200/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 84/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/584 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 88/672 variables, 40/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/672 variables, 25/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/672 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 143/815 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/815 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/817 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/817 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 7/824 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/824 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 224/1048 variables, 152/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 175/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1185 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 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) 132/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/147 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 43/190 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:27:32] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:27:32] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:27:32] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:27:32] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 10/200 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 384/584 variables, 200/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/584 variables, 84/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/584 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 88/672 variables, 40/343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/672 variables, 25/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/672 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 143/815 variables, 7/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/815 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/817 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/817 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 7/824 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/824 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:27:33] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-06-01 08:27:33] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/824 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/824 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 224/1048 variables, 152/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 175/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:27:34] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1048 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1048 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/1048 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 714 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2228 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 3437ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1623 ms.
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 73 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 70 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 08:27:36] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:27:36] [INFO ] Invariant cache hit.
[2024-06-01 08:27:36] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-06-01 08:27:36] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:27:36] [INFO ] Invariant cache hit.
[2024-06-01 08:27:37] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:27:39] [INFO ] Implicit Places using invariants and state equation in 2308 ms returned []
Implicit Place search using SMT with State Equation took 2959 ms to find 0 implicit places.
[2024-06-01 08:27:39] [INFO ] Redundant transitions in 55 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-06-01 08:27:39] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:27:39] [INFO ] Invariant cache hit.
[2024-06-01 08:27:39] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 3 places in 370 ms of which 4 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 3 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 2 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:28:00] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 3 ms to minimize.
[2024-06-01 08:28:01] [INFO ] Deduced a trap composed of 71 places in 234 ms of which 3 ms to minimize.
[2024-06-01 08:28:01] [INFO ] Deduced a trap composed of 124 places in 256 ms of which 4 ms to minimize.
[2024-06-01 08:28:01] [INFO ] Deduced a trap composed of 41 places in 294 ms of which 3 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 25 places in 305 ms of which 3 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 2 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 62 places in 243 ms of which 3 ms to minimize.
[2024-06-01 08:28:02] [INFO ] Deduced a trap composed of 27 places in 275 ms of which 3 ms to minimize.
[2024-06-01 08:28:03] [INFO ] Deduced a trap composed of 30 places in 268 ms of which 3 ms to minimize.
[2024-06-01 08:28:04] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:28:04] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:28:04] [INFO ] Deduced a trap composed of 11 places in 349 ms of which 4 ms to minimize.
[2024-06-01 08:28:05] [INFO ] Deduced a trap composed of 74 places in 334 ms of which 3 ms to minimize.
[2024-06-01 08:28:05] [INFO ] Deduced a trap composed of 61 places in 306 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:28:08] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 3 ms to minimize.
[2024-06-01 08:28:08] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 3 ms to minimize.
[2024-06-01 08:28:08] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 3 ms to minimize.
[2024-06-01 08:28:08] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 3 ms to minimize.
[2024-06-01 08:28:09] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 3 ms to minimize.
[2024-06-01 08:28:09] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:28:10] [INFO ] Deduced a trap composed of 43 places in 280 ms of which 4 ms to minimize.
[2024-06-01 08:28:10] [INFO ] Deduced a trap composed of 63 places in 195 ms of which 3 ms to minimize.
[2024-06-01 08:28:10] [INFO ] Deduced a trap composed of 69 places in 230 ms of which 3 ms to minimize.
SMT process timed out in 31485ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31507ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34604 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1916 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 3 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 336 transition count 411
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 259 transition count 411
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 155 place count 259 transition count 394
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 197 place count 234 transition count 394
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 417 place count 124 transition count 284
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 2 with 52 rules applied. Total rules applied 469 place count 124 transition count 232
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 483 place count 117 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 490 place count 117 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 499 place count 117 transition count 216
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 557 place count 117 transition count 158
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 615 place count 59 transition count 158
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 623 place count 59 transition count 158
Applied a total of 623 rules in 66 ms. Remains 59 /392 variables (removed 333) and now considering 158/2104 (removed 1946) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 158 rows 59 cols
[2024-06-01 08:28:10] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 08:28:10] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-06-01 08:28:11] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 08:28:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-06-01 08:28:11] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 08:28:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 08:28:11] [INFO ] After 43ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 08:28:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:28:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-06-01 08:28:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:28:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:28:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
TRAPS : Iteration 1
[2024-06-01 08:28:11] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 08:28:11] [INFO ] After 560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 782 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
[2024-06-01 08:28:12] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2024-06-01 08:28:12] [INFO ] Computed 25 invariants in 5 ms
[2024-06-01 08:28:13] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-06-01 08:28:14] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 36 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-11 finished in 96908 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(G(p0)))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 70 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-06-01 08:28:14] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-06-01 08:28:14] [INFO ] Invariant cache hit.
[2024-06-01 08:28:15] [INFO ] Implicit Places using invariants in 801 ms returned []
[2024-06-01 08:28:15] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-06-01 08:28:15] [INFO ] Invariant cache hit.
[2024-06-01 08:28:15] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:28:18] [INFO ] Implicit Places using invariants and state equation in 3836 ms returned []
Implicit Place search using SMT with State Equation took 4640 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2024-06-01 08:28:18] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-06-01 08:28:18] [INFO ] Invariant cache hit.
[2024-06-01 08:28:18] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31543ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31574ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36290 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 307 ms.
Product exploration explored 100000 steps with 0 reset in 306 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 372006 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 372006 steps, saw 260489 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-06-01 08:28:54] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-06-01 08:28:54] [INFO ] Invariant cache hit.
[2024-06-01 08:28:54] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/145 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:28:54] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/170 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:28:54] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 314/484 variables, 170/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 30/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/616 variables, 60/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/616 variables, 22/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/616 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 414/1030 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1030 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1042 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1042 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 534/1576 variables, 426/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1576 variables, 232/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1576 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1576 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1576/1576 variables, and 967 constraints, problems are : Problem set: 0 solved, 1 unsolved in 806 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 656/656 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/145 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/170 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 314/484 variables, 170/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 30/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/616 variables, 60/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/616 variables, 22/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/616 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 414/1030 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1030 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1042 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1042 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:28:56] [INFO ] Deduced a trap composed of 3 places in 606 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1042 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:28:56] [INFO ] Deduced a trap composed of 114 places in 539 ms of which 5 ms to minimize.
[2024-06-01 08:28:57] [INFO ] Deduced a trap composed of 142 places in 567 ms of which 5 ms to minimize.
[2024-06-01 08:28:57] [INFO ] Deduced a trap composed of 121 places in 556 ms of which 5 ms to minimize.
[2024-06-01 08:28:58] [INFO ] Deduced a trap composed of 129 places in 561 ms of which 6 ms to minimize.
[2024-06-01 08:28:59] [INFO ] Deduced a trap composed of 130 places in 482 ms of which 5 ms to minimize.
[2024-06-01 08:28:59] [INFO ] Deduced a trap composed of 135 places in 559 ms of which 6 ms to minimize.
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 115 places in 466 ms of which 5 ms to minimize.
[2024-06-01 08:29:00] [INFO ] Deduced a trap composed of 100 places in 440 ms of which 6 ms to minimize.
SMT process timed out in 6177ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 177 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 392/656 places, 2104/2368 transitions.
RANDOM walk for 40000 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 400653 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 400653 steps, saw 219769 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
[2024-06-01 08:29:03] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-06-01 08:29:03] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 08:29:03] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:29:03] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:29:04] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 593 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:29:05] [INFO ] Deduced a trap composed of 8 places in 396 ms of which 3 ms to minimize.
[2024-06-01 08:29:05] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 2 ms to minimize.
[2024-06-01 08:29:05] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 3 ms to minimize.
[2024-06-01 08:29:05] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 2 ms to minimize.
[2024-06-01 08:29:05] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 2 ms to minimize.
[2024-06-01 08:29:06] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 6/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:29:06] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/712 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 336/1048 variables, 228/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 227/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 711 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2114 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 2728ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 73 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 73 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 08:29:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:29:06] [INFO ] Invariant cache hit.
[2024-06-01 08:29:07] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-06-01 08:29:07] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:29:07] [INFO ] Invariant cache hit.
[2024-06-01 08:29:07] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:29:09] [INFO ] Implicit Places using invariants and state equation in 2343 ms returned []
Implicit Place search using SMT with State Equation took 3008 ms to find 0 implicit places.
[2024-06-01 08:29:09] [INFO ] Redundant transitions in 55 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-06-01 08:29:09] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:29:09] [INFO ] Invariant cache hit.
[2024-06-01 08:29:09] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:29:31] [INFO ] Deduced a trap composed of 3 places in 373 ms of which 4 ms to minimize.
[2024-06-01 08:29:31] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 2 ms to minimize.
[2024-06-01 08:29:31] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
[2024-06-01 08:29:31] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2024-06-01 08:29:31] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:29:31] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:29:32] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 3 ms to minimize.
[2024-06-01 08:29:32] [INFO ] Deduced a trap composed of 71 places in 236 ms of which 3 ms to minimize.
[2024-06-01 08:29:32] [INFO ] Deduced a trap composed of 124 places in 268 ms of which 3 ms to minimize.
[2024-06-01 08:29:32] [INFO ] Deduced a trap composed of 41 places in 299 ms of which 3 ms to minimize.
[2024-06-01 08:29:33] [INFO ] Deduced a trap composed of 25 places in 285 ms of which 3 ms to minimize.
[2024-06-01 08:29:33] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 3 ms to minimize.
[2024-06-01 08:29:33] [INFO ] Deduced a trap composed of 62 places in 221 ms of which 3 ms to minimize.
[2024-06-01 08:29:33] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 3 ms to minimize.
[2024-06-01 08:29:34] [INFO ] Deduced a trap composed of 30 places in 270 ms of which 3 ms to minimize.
[2024-06-01 08:29:35] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-06-01 08:29:35] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:29:35] [INFO ] Deduced a trap composed of 11 places in 338 ms of which 3 ms to minimize.
[2024-06-01 08:29:36] [INFO ] Deduced a trap composed of 74 places in 332 ms of which 3 ms to minimize.
[2024-06-01 08:29:36] [INFO ] Deduced a trap composed of 61 places in 303 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:29:39] [INFO ] Deduced a trap composed of 45 places in 246 ms of which 3 ms to minimize.
[2024-06-01 08:29:39] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 3 ms to minimize.
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 3 ms to minimize.
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 3 ms to minimize.
[2024-06-01 08:29:40] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 3 ms to minimize.
[2024-06-01 08:29:41] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:29:41] [INFO ] Deduced a trap composed of 43 places in 306 ms of which 3 ms to minimize.
SMT process timed out in 31611ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31633ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34781 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 34 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-06-01 08:29:41] [INFO ] Computed 17 invariants in 4 ms
[2024-06-01 08:29:41] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-06-01 08:29:41] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:29:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-06-01 08:29:41] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:29:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 08:29:41] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:29:41] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:29:41] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 287 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 130 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
[2024-06-01 08:29:42] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-06-01 08:29:42] [INFO ] Computed 25 invariants in 3 ms
[2024-06-01 08:29:42] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-06-01 08:29:42] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:29:42] [INFO ] Invariant cache hit.
[2024-06-01 08:29:43] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:29:45] [INFO ] Implicit Places using invariants and state equation in 2417 ms returned []
Implicit Place search using SMT with State Equation took 3085 ms to find 0 implicit places.
[2024-06-01 08:29:45] [INFO ] Redundant transitions in 61 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-06-01 08:29:45] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:29:45] [INFO ] Invariant cache hit.
[2024-06-01 08:29:45] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:30:06] [INFO ] Deduced a trap composed of 3 places in 369 ms of which 4 ms to minimize.
[2024-06-01 08:30:06] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 2 ms to minimize.
[2024-06-01 08:30:06] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 2 ms to minimize.
[2024-06-01 08:30:06] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
[2024-06-01 08:30:06] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:30:06] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 3 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 71 places in 189 ms of which 3 ms to minimize.
[2024-06-01 08:30:07] [INFO ] Deduced a trap composed of 124 places in 269 ms of which 3 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 41 places in 296 ms of which 3 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 3 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 3 ms to minimize.
[2024-06-01 08:30:08] [INFO ] Deduced a trap composed of 62 places in 241 ms of which 3 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 27 places in 365 ms of which 3 ms to minimize.
[2024-06-01 08:30:09] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 3 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:30:10] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-06-01 08:30:11] [INFO ] Deduced a trap composed of 11 places in 342 ms of which 3 ms to minimize.
[2024-06-01 08:30:11] [INFO ] Deduced a trap composed of 74 places in 341 ms of which 4 ms to minimize.
[2024-06-01 08:30:11] [INFO ] Deduced a trap composed of 61 places in 283 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:30:14] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 3 ms to minimize.
[2024-06-01 08:30:14] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 3 ms to minimize.
[2024-06-01 08:30:14] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 3 ms to minimize.
[2024-06-01 08:30:15] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 3 ms to minimize.
[2024-06-01 08:30:15] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 3 ms to minimize.
[2024-06-01 08:30:15] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:30:16] [INFO ] Deduced a trap composed of 43 places in 287 ms of which 3 ms to minimize.
[2024-06-01 08:30:16] [INFO ] Deduced a trap composed of 63 places in 216 ms of which 3 ms to minimize.
SMT process timed out in 31402ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31425ms
Starting structural reductions in SI_LTL mode, iteration 1 : 392/656 places, 2104/2368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34712 ms. Remains : 392/656 places, 2104/2368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 405324 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 1
Probabilistic random walk after 405324 steps, saw 222234 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
[2024-06-01 08:30:19] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:30:19] [INFO ] Invariant cache hit.
[2024-06-01 08:30:19] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:30:19] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:30:20] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:30:20] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 3 ms to minimize.
[2024-06-01 08:30:21] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 2 ms to minimize.
[2024-06-01 08:30:21] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 4 ms to minimize.
[2024-06-01 08:30:21] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:30:21] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 709 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1324 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1920ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 68 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 406917 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 1
Probabilistic random walk after 406917 steps, saw 222612 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
[2024-06-01 08:30:25] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:30:25] [INFO ] Invariant cache hit.
[2024-06-01 08:30:25] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:30:25] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:30:25] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:30:26] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 2 ms to minimize.
[2024-06-01 08:30:26] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 2 ms to minimize.
[2024-06-01 08:30:26] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2024-06-01 08:30:26] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:30:26] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 709 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1906ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 68 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 69 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 08:30:27] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:30:27] [INFO ] Invariant cache hit.
[2024-06-01 08:30:27] [INFO ] Implicit Places using invariants in 591 ms returned []
[2024-06-01 08:30:27] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:30:27] [INFO ] Invariant cache hit.
[2024-06-01 08:30:28] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:30:30] [INFO ] Implicit Places using invariants and state equation in 2366 ms returned []
Implicit Place search using SMT with State Equation took 2959 ms to find 0 implicit places.
[2024-06-01 08:30:30] [INFO ] Redundant transitions in 56 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-06-01 08:30:30] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:30:30] [INFO ] Invariant cache hit.
[2024-06-01 08:30:30] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:30:50] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 3 ms to minimize.
[2024-06-01 08:30:51] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 2 ms to minimize.
[2024-06-01 08:30:51] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 08:30:51] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-06-01 08:30:51] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:30:51] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:30:51] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 3 ms to minimize.
[2024-06-01 08:30:52] [INFO ] Deduced a trap composed of 71 places in 241 ms of which 3 ms to minimize.
[2024-06-01 08:30:52] [INFO ] Deduced a trap composed of 124 places in 273 ms of which 4 ms to minimize.
[2024-06-01 08:30:52] [INFO ] Deduced a trap composed of 41 places in 293 ms of which 4 ms to minimize.
[2024-06-01 08:30:52] [INFO ] Deduced a trap composed of 25 places in 314 ms of which 3 ms to minimize.
[2024-06-01 08:30:53] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 3 ms to minimize.
[2024-06-01 08:30:53] [INFO ] Deduced a trap composed of 62 places in 243 ms of which 3 ms to minimize.
[2024-06-01 08:30:53] [INFO ] Deduced a trap composed of 27 places in 268 ms of which 3 ms to minimize.
[2024-06-01 08:30:54] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 3 ms to minimize.
[2024-06-01 08:30:55] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:30:55] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:30:56] [INFO ] Deduced a trap composed of 11 places in 338 ms of which 3 ms to minimize.
[2024-06-01 08:30:56] [INFO ] Deduced a trap composed of 74 places in 342 ms of which 3 ms to minimize.
[2024-06-01 08:30:56] [INFO ] Deduced a trap composed of 61 places in 299 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:30:59] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 3 ms to minimize.
[2024-06-01 08:30:59] [INFO ] Deduced a trap composed of 45 places in 227 ms of which 3 ms to minimize.
[2024-06-01 08:30:59] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 3 ms to minimize.
[2024-06-01 08:31:00] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 3 ms to minimize.
[2024-06-01 08:31:00] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 3 ms to minimize.
[2024-06-01 08:31:00] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:31:01] [INFO ] Deduced a trap composed of 43 places in 283 ms of which 3 ms to minimize.
[2024-06-01 08:31:01] [INFO ] Deduced a trap composed of 63 places in 215 ms of which 3 ms to minimize.
SMT process timed out in 31538ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31561ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34655 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 46 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-06-01 08:31:01] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 08:31:01] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-06-01 08:31:01] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:31:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-06-01 08:31:01] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:31:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 08:31:01] [INFO ] After 12ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:31:01] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:31:02] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 282 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 275 ms.
Product exploration explored 100000 steps with 0 reset in 326 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 69 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 08:31:02] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-06-01 08:31:02] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 08:31:03] [INFO ] Implicit Places using invariants in 728 ms returned []
[2024-06-01 08:31:03] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:31:03] [INFO ] Invariant cache hit.
[2024-06-01 08:31:04] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:31:06] [INFO ] Implicit Places using invariants and state equation in 2496 ms returned []
Implicit Place search using SMT with State Equation took 3226 ms to find 0 implicit places.
[2024-06-01 08:31:06] [INFO ] Redundant transitions in 56 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-06-01 08:31:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:31:06] [INFO ] Invariant cache hit.
[2024-06-01 08:31:06] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:31:27] [INFO ] Deduced a trap composed of 3 places in 334 ms of which 4 ms to minimize.
[2024-06-01 08:31:27] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 2 ms to minimize.
[2024-06-01 08:31:27] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2024-06-01 08:31:27] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-06-01 08:31:28] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:31:28] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:31:28] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 3 ms to minimize.
[2024-06-01 08:31:28] [INFO ] Deduced a trap composed of 71 places in 238 ms of which 3 ms to minimize.
[2024-06-01 08:31:28] [INFO ] Deduced a trap composed of 124 places in 256 ms of which 4 ms to minimize.
[2024-06-01 08:31:29] [INFO ] Deduced a trap composed of 41 places in 307 ms of which 3 ms to minimize.
[2024-06-01 08:31:29] [INFO ] Deduced a trap composed of 25 places in 300 ms of which 4 ms to minimize.
[2024-06-01 08:31:29] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 4 ms to minimize.
[2024-06-01 08:31:30] [INFO ] Deduced a trap composed of 62 places in 231 ms of which 3 ms to minimize.
[2024-06-01 08:31:30] [INFO ] Deduced a trap composed of 27 places in 277 ms of which 3 ms to minimize.
[2024-06-01 08:31:30] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 3 ms to minimize.
[2024-06-01 08:31:31] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-06-01 08:31:31] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-06-01 08:31:32] [INFO ] Deduced a trap composed of 11 places in 354 ms of which 3 ms to minimize.
[2024-06-01 08:31:32] [INFO ] Deduced a trap composed of 74 places in 332 ms of which 3 ms to minimize.
[2024-06-01 08:31:33] [INFO ] Deduced a trap composed of 61 places in 293 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 3 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 3 ms to minimize.
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 3 ms to minimize.
[2024-06-01 08:31:36] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 3 ms to minimize.
[2024-06-01 08:31:36] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 3 ms to minimize.
[2024-06-01 08:31:36] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-01 08:31:37] [INFO ] Deduced a trap composed of 43 places in 275 ms of which 5 ms to minimize.
[2024-06-01 08:31:37] [INFO ] Deduced a trap composed of 63 places in 215 ms of which 3 ms to minimize.
SMT process timed out in 31488ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31511ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34872 ms. Remains : 392/392 places, 2104/2104 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-12 finished in 203833 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&&(G(p2)||p1)))))'
Support contains 6 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 16 place count 655 transition count 2218
Deduced a syphon composed of 198 places in 3 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 412 place count 457 transition count 2218
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 419 place count 450 transition count 2162
Iterating global reduction 2 with 7 rules applied. Total rules applied 426 place count 450 transition count 2162
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 538 place count 394 transition count 2106
Applied a total of 538 rules in 137 ms. Remains 394 /663 variables (removed 269) and now considering 2106/2424 (removed 318) transitions.
[2024-06-01 08:31:38] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2024-06-01 08:31:38] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 08:31:38] [INFO ] Implicit Places using invariants in 558 ms returned []
[2024-06-01 08:31:38] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:31:38] [INFO ] Invariant cache hit.
[2024-06-01 08:31:39] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:31:41] [INFO ] Implicit Places using invariants and state equation in 2405 ms returned []
Implicit Place search using SMT with State Equation took 2970 ms to find 0 implicit places.
[2024-06-01 08:31:41] [INFO ] Redundant transitions in 74 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-06-01 08:31:41] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:31:41] [INFO ] Invariant cache hit.
[2024-06-01 08:31:41] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-06-01 08:32:02] [INFO ] Deduced a trap composed of 3 places in 347 ms of which 3 ms to minimize.
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 2 ms to minimize.
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 2 ms to minimize.
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 60 places in 189 ms of which 2 ms to minimize.
[2024-06-01 08:32:05] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 3 ms to minimize.
[2024-06-01 08:32:05] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 3 ms to minimize.
[2024-06-01 08:32:05] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 3 ms to minimize.
[2024-06-01 08:32:06] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 3 ms to minimize.
[2024-06-01 08:32:06] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 3 ms to minimize.
[2024-06-01 08:32:06] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:32:06] [INFO ] Deduced a trap composed of 43 places in 256 ms of which 3 ms to minimize.
[2024-06-01 08:32:07] [INFO ] Deduced a trap composed of 76 places in 267 ms of which 3 ms to minimize.
[2024-06-01 08:32:07] [INFO ] Deduced a trap composed of 61 places in 247 ms of which 3 ms to minimize.
[2024-06-01 08:32:07] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:32:08] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 3 ms to minimize.
[2024-06-01 08:32:08] [INFO ] Deduced a trap composed of 16 places in 280 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1052 variables, and 45 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2098/2098 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-06-01 08:32:16] [INFO ] Deduced a trap composed of 70 places in 230 ms of which 3 ms to minimize.
[2024-06-01 08:32:17] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 3 ms to minimize.
[2024-06-01 08:32:17] [INFO ] Deduced a trap composed of 62 places in 231 ms of which 3 ms to minimize.
[2024-06-01 08:32:17] [INFO ] Deduced a trap composed of 27 places in 251 ms of which 3 ms to minimize.
[2024-06-01 08:32:17] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 4 ms to minimize.
[2024-06-01 08:32:18] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 3 ms to minimize.
[2024-06-01 08:32:18] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:32:19] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:32:19] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:32:19] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-01 08:32:19] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-01 08:32:19] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:32:20] [INFO ] Deduced a trap composed of 62 places in 291 ms of which 3 ms to minimize.
[2024-06-01 08:32:20] [INFO ] Deduced a trap composed of 64 places in 288 ms of which 3 ms to minimize.
[2024-06-01 08:32:20] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 3 ms to minimize.
[2024-06-01 08:32:21] [INFO ] Deduced a trap composed of 62 places in 246 ms of which 3 ms to minimize.
[2024-06-01 08:32:21] [INFO ] Deduced a trap composed of 73 places in 305 ms of which 3 ms to minimize.
[2024-06-01 08:32:21] [INFO ] Deduced a trap composed of 87 places in 294 ms of which 4 ms to minimize.
[2024-06-01 08:32:22] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 3 ms to minimize.
[2024-06-01 08:32:22] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-06-01 08:32:29] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 2 ms to minimize.
[2024-06-01 08:32:29] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 4 ms to minimize.
[2024-06-01 08:32:29] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:32:32] [INFO ] Deduced a trap composed of 69 places in 253 ms of which 3 ms to minimize.
[2024-06-01 08:32:32] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 3 ms to minimize.
[2024-06-01 08:32:32] [INFO ] Deduced a trap composed of 80 places in 292 ms of which 3 ms to minimize.
[2024-06-01 08:32:32] [INFO ] Deduced a trap composed of 82 places in 302 ms of which 4 ms to minimize.
[2024-06-01 08:32:33] [INFO ] Deduced a trap composed of 70 places in 283 ms of which 3 ms to minimize.
[2024-06-01 08:32:33] [INFO ] Deduced a trap composed of 61 places in 293 ms of which 3 ms to minimize.
[2024-06-01 08:32:34] [INFO ] Deduced a trap composed of 71 places in 293 ms of which 4 ms to minimize.
[2024-06-01 08:32:34] [INFO ] Deduced a trap composed of 63 places in 286 ms of which 4 ms to minimize.
[2024-06-01 08:32:34] [INFO ] Deduced a trap composed of 50 places in 289 ms of which 4 ms to minimize.
[2024-06-01 08:32:35] [INFO ] Deduced a trap composed of 83 places in 308 ms of which 4 ms to minimize.
[2024-06-01 08:32:36] [INFO ] Deduced a trap composed of 75 places in 326 ms of which 3 ms to minimize.
[2024-06-01 08:32:36] [INFO ] Deduced a trap composed of 58 places in 312 ms of which 3 ms to minimize.
[2024-06-01 08:32:36] [INFO ] Deduced a trap composed of 46 places in 329 ms of which 3 ms to minimize.
[2024-06-01 08:32:37] [INFO ] Deduced a trap composed of 48 places in 304 ms of which 3 ms to minimize.
[2024-06-01 08:32:38] [INFO ] Deduced a trap composed of 98 places in 276 ms of which 3 ms to minimize.
[2024-06-01 08:32:38] [INFO ] Deduced a trap composed of 78 places in 271 ms of which 3 ms to minimize.
[2024-06-01 08:32:38] [INFO ] Deduced a trap composed of 66 places in 288 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-06-01 08:32:41] [INFO ] Deduced a trap composed of 76 places in 236 ms of which 3 ms to minimize.
[2024-06-01 08:32:41] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 3 ms to minimize.
[2024-06-01 08:32:42] [INFO ] Deduced a trap composed of 45 places in 332 ms of which 3 ms to minimize.
[2024-06-01 08:32:42] [INFO ] Deduced a trap composed of 72 places in 296 ms of which 3 ms to minimize.
[2024-06-01 08:32:42] [INFO ] Deduced a trap composed of 60 places in 307 ms of which 3 ms to minimize.
SMT process timed out in 61646ms, After SMT, problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 61669ms
Starting structural reductions in SI_LTL mode, iteration 1 : 394/663 places, 2106/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64860 ms. Remains : 394/663 places, 2106/2424 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 287 ms.
Product exploration explored 100000 steps with 0 reset in 374 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (AND p1 p0)), (X p2), (X (NOT (OR (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (AND p2 p0)), (X p0), (X p1), (X (X (AND p1 p0))), (X (X p2)), (X (X (NOT (OR (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0))))), (X (X (AND p2 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 128 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 543 ms. (73 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
[2024-06-01 08:32:44] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:32:44] [INFO ] Invariant cache hit.
[2024-06-01 08:32:44] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
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) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/154 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 318/472 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 52/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 110/582 variables, 50/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 30/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 180/762 variables, 10/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/772 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/772 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 280/1052 variables, 190/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1052 variables, 202/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 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) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:32:45] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/154 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:32:45] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 318/472 variables, 154/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 52/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/582 variables, 50/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 30/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/762 variables, 10/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/772 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/772 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:32:46] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 3 ms to minimize.
[2024-06-01 08:32:46] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 2 ms to minimize.
[2024-06-01 08:32:46] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 2 ms to minimize.
[2024-06-01 08:32:46] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 2 ms to minimize.
[2024-06-01 08:32:46] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-06-01 08:32:46] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:32:46] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 2 ms to minimize.
[2024-06-01 08:32:47] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1052 variables, 190/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1052 variables, 202/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1052 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1052 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 717 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2617 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 3383ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1078 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 68 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 394/394 places, 2106/2106 transitions.
RANDOM walk for 40000 steps (8 resets) in 736 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 127116 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 4
Probabilistic random walk after 127116 steps, saw 79726 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2024-06-01 08:32:52] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:32:52] [INFO ] Invariant cache hit.
[2024-06-01 08:32:52] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
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) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/154 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 318/472 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 52/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 110/582 variables, 50/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 30/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 180/762 variables, 10/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/772 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/772 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 280/1052 variables, 190/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1052 variables, 202/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 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) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:32:53] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/154 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:32:53] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 318/472 variables, 154/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 52/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/582 variables, 50/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 30/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/762 variables, 10/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/772 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/772 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:32:54] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 2 ms to minimize.
[2024-06-01 08:32:54] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 2 ms to minimize.
[2024-06-01 08:32:54] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 2 ms to minimize.
[2024-06-01 08:32:54] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 2 ms to minimize.
[2024-06-01 08:32:54] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:32:54] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:32:55] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 2 ms to minimize.
[2024-06-01 08:32:55] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1052 variables, 190/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1052 variables, 202/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1052 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1052 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 717 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2675 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 3463ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1162 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 68 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 394/394 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 69 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-06-01 08:32:57] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:32:57] [INFO ] Invariant cache hit.
[2024-06-01 08:32:57] [INFO ] Implicit Places using invariants in 713 ms returned []
[2024-06-01 08:32:57] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:32:57] [INFO ] Invariant cache hit.
[2024-06-01 08:32:58] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:33:00] [INFO ] Implicit Places using invariants and state equation in 2138 ms returned []
Implicit Place search using SMT with State Equation took 2853 ms to find 0 implicit places.
[2024-06-01 08:33:00] [INFO ] Redundant transitions in 56 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-06-01 08:33:00] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:33:00] [INFO ] Invariant cache hit.
[2024-06-01 08:33:00] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-06-01 08:33:29] [INFO ] Deduced a trap composed of 3 places in 490 ms of which 7 ms to minimize.
[2024-06-01 08:33:29] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 3 ms to minimize.
[2024-06-01 08:33:29] [INFO ] Deduced a trap composed of 3 places in 306 ms of which 4 ms to minimize.
[2024-06-01 08:33:30] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 3 ms to minimize.
[2024-06-01 08:33:30] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 2 ms to minimize.
[2024-06-01 08:33:30] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2024-06-01 08:33:30] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:33:30] [INFO ] Deduced a trap composed of 60 places in 345 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1052 variables, and 33 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2098/2098 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-06-01 08:33:35] [INFO ] Deduced a trap composed of 72 places in 278 ms of which 5 ms to minimize.
[2024-06-01 08:33:35] [INFO ] Deduced a trap composed of 77 places in 425 ms of which 5 ms to minimize.
[2024-06-01 08:33:36] [INFO ] Deduced a trap composed of 78 places in 444 ms of which 5 ms to minimize.
[2024-06-01 08:33:36] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:33:36] [INFO ] Deduced a trap composed of 102 places in 470 ms of which 6 ms to minimize.
[2024-06-01 08:33:37] [INFO ] Deduced a trap composed of 24 places in 354 ms of which 5 ms to minimize.
[2024-06-01 08:33:37] [INFO ] Deduced a trap composed of 61 places in 334 ms of which 4 ms to minimize.
[2024-06-01 08:33:37] [INFO ] Deduced a trap composed of 44 places in 353 ms of which 4 ms to minimize.
[2024-06-01 08:33:38] [INFO ] Deduced a trap composed of 68 places in 285 ms of which 5 ms to minimize.
[2024-06-01 08:33:38] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2024-06-01 08:33:39] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
[2024-06-01 08:33:40] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:33:40] [INFO ] Deduced a trap composed of 45 places in 387 ms of which 5 ms to minimize.
[2024-06-01 08:33:41] [INFO ] Deduced a trap composed of 47 places in 419 ms of which 5 ms to minimize.
[2024-06-01 08:33:41] [INFO ] Deduced a trap composed of 46 places in 427 ms of which 6 ms to minimize.
[2024-06-01 08:33:43] [INFO ] Deduced a trap composed of 51 places in 496 ms of which 6 ms to minimize.
[2024-06-01 08:33:43] [INFO ] Deduced a trap composed of 26 places in 267 ms of which 3 ms to minimize.
[2024-06-01 08:33:44] [INFO ] Deduced a trap composed of 13 places in 474 ms of which 6 ms to minimize.
[2024-06-01 08:33:44] [INFO ] Deduced a trap composed of 43 places in 516 ms of which 5 ms to minimize.
[2024-06-01 08:33:44] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-06-01 08:33:50] [INFO ] Deduced a trap composed of 61 places in 345 ms of which 5 ms to minimize.
[2024-06-01 08:33:51] [INFO ] Deduced a trap composed of 60 places in 375 ms of which 5 ms to minimize.
[2024-06-01 08:33:52] [INFO ] Deduced a trap composed of 62 places in 398 ms of which 5 ms to minimize.
[2024-06-01 08:33:52] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-06-01 08:33:52] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-06-01 08:33:53] [INFO ] Deduced a trap composed of 61 places in 399 ms of which 5 ms to minimize.
[2024-06-01 08:33:57] [INFO ] Deduced a trap composed of 70 places in 442 ms of which 5 ms to minimize.
[2024-06-01 08:33:57] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 2 ms to minimize.
[2024-06-01 08:33:58] [INFO ] Deduced a trap composed of 15 places in 420 ms of which 4 ms to minimize.
[2024-06-01 08:33:58] [INFO ] Deduced a trap composed of 71 places in 509 ms of which 5 ms to minimize.
[2024-06-01 08:34:00] [INFO ] Deduced a trap composed of 71 places in 573 ms of which 6 ms to minimize.
[2024-06-01 08:34:00] [INFO ] Deduced a trap composed of 56 places in 491 ms of which 5 ms to minimize.
[2024-06-01 08:34:01] [INFO ] Deduced a trap composed of 69 places in 476 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1052 variables, and 66 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2098 constraints, Known Traps: 41/41 constraints]
After SMT, in 61540ms problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 61562ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64552 ms. Remains : 394/394 places, 2106/2106 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1934 edges and 394 vertex of which 64 / 394 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 338 transition count 413
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 261 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 260 transition count 412
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 157 place count 260 transition count 395
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 199 place count 235 transition count 395
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 417 place count 126 transition count 286
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 471 place count 126 transition count 232
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 487 place count 118 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 495 place count 118 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 503 place count 118 transition count 216
Free-agglomeration rule applied 55 times.
Iterating global reduction 5 with 55 rules applied. Total rules applied 558 place count 118 transition count 161
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 5 with 55 rules applied. Total rules applied 613 place count 63 transition count 161
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 620 place count 63 transition count 161
Applied a total of 620 rules in 40 ms. Remains 63 /394 variables (removed 331) and now considering 161/2106 (removed 1945) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 161 rows 63 cols
[2024-06-01 08:34:01] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 08:34:01] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 08:34:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-06-01 08:34:01] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 08:34:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 08:34:02] [INFO ] After 61ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 08:34:02] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-06-01 08:34:02] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
TRAPS : Iteration 1
[2024-06-01 08:34:02] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
TRAPS : Iteration 2
[2024-06-01 08:34:02] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 08:34:02] [INFO ] After 613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 735 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (AND p1 p0)), (X p2), (X (NOT (OR (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (AND p2 p0)), (X p0), (X p1), (X (X (AND p1 p0))), (X (X p2)), (X (X (NOT (OR (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0))))), (X (X (AND p2 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 17 factoid took 244 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 115 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-06-01 08:34:03] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2024-06-01 08:34:03] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 08:34:04] [INFO ] Implicit Places using invariants in 1041 ms returned []
[2024-06-01 08:34:04] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:34:04] [INFO ] Invariant cache hit.
[2024-06-01 08:34:04] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:34:07] [INFO ] Implicit Places using invariants and state equation in 3607 ms returned []
Implicit Place search using SMT with State Equation took 4655 ms to find 0 implicit places.
[2024-06-01 08:34:07] [INFO ] Redundant transitions in 86 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-06-01 08:34:07] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:34:07] [INFO ] Invariant cache hit.
[2024-06-01 08:34:07] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-06-01 08:34:37] [INFO ] Deduced a trap composed of 3 places in 344 ms of which 4 ms to minimize.
[2024-06-01 08:34:37] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 2 ms to minimize.
[2024-06-01 08:34:37] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 2 ms to minimize.
[2024-06-01 08:34:37] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-06-01 08:34:37] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-06-01 08:34:37] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:34:37] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:34:38] [INFO ] Deduced a trap composed of 60 places in 189 ms of which 3 ms to minimize.
[2024-06-01 08:34:39] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 3 ms to minimize.
SMT process timed out in 31704ms, After SMT, problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 31742ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36646 ms. Remains : 394/394 places, 2106/2106 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p1)), (X (AND p0 p2)), (X p0), (X p1), (X (NOT (AND p0 (NOT p1) p2))), (X (X p2)), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X (AND p0 p2))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 124 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 1167 ms. (34 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
[2024-06-01 08:34:40] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:34:40] [INFO ] Invariant cache hit.
[2024-06-01 08:34:40] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
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) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/154 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 318/472 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 52/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 110/582 variables, 50/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 30/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 180/762 variables, 10/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/772 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/772 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 280/1052 variables, 190/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1052 variables, 202/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 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) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:34:41] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 3 ms to minimize.
[2024-06-01 08:34:41] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/154 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:34:41] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 318/472 variables, 154/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 52/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/582 variables, 50/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 30/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/762 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/762 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/772 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/772 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:34:42] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 2 ms to minimize.
[2024-06-01 08:34:42] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2024-06-01 08:34:42] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:34:43] [INFO ] Deduced a trap composed of 33 places in 282 ms of which 3 ms to minimize.
[2024-06-01 08:34:43] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 5/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1052 variables, 190/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1052 variables, 202/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1052 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1052 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 715 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3319 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 4074ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1003 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 102 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 394/394 places, 2106/2106 transitions.
RANDOM walk for 40000 steps (8 resets) in 601 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 69867 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 4
Probabilistic random walk after 69867 steps, saw 46987 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-06-01 08:34:49] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:34:49] [INFO ] Invariant cache hit.
[2024-06-01 08:34:49] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
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) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/154 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 318/472 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 52/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 110/582 variables, 50/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 30/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 180/762 variables, 10/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/772 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/772 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 280/1052 variables, 190/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1052 variables, 202/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 922 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 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) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:34:50] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
[2024-06-01 08:34:50] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/154 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:34:50] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 318/472 variables, 154/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 52/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/582 variables, 50/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 30/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/762 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/762 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/772 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/772 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:34:51] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 2 ms to minimize.
[2024-06-01 08:34:51] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2024-06-01 08:34:51] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:34:52] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 3 ms to minimize.
[2024-06-01 08:34:52] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 5/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1052 variables, 190/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1052 variables, 202/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1052 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1052 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 715 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3212 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 4163ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1222 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 113 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 394/394 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 110 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-06-01 08:34:54] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:34:54] [INFO ] Invariant cache hit.
[2024-06-01 08:34:55] [INFO ] Implicit Places using invariants in 948 ms returned []
[2024-06-01 08:34:55] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:34:55] [INFO ] Invariant cache hit.
[2024-06-01 08:34:56] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:34:59] [INFO ] Implicit Places using invariants and state equation in 3258 ms returned []
Implicit Place search using SMT with State Equation took 4209 ms to find 0 implicit places.
[2024-06-01 08:34:59] [INFO ] Redundant transitions in 88 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-06-01 08:34:59] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:34:59] [INFO ] Invariant cache hit.
[2024-06-01 08:34:59] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-06-01 08:35:26] [INFO ] Deduced a trap composed of 3 places in 437 ms of which 6 ms to minimize.
[2024-06-01 08:35:27] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 3 ms to minimize.
[2024-06-01 08:35:27] [INFO ] Deduced a trap composed of 3 places in 343 ms of which 3 ms to minimize.
[2024-06-01 08:35:27] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 3 ms to minimize.
[2024-06-01 08:35:27] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 2 ms to minimize.
[2024-06-01 08:35:28] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 1 ms to minimize.
[2024-06-01 08:35:28] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-06-01 08:35:28] [INFO ] Deduced a trap composed of 60 places in 320 ms of which 4 ms to minimize.
[2024-06-01 08:35:30] [INFO ] Deduced a trap composed of 43 places in 356 ms of which 5 ms to minimize.
SMT process timed out in 31605ms, After SMT, problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 31641ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36069 ms. Remains : 394/394 places, 2106/2106 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1934 edges and 394 vertex of which 64 / 394 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 338 transition count 413
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 261 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 260 transition count 412
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 157 place count 260 transition count 395
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 199 place count 235 transition count 395
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 417 place count 126 transition count 286
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 471 place count 126 transition count 232
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 487 place count 118 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 495 place count 118 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 503 place count 118 transition count 216
Free-agglomeration rule applied 55 times.
Iterating global reduction 5 with 55 rules applied. Total rules applied 558 place count 118 transition count 161
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 5 with 55 rules applied. Total rules applied 613 place count 63 transition count 161
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 620 place count 63 transition count 161
Applied a total of 620 rules in 37 ms. Remains 63 /394 variables (removed 331) and now considering 161/2106 (removed 1945) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 161 rows 63 cols
[2024-06-01 08:35:30] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 08:35:30] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 08:35:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 08:35:31] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 08:35:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 08:35:31] [INFO ] After 60ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 08:35:31] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:35:31] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:35:31] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:35:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 112 ms
TRAPS : Iteration 1
[2024-06-01 08:35:31] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 08:35:31] [INFO ] After 584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 689 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p1)), (X (AND p0 p2)), (X p0), (X p1), (X (NOT (AND p0 (NOT p1) p2))), (X (X p2)), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X (AND p0 p2))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 313 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 433 ms.
Product exploration explored 100000 steps with 0 reset in 537 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 105 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-06-01 08:35:33] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2024-06-01 08:35:33] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 08:35:34] [INFO ] Implicit Places using invariants in 813 ms returned []
[2024-06-01 08:35:34] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:35:34] [INFO ] Invariant cache hit.
[2024-06-01 08:35:34] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:35:36] [INFO ] Implicit Places using invariants and state equation in 2715 ms returned []
Implicit Place search using SMT with State Equation took 3529 ms to find 0 implicit places.
[2024-06-01 08:35:36] [INFO ] Redundant transitions in 60 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-06-01 08:35:36] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-06-01 08:35:36] [INFO ] Invariant cache hit.
[2024-06-01 08:35:36] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-06-01 08:36:07] [INFO ] Deduced a trap composed of 3 places in 600 ms of which 6 ms to minimize.
[2024-06-01 08:36:08] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 4 ms to minimize.
[2024-06-01 08:36:08] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 4 ms to minimize.
SMT process timed out in 31701ms, After SMT, problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 31727ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35432 ms. Remains : 394/394 places, 2106/2106 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-13 finished in 270726 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((X(X(F(p1)))||p0))))'
Support contains 5 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 5 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 422 place count 449 transition count 2168
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 449 transition count 2168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 5 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 393 transition count 2112
Applied a total of 540 rules in 240 ms. Remains 393 /663 variables (removed 270) and now considering 2112/2424 (removed 312) transitions.
[2024-06-01 08:36:08] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-06-01 08:36:08] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 08:36:10] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2024-06-01 08:36:10] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:36:10] [INFO ] Invariant cache hit.
[2024-06-01 08:36:10] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-06-01 08:36:13] [INFO ] Implicit Places using invariants and state equation in 3164 ms returned []
Implicit Place search using SMT with State Equation took 4185 ms to find 0 implicit places.
[2024-06-01 08:36:13] [INFO ] Redundant transitions in 59 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-06-01 08:36:13] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:36:13] [INFO ] Invariant cache hit.
[2024-06-01 08:36:13] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 08:36:43] [INFO ] Deduced a trap composed of 3 places in 534 ms of which 6 ms to minimize.
[2024-06-01 08:36:43] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 3 ms to minimize.
[2024-06-01 08:36:44] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 3 ms to minimize.
[2024-06-01 08:36:44] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 2 ms to minimize.
[2024-06-01 08:36:44] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2024-06-01 08:36:44] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:36:44] [INFO ] Deduced a trap composed of 60 places in 258 ms of which 3 ms to minimize.
[2024-06-01 08:36:45] [INFO ] Deduced a trap composed of 77 places in 283 ms of which 3 ms to minimize.
SMT process timed out in 31908ms, After SMT, problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 31934ms
Starting structural reductions in SI_LTL mode, iteration 1 : 393/663 places, 2112/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36430 ms. Remains : 393/663 places, 2112/2424 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 287 ms.
Product exploration explored 100000 steps with 0 reset in 341 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 126 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 850 ms. (47 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 105543 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 4
Probabilistic random walk after 105543 steps, saw 68130 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
[2024-06-01 08:36:49] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:36:49] [INFO ] Invariant cache hit.
[2024-06-01 08:36:49] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 110/587 variables, 50/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 27/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 180/767 variables, 10/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/767 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 10/777 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/777 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 280/1057 variables, 190/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1057 variables, 203/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:36:51] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/587 variables, 50/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 27/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/767 variables, 10/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/767 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/777 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/777 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:36:51] [INFO ] Deduced a trap composed of 7 places in 275 ms of which 3 ms to minimize.
[2024-06-01 08:36:52] [INFO ] Deduced a trap composed of 44 places in 289 ms of which 3 ms to minimize.
[2024-06-01 08:36:52] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 3 ms to minimize.
[2024-06-01 08:36:52] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 3 ms to minimize.
[2024-06-01 08:36:52] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 2 ms to minimize.
[2024-06-01 08:36:52] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:36:53] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2024-06-01 08:36:53] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/777 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/777 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1057 variables, 190/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1057 variables, 203/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1057/1057 variables, and 722 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3906 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 4948ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4337 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 111 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 393/393 places, 2112/2112 transitions.
RANDOM walk for 40000 steps (8 resets) in 1092 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 85329 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 4
Probabilistic random walk after 85329 steps, saw 56279 distinct states, run finished after 3004 ms. (steps per millisecond=28 ) properties seen :0
[2024-06-01 08:37:02] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:37:02] [INFO ] Invariant cache hit.
[2024-06-01 08:37:02] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 110/587 variables, 50/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 27/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 180/767 variables, 10/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/767 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 10/777 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/777 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 280/1057 variables, 190/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1057 variables, 203/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1227 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:37:04] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/587 variables, 50/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 27/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/767 variables, 10/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/767 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/777 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/777 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:37:05] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 2 ms to minimize.
[2024-06-01 08:37:05] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 2 ms to minimize.
[2024-06-01 08:37:05] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:37:05] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:37:05] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 2 ms to minimize.
[2024-06-01 08:37:05] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-06-01 08:37:06] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2024-06-01 08:37:06] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/777 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/777 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1057 variables, 190/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1057 variables, 203/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1057/1057 variables, and 722 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3548 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 4807ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3737 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 148 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 393/393 places, 2112/2112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 102 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-06-01 08:37:11] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:37:11] [INFO ] Invariant cache hit.
[2024-06-01 08:37:12] [INFO ] Implicit Places using invariants in 902 ms returned []
[2024-06-01 08:37:12] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:37:12] [INFO ] Invariant cache hit.
[2024-06-01 08:37:12] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-06-01 08:37:16] [INFO ] Implicit Places using invariants and state equation in 3854 ms returned []
Implicit Place search using SMT with State Equation took 4773 ms to find 0 implicit places.
[2024-06-01 08:37:16] [INFO ] Redundant transitions in 88 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-06-01 08:37:16] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:37:16] [INFO ] Invariant cache hit.
[2024-06-01 08:37:16] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 08:37:47] [INFO ] Deduced a trap composed of 3 places in 613 ms of which 6 ms to minimize.
SMT process timed out in 31607ms, After SMT, problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 31643ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36623 ms. Remains : 393/393 places, 2112/2112 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1936 edges and 393 vertex of which 64 / 393 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 214 transitions
Ensure Unique test removed 1407 transitions
Reduce isomorphic transitions removed 1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 337 transition count 413
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 259 transition count 413
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 157 place count 259 transition count 397
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 196 place count 236 transition count 397
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 420 place count 124 transition count 285
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 475 place count 124 transition count 230
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 485 place count 119 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 490 place count 119 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 497 place count 119 transition count 218
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 555 place count 119 transition count 160
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 613 place count 61 transition count 160
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 621 place count 61 transition count 160
Applied a total of 621 rules in 52 ms. Remains 61 /393 variables (removed 332) and now considering 160/2112 (removed 1952) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 160 rows 61 cols
[2024-06-01 08:37:48] [INFO ] Computed 18 invariants in 2 ms
[2024-06-01 08:37:48] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 08:37:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-06-01 08:37:48] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 08:37:48] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 08:37:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 08:37:48] [INFO ] After 60ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 08:37:48] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:37:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-06-01 08:37:48] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:37:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 1
[2024-06-01 08:37:48] [INFO ] After 287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 08:37:48] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 670 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 154 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 115 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-06-01 08:37:49] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-06-01 08:37:49] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 08:37:50] [INFO ] Implicit Places using invariants in 978 ms returned []
[2024-06-01 08:37:50] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:37:50] [INFO ] Invariant cache hit.
[2024-06-01 08:37:50] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-06-01 08:37:53] [INFO ] Implicit Places using invariants and state equation in 3513 ms returned []
Implicit Place search using SMT with State Equation took 4505 ms to find 0 implicit places.
[2024-06-01 08:37:53] [INFO ] Redundant transitions in 85 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-06-01 08:37:53] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:37:53] [INFO ] Invariant cache hit.
[2024-06-01 08:37:53] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 08:38:21] [INFO ] Deduced a trap composed of 3 places in 409 ms of which 4 ms to minimize.
[2024-06-01 08:38:21] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 2 ms to minimize.
[2024-06-01 08:38:22] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2024-06-01 08:38:22] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-06-01 08:38:22] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:38:22] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:38:22] [INFO ] Deduced a trap composed of 60 places in 183 ms of which 3 ms to minimize.
[2024-06-01 08:38:22] [INFO ] Deduced a trap composed of 77 places in 231 ms of which 3 ms to minimize.
[2024-06-01 08:38:24] [INFO ] Deduced a trap composed of 42 places in 386 ms of which 5 ms to minimize.
[2024-06-01 08:38:25] [INFO ] Deduced a trap composed of 48 places in 328 ms of which 2 ms to minimize.
[2024-06-01 08:38:25] [INFO ] Deduced a trap composed of 50 places in 211 ms of which 3 ms to minimize.
SMT process timed out in 31785ms, After SMT, problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 31822ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36541 ms. Remains : 393/393 places, 2112/2112 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1208 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 79011 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 4
Probabilistic random walk after 79011 steps, saw 52327 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2024-06-01 08:38:29] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:38:29] [INFO ] Invariant cache hit.
[2024-06-01 08:38:29] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 110/587 variables, 50/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 27/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 180/767 variables, 10/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/767 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 10/777 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/777 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 280/1057 variables, 190/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1057 variables, 203/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 892 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:38:30] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/587 variables, 50/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 27/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/767 variables, 10/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/767 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/777 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/777 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:38:31] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 2 ms to minimize.
[2024-06-01 08:38:31] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 2 ms to minimize.
[2024-06-01 08:38:31] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
[2024-06-01 08:38:31] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 3 ms to minimize.
[2024-06-01 08:38:32] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2024-06-01 08:38:32] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-06-01 08:38:32] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2024-06-01 08:38:32] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/777 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/777 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1057 variables, 190/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1057 variables, 203/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1057/1057 variables, and 722 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3168 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 4085ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3482 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 71 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 393/393 places, 2112/2112 transitions.
RANDOM walk for 40000 steps (8 resets) in 932 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 101871 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 4
Probabilistic random walk after 101871 steps, saw 65857 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2024-06-01 08:38:40] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:38:40] [INFO ] Invariant cache hit.
[2024-06-01 08:38:40] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 110/587 variables, 50/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 27/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 180/767 variables, 10/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/767 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 10/777 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/777 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 280/1057 variables, 190/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1057 variables, 203/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:38:42] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/587 variables, 50/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 27/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/767 variables, 10/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/767 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/777 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/777 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:38:42] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 2 ms to minimize.
[2024-06-01 08:38:43] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 2 ms to minimize.
[2024-06-01 08:38:43] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 1 ms to minimize.
[2024-06-01 08:38:43] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 2 ms to minimize.
[2024-06-01 08:38:43] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2024-06-01 08:38:43] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:38:43] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:38:43] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/777 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/777 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1057 variables, 190/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1057 variables, 203/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1057/1057 variables, and 722 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2882 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 3914ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2973 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 100 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 393/393 places, 2112/2112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 110 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-06-01 08:38:47] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:38:47] [INFO ] Invariant cache hit.
[2024-06-01 08:38:48] [INFO ] Implicit Places using invariants in 879 ms returned []
[2024-06-01 08:38:48] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:38:48] [INFO ] Invariant cache hit.
[2024-06-01 08:38:49] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-06-01 08:38:52] [INFO ] Implicit Places using invariants and state equation in 3788 ms returned []
Implicit Place search using SMT with State Equation took 4669 ms to find 0 implicit places.
[2024-06-01 08:38:52] [INFO ] Redundant transitions in 78 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-06-01 08:38:52] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:38:52] [INFO ] Invariant cache hit.
[2024-06-01 08:38:52] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 08:39:23] [INFO ] Deduced a trap composed of 3 places in 465 ms of which 6 ms to minimize.
[2024-06-01 08:39:23] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 4 ms to minimize.
[2024-06-01 08:39:24] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 2 ms to minimize.
[2024-06-01 08:39:24] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 2 ms to minimize.
SMT process timed out in 31577ms, After SMT, problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 31612ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36485 ms. Remains : 393/393 places, 2112/2112 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1936 edges and 393 vertex of which 64 / 393 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 214 transitions
Ensure Unique test removed 1407 transitions
Reduce isomorphic transitions removed 1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 337 transition count 413
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 259 transition count 413
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 157 place count 259 transition count 397
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 196 place count 236 transition count 397
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 420 place count 124 transition count 285
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 475 place count 124 transition count 230
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 485 place count 119 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 490 place count 119 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 497 place count 119 transition count 218
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 555 place count 119 transition count 160
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 613 place count 61 transition count 160
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 621 place count 61 transition count 160
Applied a total of 621 rules in 32 ms. Remains 61 /393 variables (removed 332) and now considering 160/2112 (removed 1952) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 160 rows 61 cols
[2024-06-01 08:39:24] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 08:39:24] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 08:39:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-06-01 08:39:24] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 08:39:24] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 08:39:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 08:39:24] [INFO ] After 62ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 08:39:24] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:39:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-06-01 08:39:24] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:39:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
TRAPS : Iteration 1
[2024-06-01 08:39:24] [INFO ] After 285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 08:39:24] [INFO ] After 544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 637 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 357 ms.
Product exploration explored 100000 steps with 0 reset in 402 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 91 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-06-01 08:39:26] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-06-01 08:39:26] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 08:39:26] [INFO ] Implicit Places using invariants in 612 ms returned []
[2024-06-01 08:39:26] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:39:26] [INFO ] Invariant cache hit.
[2024-06-01 08:39:27] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-06-01 08:39:29] [INFO ] Implicit Places using invariants and state equation in 2760 ms returned []
Implicit Place search using SMT with State Equation took 3373 ms to find 0 implicit places.
[2024-06-01 08:39:29] [INFO ] Redundant transitions in 57 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-06-01 08:39:29] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-06-01 08:39:29] [INFO ] Invariant cache hit.
[2024-06-01 08:39:29] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 08:39:54] [INFO ] Deduced a trap composed of 3 places in 623 ms of which 5 ms to minimize.
[2024-06-01 08:39:54] [INFO ] Deduced a trap composed of 3 places in 326 ms of which 3 ms to minimize.
[2024-06-01 08:39:55] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 3 ms to minimize.
[2024-06-01 08:39:55] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 2 ms to minimize.
[2024-06-01 08:39:55] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-06-01 08:39:55] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:39:56] [INFO ] Deduced a trap composed of 60 places in 376 ms of which 5 ms to minimize.
[2024-06-01 08:39:56] [INFO ] Deduced a trap composed of 77 places in 426 ms of which 5 ms to minimize.
[2024-06-01 08:39:58] [INFO ] Deduced a trap composed of 42 places in 388 ms of which 5 ms to minimize.
[2024-06-01 08:39:59] [INFO ] Deduced a trap composed of 48 places in 419 ms of which 5 ms to minimize.
[2024-06-01 08:39:59] [INFO ] Deduced a trap composed of 50 places in 391 ms of which 5 ms to minimize.
[2024-06-01 08:40:00] [INFO ] Deduced a trap composed of 45 places in 396 ms of which 5 ms to minimize.
[2024-06-01 08:40:00] [INFO ] Deduced a trap composed of 45 places in 395 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/1057 variables, and 38 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 08:40:11] [INFO ] Deduced a trap composed of 68 places in 386 ms of which 5 ms to minimize.
[2024-06-01 08:40:11] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:40:12] [INFO ] Deduced a trap composed of 64 places in 407 ms of which 5 ms to minimize.
[2024-06-01 08:40:12] [INFO ] Deduced a trap composed of 47 places in 457 ms of which 5 ms to minimize.
[2024-06-01 08:40:13] [INFO ] Deduced a trap composed of 59 places in 424 ms of which 5 ms to minimize.
[2024-06-01 08:40:13] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-06-01 08:40:14] [INFO ] Deduced a trap composed of 74 places in 474 ms of which 5 ms to minimize.
[2024-06-01 08:40:14] [INFO ] Deduced a trap composed of 49 places in 397 ms of which 4 ms to minimize.
[2024-06-01 08:40:15] [INFO ] Deduced a trap composed of 56 places in 455 ms of which 6 ms to minimize.
[2024-06-01 08:40:15] [INFO ] Deduced a trap composed of 43 places in 452 ms of which 5 ms to minimize.
[2024-06-01 08:40:15] [INFO ] Deduced a trap composed of 51 places in 419 ms of which 5 ms to minimize.
[2024-06-01 08:40:16] [INFO ] Deduced a trap composed of 49 places in 463 ms of which 5 ms to minimize.
[2024-06-01 08:40:16] [INFO ] Deduced a trap composed of 75 places in 491 ms of which 6 ms to minimize.
[2024-06-01 08:40:17] [INFO ] Deduced a trap composed of 39 places in 549 ms of which 5 ms to minimize.
[2024-06-01 08:40:18] [INFO ] Deduced a trap composed of 50 places in 550 ms of which 6 ms to minimize.
[2024-06-01 08:40:18] [INFO ] Deduced a trap composed of 53 places in 562 ms of which 6 ms to minimize.
[2024-06-01 08:40:19] [INFO ] Deduced a trap composed of 51 places in 598 ms of which 6 ms to minimize.
[2024-06-01 08:40:19] [INFO ] Deduced a trap composed of 48 places in 602 ms of which 6 ms to minimize.
[2024-06-01 08:40:20] [INFO ] Deduced a trap composed of 71 places in 577 ms of which 6 ms to minimize.
[2024-06-01 08:40:21] [INFO ] Deduced a trap composed of 59 places in 602 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 08:40:22] [INFO ] Deduced a trap composed of 71 places in 280 ms of which 5 ms to minimize.
[2024-06-01 08:40:22] [INFO ] Deduced a trap composed of 62 places in 357 ms of which 5 ms to minimize.
[2024-06-01 08:40:23] [INFO ] Deduced a trap composed of 20 places in 444 ms of which 6 ms to minimize.
[2024-06-01 08:40:23] [INFO ] Deduced a trap composed of 83 places in 374 ms of which 4 ms to minimize.
[2024-06-01 08:40:24] [INFO ] Deduced a trap composed of 74 places in 392 ms of which 5 ms to minimize.
[2024-06-01 08:40:26] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-06-01 08:40:26] [INFO ] Deduced a trap composed of 26 places in 337 ms of which 5 ms to minimize.
[2024-06-01 08:40:27] [INFO ] Deduced a trap composed of 62 places in 414 ms of which 5 ms to minimize.
[2024-06-01 08:40:28] [INFO ] Deduced a trap composed of 76 places in 408 ms of which 4 ms to minimize.
[2024-06-01 08:40:29] [INFO ] Deduced a trap composed of 78 places in 416 ms of which 5 ms to minimize.
[2024-06-01 08:40:29] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2024-06-01 08:40:30] [INFO ] Deduced a trap composed of 51 places in 354 ms of which 5 ms to minimize.
[2024-06-01 08:40:31] [INFO ] Deduced a trap composed of 50 places in 287 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/1057 variables, and 71 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 46/46 constraints]
After SMT, in 61471ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 61493ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65025 ms. Remains : 393/393 places, 2112/2112 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-14 finished in 262536 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(G(p0)))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-08-LTLFireability-12
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 5 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 423 place count 448 transition count 2160
Iterating global reduction 2 with 7 rules applied. Total rules applied 430 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 5 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 542 place count 392 transition count 2104
Applied a total of 542 rules in 138 ms. Remains 392 /663 variables (removed 271) and now considering 2104/2424 (removed 320) transitions.
[2024-06-01 08:40:31] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-06-01 08:40:31] [INFO ] Computed 25 invariants in 3 ms
[2024-06-01 08:40:32] [INFO ] Implicit Places using invariants in 920 ms returned []
[2024-06-01 08:40:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:40:32] [INFO ] Invariant cache hit.
[2024-06-01 08:40:33] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:40:36] [INFO ] Implicit Places using invariants and state equation in 3882 ms returned []
Implicit Place search using SMT with State Equation took 4806 ms to find 0 implicit places.
Running 2096 sub problems to find dead transitions.
[2024-06-01 08:40:36] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:40:36] [INFO ] Invariant cache hit.
[2024-06-01 08:40:36] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:41:02] [INFO ] Deduced a trap composed of 3 places in 351 ms of which 6 ms to minimize.
[2024-06-01 08:41:02] [INFO ] Deduced a trap composed of 3 places in 300 ms of which 4 ms to minimize.
[2024-06-01 08:41:02] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 2 ms to minimize.
[2024-06-01 08:41:02] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 3 ms to minimize.
[2024-06-01 08:41:03] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2024-06-01 08:41:03] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-06-01 08:41:03] [INFO ] Deduced a trap composed of 43 places in 348 ms of which 4 ms to minimize.
[2024-06-01 08:41:04] [INFO ] Deduced a trap composed of 71 places in 419 ms of which 5 ms to minimize.
[2024-06-01 08:41:04] [INFO ] Deduced a trap composed of 28 places in 428 ms of which 5 ms to minimize.
[2024-06-01 08:41:04] [INFO ] Deduced a trap composed of 61 places in 374 ms of which 5 ms to minimize.
[2024-06-01 08:41:05] [INFO ] Deduced a trap composed of 22 places in 425 ms of which 5 ms to minimize.
[2024-06-01 08:41:05] [INFO ] Deduced a trap composed of 24 places in 422 ms of which 5 ms to minimize.
[2024-06-01 08:41:06] [INFO ] Deduced a trap composed of 29 places in 415 ms of which 5 ms to minimize.
[2024-06-01 08:41:06] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 4 ms to minimize.
[2024-06-01 08:41:06] [INFO ] Deduced a trap composed of 54 places in 273 ms of which 3 ms to minimize.
[2024-06-01 08:41:07] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 3 ms to minimize.
[2024-06-01 08:41:07] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 2 ms to minimize.
[2024-06-01 08:41:07] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 43 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:41:15] [INFO ] Deduced a trap composed of 48 places in 371 ms of which 5 ms to minimize.
[2024-06-01 08:41:15] [INFO ] Deduced a trap composed of 50 places in 362 ms of which 5 ms to minimize.
[2024-06-01 08:41:16] [INFO ] Deduced a trap composed of 45 places in 354 ms of which 5 ms to minimize.
[2024-06-01 08:41:16] [INFO ] Deduced a trap composed of 43 places in 356 ms of which 4 ms to minimize.
[2024-06-01 08:41:17] [INFO ] Deduced a trap composed of 54 places in 352 ms of which 4 ms to minimize.
[2024-06-01 08:41:18] [INFO ] Deduced a trap composed of 48 places in 360 ms of which 5 ms to minimize.
[2024-06-01 08:41:19] [INFO ] Deduced a trap composed of 69 places in 311 ms of which 4 ms to minimize.
[2024-06-01 08:41:20] [INFO ] Deduced a trap composed of 21 places in 369 ms of which 5 ms to minimize.
[2024-06-01 08:41:21] [INFO ] Deduced a trap composed of 44 places in 394 ms of which 4 ms to minimize.
[2024-06-01 08:41:21] [INFO ] Deduced a trap composed of 87 places in 339 ms of which 3 ms to minimize.
[2024-06-01 08:41:21] [INFO ] Deduced a trap composed of 73 places in 222 ms of which 4 ms to minimize.
[2024-06-01 08:41:22] [INFO ] Deduced a trap composed of 70 places in 265 ms of which 5 ms to minimize.
[2024-06-01 08:41:22] [INFO ] Deduced a trap composed of 67 places in 327 ms of which 4 ms to minimize.
[2024-06-01 08:41:23] [INFO ] Deduced a trap composed of 69 places in 431 ms of which 5 ms to minimize.
[2024-06-01 08:41:23] [INFO ] Deduced a trap composed of 89 places in 333 ms of which 3 ms to minimize.
[2024-06-01 08:41:23] [INFO ] Deduced a trap composed of 70 places in 286 ms of which 3 ms to minimize.
[2024-06-01 08:41:23] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-01 08:41:24] [INFO ] Deduced a trap composed of 3 places in 453 ms of which 5 ms to minimize.
[2024-06-01 08:41:25] [INFO ] Deduced a trap composed of 66 places in 416 ms of which 5 ms to minimize.
[2024-06-01 08:41:25] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:41:28] [INFO ] Deduced a trap composed of 61 places in 293 ms of which 3 ms to minimize.
[2024-06-01 08:41:28] [INFO ] Deduced a trap composed of 11 places in 496 ms of which 5 ms to minimize.
[2024-06-01 08:41:29] [INFO ] Deduced a trap composed of 73 places in 538 ms of which 5 ms to minimize.
[2024-06-01 08:41:30] [INFO ] Deduced a trap composed of 75 places in 393 ms of which 5 ms to minimize.
[2024-06-01 08:41:30] [INFO ] Deduced a trap composed of 73 places in 401 ms of which 5 ms to minimize.
[2024-06-01 08:41:31] [INFO ] Deduced a trap composed of 73 places in 348 ms of which 5 ms to minimize.
[2024-06-01 08:41:31] [INFO ] Deduced a trap composed of 67 places in 467 ms of which 5 ms to minimize.
[2024-06-01 08:41:31] [INFO ] Deduced a trap composed of 76 places in 357 ms of which 4 ms to minimize.
[2024-06-01 08:41:32] [INFO ] Deduced a trap composed of 26 places in 347 ms of which 4 ms to minimize.
[2024-06-01 08:41:32] [INFO ] Deduced a trap composed of 14 places in 519 ms of which 6 ms to minimize.
[2024-06-01 08:41:33] [INFO ] Deduced a trap composed of 13 places in 455 ms of which 5 ms to minimize.
[2024-06-01 08:41:34] [INFO ] Deduced a trap composed of 61 places in 460 ms of which 5 ms to minimize.
[2024-06-01 08:41:34] [INFO ] Deduced a trap composed of 15 places in 505 ms of which 5 ms to minimize.
[2024-06-01 08:41:36] [INFO ] Deduced a trap composed of 17 places in 520 ms of which 6 ms to minimize.
[2024-06-01 08:41:36] [INFO ] Deduced a trap composed of 60 places in 527 ms of which 6 ms to minimize.
[2024-06-01 08:41:37] [INFO ] Deduced a trap composed of 53 places in 495 ms of which 5 ms to minimize.
[2024-06-01 08:41:37] [INFO ] Deduced a trap composed of 68 places in 577 ms of which 6 ms to minimize.
[2024-06-01 08:41:38] [INFO ] Deduced a trap composed of 56 places in 576 ms of which 5 ms to minimize.
SMT process timed out in 61634ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61659ms
Starting structural reductions in LI_LTL mode, iteration 1 : 392/663 places, 2104/2424 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 66610 ms. Remains : 392/663 places, 2104/2424 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 419 ms.
Product exploration explored 100000 steps with 0 reset in 407 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 404262 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 1
Probabilistic random walk after 404262 steps, saw 221704 distinct states, run finished after 3004 ms. (steps per millisecond=134 ) properties seen :0
[2024-06-01 08:41:42] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:41:42] [INFO ] Invariant cache hit.
[2024-06-01 08:41:42] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:41:42] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:41:42] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:41:43] [INFO ] Deduced a trap composed of 3 places in 354 ms of which 4 ms to minimize.
[2024-06-01 08:41:44] [INFO ] Deduced a trap composed of 3 places in 339 ms of which 4 ms to minimize.
[2024-06-01 08:41:44] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 3 ms to minimize.
[2024-06-01 08:41:44] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 2 ms to minimize.
[2024-06-01 08:41:44] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:41:45] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 710 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2167 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2833ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 109 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 110 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 395460 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 395460 steps, saw 216946 distinct states, run finished after 3004 ms. (steps per millisecond=131 ) properties seen :0
[2024-06-01 08:41:48] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:41:48] [INFO ] Invariant cache hit.
[2024-06-01 08:41:48] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:41:48] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:41:48] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:41:49] [INFO ] Deduced a trap composed of 3 places in 348 ms of which 3 ms to minimize.
[2024-06-01 08:41:50] [INFO ] Deduced a trap composed of 3 places in 363 ms of which 4 ms to minimize.
[2024-06-01 08:41:50] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 3 ms to minimize.
[2024-06-01 08:41:50] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 2 ms to minimize.
[2024-06-01 08:41:50] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:41:51] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 710 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2478 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 3085ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 106 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 111 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 110 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 08:41:52] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:41:52] [INFO ] Invariant cache hit.
[2024-06-01 08:41:52] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-06-01 08:41:52] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:41:52] [INFO ] Invariant cache hit.
[2024-06-01 08:41:53] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:41:56] [INFO ] Implicit Places using invariants and state equation in 3863 ms returned []
Implicit Place search using SMT with State Equation took 4714 ms to find 0 implicit places.
[2024-06-01 08:41:56] [INFO ] Redundant transitions in 88 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-06-01 08:41:56] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:41:56] [INFO ] Invariant cache hit.
[2024-06-01 08:41:56] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:42:27] [INFO ] Deduced a trap composed of 3 places in 533 ms of which 5 ms to minimize.
[2024-06-01 08:42:27] [INFO ] Deduced a trap composed of 3 places in 300 ms of which 7 ms to minimize.
[2024-06-01 08:42:27] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 3 ms to minimize.
[2024-06-01 08:42:27] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 2 ms to minimize.
[2024-06-01 08:42:27] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:42:28] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-06-01 08:42:28] [INFO ] Deduced a trap composed of 43 places in 331 ms of which 4 ms to minimize.
[2024-06-01 08:42:28] [INFO ] Deduced a trap composed of 71 places in 384 ms of which 4 ms to minimize.
SMT process timed out in 32074ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 32110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37036 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 43 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-06-01 08:42:28] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 08:42:29] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-06-01 08:42:29] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:42:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-06-01 08:42:29] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:42:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 08:42:29] [INFO ] After 17ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:42:29] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:42:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 1
[2024-06-01 08:42:29] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:42:29] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 422 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 119 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 08:42:29] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-06-01 08:42:29] [INFO ] Computed 25 invariants in 3 ms
[2024-06-01 08:42:30] [INFO ] Implicit Places using invariants in 958 ms returned []
[2024-06-01 08:42:30] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:42:30] [INFO ] Invariant cache hit.
[2024-06-01 08:42:31] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:42:34] [INFO ] Implicit Places using invariants and state equation in 3840 ms returned []
Implicit Place search using SMT with State Equation took 4806 ms to find 0 implicit places.
[2024-06-01 08:42:34] [INFO ] Redundant transitions in 84 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-06-01 08:42:34] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:42:34] [INFO ] Invariant cache hit.
[2024-06-01 08:42:34] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:43:02] [INFO ] Deduced a trap composed of 3 places in 494 ms of which 3 ms to minimize.
[2024-06-01 08:43:02] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 2 ms to minimize.
[2024-06-01 08:43:02] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-01 08:43:02] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 3 ms to minimize.
[2024-06-01 08:43:02] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 2 ms to minimize.
[2024-06-01 08:43:02] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-06-01 08:43:03] [INFO ] Deduced a trap composed of 43 places in 435 ms of which 5 ms to minimize.
[2024-06-01 08:43:03] [INFO ] Deduced a trap composed of 71 places in 364 ms of which 5 ms to minimize.
[2024-06-01 08:43:04] [INFO ] Deduced a trap composed of 28 places in 361 ms of which 4 ms to minimize.
[2024-06-01 08:43:04] [INFO ] Deduced a trap composed of 61 places in 336 ms of which 4 ms to minimize.
[2024-06-01 08:43:04] [INFO ] Deduced a trap composed of 22 places in 376 ms of which 5 ms to minimize.
[2024-06-01 08:43:05] [INFO ] Deduced a trap composed of 24 places in 379 ms of which 5 ms to minimize.
[2024-06-01 08:43:05] [INFO ] Deduced a trap composed of 29 places in 362 ms of which 5 ms to minimize.
[2024-06-01 08:43:06] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 3 ms to minimize.
[2024-06-01 08:43:06] [INFO ] Deduced a trap composed of 54 places in 256 ms of which 3 ms to minimize.
SMT process timed out in 31592ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31658ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36680 ms. Remains : 392/392 places, 2104/2104 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 371547 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 371547 steps, saw 205441 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-06-01 08:43:09] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:43:09] [INFO ] Invariant cache hit.
[2024-06-01 08:43:09] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:43:09] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:43:09] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:43:11] [INFO ] Deduced a trap composed of 3 places in 354 ms of which 4 ms to minimize.
[2024-06-01 08:43:11] [INFO ] Deduced a trap composed of 3 places in 354 ms of which 4 ms to minimize.
[2024-06-01 08:43:11] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 3 ms to minimize.
[2024-06-01 08:43:12] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 2 ms to minimize.
[2024-06-01 08:43:12] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:43:12] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 710 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2477 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 3287ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 112 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 111 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 371133 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 371133 steps, saw 205260 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-06-01 08:43:16] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:43:16] [INFO ] Invariant cache hit.
[2024-06-01 08:43:16] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:43:16] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:43:16] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:43:17] [INFO ] Deduced a trap composed of 3 places in 361 ms of which 4 ms to minimize.
[2024-06-01 08:43:18] [INFO ] Deduced a trap composed of 3 places in 370 ms of which 4 ms to minimize.
[2024-06-01 08:43:18] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 3 ms to minimize.
[2024-06-01 08:43:18] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 2 ms to minimize.
[2024-06-01 08:43:18] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:43:19] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 710 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2431 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 3120ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 107 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 109 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 109 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 08:43:19] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:43:19] [INFO ] Invariant cache hit.
[2024-06-01 08:43:20] [INFO ] Implicit Places using invariants in 971 ms returned []
[2024-06-01 08:43:20] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:43:20] [INFO ] Invariant cache hit.
[2024-06-01 08:43:21] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:43:24] [INFO ] Implicit Places using invariants and state equation in 3659 ms returned []
Implicit Place search using SMT with State Equation took 4633 ms to find 0 implicit places.
[2024-06-01 08:43:24] [INFO ] Redundant transitions in 87 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-06-01 08:43:24] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:43:24] [INFO ] Invariant cache hit.
[2024-06-01 08:43:24] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:43:49] [INFO ] Deduced a trap composed of 3 places in 467 ms of which 6 ms to minimize.
[2024-06-01 08:43:50] [INFO ] Deduced a trap composed of 3 places in 315 ms of which 7 ms to minimize.
[2024-06-01 08:43:50] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 3 ms to minimize.
[2024-06-01 08:43:50] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
[2024-06-01 08:43:50] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:43:50] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:43:51] [INFO ] Deduced a trap composed of 43 places in 331 ms of which 4 ms to minimize.
[2024-06-01 08:43:51] [INFO ] Deduced a trap composed of 71 places in 379 ms of which 4 ms to minimize.
[2024-06-01 08:43:52] [INFO ] Deduced a trap composed of 28 places in 417 ms of which 5 ms to minimize.
[2024-06-01 08:43:52] [INFO ] Deduced a trap composed of 61 places in 373 ms of which 5 ms to minimize.
[2024-06-01 08:43:53] [INFO ] Deduced a trap composed of 22 places in 407 ms of which 5 ms to minimize.
[2024-06-01 08:43:53] [INFO ] Deduced a trap composed of 24 places in 411 ms of which 5 ms to minimize.
[2024-06-01 08:43:53] [INFO ] Deduced a trap composed of 29 places in 405 ms of which 5 ms to minimize.
[2024-06-01 08:43:54] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 3 ms to minimize.
[2024-06-01 08:43:54] [INFO ] Deduced a trap composed of 54 places in 271 ms of which 4 ms to minimize.
[2024-06-01 08:43:54] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 4 ms to minimize.
[2024-06-01 08:43:54] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 2 ms to minimize.
[2024-06-01 08:43:55] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 43 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:44:02] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 4 ms to minimize.
[2024-06-01 08:44:02] [INFO ] Deduced a trap composed of 50 places in 229 ms of which 3 ms to minimize.
[2024-06-01 08:44:02] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 3 ms to minimize.
[2024-06-01 08:44:02] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 2 ms to minimize.
[2024-06-01 08:44:03] [INFO ] Deduced a trap composed of 54 places in 301 ms of which 4 ms to minimize.
[2024-06-01 08:44:04] [INFO ] Deduced a trap composed of 48 places in 253 ms of which 4 ms to minimize.
[2024-06-01 08:44:05] [INFO ] Deduced a trap composed of 69 places in 350 ms of which 4 ms to minimize.
[2024-06-01 08:44:06] [INFO ] Deduced a trap composed of 21 places in 386 ms of which 5 ms to minimize.
[2024-06-01 08:44:07] [INFO ] Deduced a trap composed of 44 places in 419 ms of which 5 ms to minimize.
[2024-06-01 08:44:07] [INFO ] Deduced a trap composed of 87 places in 415 ms of which 5 ms to minimize.
[2024-06-01 08:44:08] [INFO ] Deduced a trap composed of 73 places in 433 ms of which 5 ms to minimize.
[2024-06-01 08:44:08] [INFO ] Deduced a trap composed of 70 places in 348 ms of which 5 ms to minimize.
[2024-06-01 08:44:09] [INFO ] Deduced a trap composed of 67 places in 393 ms of which 5 ms to minimize.
[2024-06-01 08:44:09] [INFO ] Deduced a trap composed of 69 places in 407 ms of which 5 ms to minimize.
[2024-06-01 08:44:10] [INFO ] Deduced a trap composed of 89 places in 440 ms of which 5 ms to minimize.
[2024-06-01 08:44:10] [INFO ] Deduced a trap composed of 70 places in 448 ms of which 5 ms to minimize.
[2024-06-01 08:44:10] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 2 ms to minimize.
[2024-06-01 08:44:11] [INFO ] Deduced a trap composed of 3 places in 540 ms of which 5 ms to minimize.
[2024-06-01 08:44:12] [INFO ] Deduced a trap composed of 66 places in 420 ms of which 5 ms to minimize.
[2024-06-01 08:44:12] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:44:15] [INFO ] Deduced a trap composed of 61 places in 230 ms of which 3 ms to minimize.
[2024-06-01 08:44:15] [INFO ] Deduced a trap composed of 11 places in 564 ms of which 5 ms to minimize.
[2024-06-01 08:44:16] [INFO ] Deduced a trap composed of 73 places in 555 ms of which 5 ms to minimize.
[2024-06-01 08:44:17] [INFO ] Deduced a trap composed of 75 places in 496 ms of which 5 ms to minimize.
[2024-06-01 08:44:17] [INFO ] Deduced a trap composed of 73 places in 504 ms of which 5 ms to minimize.
[2024-06-01 08:44:18] [INFO ] Deduced a trap composed of 73 places in 440 ms of which 5 ms to minimize.
[2024-06-01 08:44:18] [INFO ] Deduced a trap composed of 67 places in 414 ms of which 6 ms to minimize.
[2024-06-01 08:44:19] [INFO ] Deduced a trap composed of 76 places in 480 ms of which 5 ms to minimize.
[2024-06-01 08:44:19] [INFO ] Deduced a trap composed of 26 places in 455 ms of which 5 ms to minimize.
[2024-06-01 08:44:20] [INFO ] Deduced a trap composed of 14 places in 536 ms of which 6 ms to minimize.
[2024-06-01 08:44:20] [INFO ] Deduced a trap composed of 13 places in 556 ms of which 5 ms to minimize.
[2024-06-01 08:44:21] [INFO ] Deduced a trap composed of 61 places in 453 ms of which 5 ms to minimize.
[2024-06-01 08:44:22] [INFO ] Deduced a trap composed of 15 places in 546 ms of which 6 ms to minimize.
[2024-06-01 08:44:23] [INFO ] Deduced a trap composed of 17 places in 547 ms of which 6 ms to minimize.
[2024-06-01 08:44:24] [INFO ] Deduced a trap composed of 60 places in 523 ms of which 5 ms to minimize.
[2024-06-01 08:44:24] [INFO ] Deduced a trap composed of 53 places in 491 ms of which 5 ms to minimize.
[2024-06-01 08:44:25] [INFO ] Deduced a trap composed of 68 places in 552 ms of which 4 ms to minimize.
[2024-06-01 08:44:25] [INFO ] Deduced a trap composed of 56 places in 374 ms of which 4 ms to minimize.
[2024-06-01 08:44:26] [INFO ] Deduced a trap composed of 56 places in 573 ms of which 5 ms to minimize.
SMT process timed out in 61738ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61773ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66619 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 35 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-06-01 08:44:26] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 08:44:26] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-06-01 08:44:26] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:44:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-06-01 08:44:26] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:44:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 08:44:26] [INFO ] After 15ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:44:26] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:44:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
TRAPS : Iteration 1
[2024-06-01 08:44:26] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:44:26] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 385 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 410 ms.
Product exploration explored 100000 steps with 0 reset in 398 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 70 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 08:44:27] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-06-01 08:44:27] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 08:44:28] [INFO ] Implicit Places using invariants in 974 ms returned []
[2024-06-01 08:44:28] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:44:28] [INFO ] Invariant cache hit.
[2024-06-01 08:44:29] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:44:32] [INFO ] Implicit Places using invariants and state equation in 3850 ms returned []
Implicit Place search using SMT with State Equation took 4826 ms to find 0 implicit places.
[2024-06-01 08:44:32] [INFO ] Redundant transitions in 87 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-06-01 08:44:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 08:44:32] [INFO ] Invariant cache hit.
[2024-06-01 08:44:32] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 08:45:01] [INFO ] Deduced a trap composed of 3 places in 493 ms of which 5 ms to minimize.
[2024-06-01 08:45:01] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 3 ms to minimize.
[2024-06-01 08:45:02] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 2 ms to minimize.
[2024-06-01 08:45:02] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 2 ms to minimize.
[2024-06-01 08:45:02] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 1 ms to minimize.
[2024-06-01 08:45:02] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-06-01 08:45:02] [INFO ] Deduced a trap composed of 43 places in 280 ms of which 4 ms to minimize.
[2024-06-01 08:45:03] [INFO ] Deduced a trap composed of 71 places in 319 ms of which 4 ms to minimize.
[2024-06-01 08:45:03] [INFO ] Deduced a trap composed of 28 places in 339 ms of which 4 ms to minimize.
[2024-06-01 08:45:03] [INFO ] Deduced a trap composed of 61 places in 353 ms of which 5 ms to minimize.
[2024-06-01 08:45:04] [INFO ] Deduced a trap composed of 22 places in 451 ms of which 5 ms to minimize.
SMT process timed out in 31632ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31667ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36662 ms. Remains : 392/392 places, 2104/2104 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-12 finished in 273221 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&&(G(p2)||p1)))))'
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((X(X(F(p1)))||p0))))'
[2024-06-01 08:45:05] [INFO ] Flatten gal took : 163 ms
[2024-06-01 08:45:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 08:45:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 663 places, 2424 transitions and 11872 arcs took 39 ms.
Total runtime 1621125 ms.
There are residual formulas that ITS could not solve within timeout
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
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="EisenbergMcGuire-PT-08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-08, 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 r492-smll-171636266300188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-08.tgz
mv EisenbergMcGuire-PT-08 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 ;