About the Execution of LTSMin+red for EisenbergMcGuire-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2150.964 | 3600000.00 | 6988786.00 | 8268.70 | F?TFF?TTFTFTF?FT | 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-171636266300172.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-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300172
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K 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 3.0K 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 13K Apr 12 16:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 16:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 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 753K 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-06-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717224884163
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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:54:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:54:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:54:46] [INFO ] Load time of PNML (sax parser for PT used): 279 ms
[2024-06-01 06:54:46] [INFO ] Transformed 414 places.
[2024-06-01 06:54:46] [INFO ] Transformed 1296 transitions.
[2024-06-01 06:54:46] [INFO ] Found NUPN structural information;
[2024-06-01 06:54:46] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 98 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 390 transition count 1152
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 390 transition count 1152
Applied a total of 48 rules in 111 ms. Remains 390 /414 variables (removed 24) and now considering 1152/1296 (removed 144) transitions.
[2024-06-01 06:54:46] [INFO ] Flow matrix only has 558 transitions (discarded 594 similar events)
// Phase 1: matrix 558 rows 390 cols
[2024-06-01 06:54:46] [INFO ] Computed 19 invariants in 30 ms
[2024-06-01 06:54:47] [INFO ] Implicit Places using invariants in 771 ms returned []
[2024-06-01 06:54:47] [INFO ] Flow matrix only has 558 transitions (discarded 594 similar events)
[2024-06-01 06:54:47] [INFO ] Invariant cache hit.
[2024-06-01 06:54:48] [INFO ] State equation strengthened by 194 read => feed constraints.
[2024-06-01 06:54:48] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 2086 ms to find 0 implicit places.
Running 1146 sub problems to find dead transitions.
[2024-06-01 06:54:49] [INFO ] Flow matrix only has 558 transitions (discarded 594 similar events)
[2024-06-01 06:54:49] [INFO ] Invariant cache hit.
[2024-06-01 06:54:49] [INFO ] State equation strengthened by 194 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
[2024-06-01 06:55:00] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 29 ms to minimize.
[2024-06-01 06:55:00] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:55:01] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:55:01] [INFO ] Deduced a trap composed of 32 places in 303 ms of which 4 ms to minimize.
[2024-06-01 06:55:01] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:55:02] [INFO ] Deduced a trap composed of 77 places in 248 ms of which 3 ms to minimize.
[2024-06-01 06:55:02] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 3 ms to minimize.
[2024-06-01 06:55:02] [INFO ] Deduced a trap composed of 59 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:55:02] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:55:02] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:55:03] [INFO ] Deduced a trap composed of 59 places in 178 ms of which 4 ms to minimize.
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 52 places in 314 ms of which 6 ms to minimize.
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 78 places in 225 ms of which 3 ms to minimize.
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 86 places in 259 ms of which 3 ms to minimize.
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 110 places in 226 ms of which 4 ms to minimize.
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 93 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 79 places in 275 ms of which 5 ms to minimize.
[2024-06-01 06:55:06] [INFO ] Deduced a trap composed of 63 places in 277 ms of which 3 ms to minimize.
[2024-06-01 06:55:06] [INFO ] Deduced a trap composed of 56 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:55:06] [INFO ] Deduced a trap composed of 102 places in 279 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
[2024-06-01 06:55:07] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:55:07] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 4 ms to minimize.
[2024-06-01 06:55:07] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:55:07] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 111 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 77 places in 215 ms of which 4 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 68 places in 220 ms of which 3 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 68 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:55:10] [INFO ] Deduced a trap composed of 83 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:55:10] [INFO ] Deduced a trap composed of 86 places in 216 ms of which 4 ms to minimize.
[2024-06-01 06:55:10] [INFO ] Deduced a trap composed of 61 places in 185 ms of which 4 ms to minimize.
[2024-06-01 06:55:10] [INFO ] Deduced a trap composed of 54 places in 197 ms of which 4 ms to minimize.
[2024-06-01 06:55:11] [INFO ] Deduced a trap composed of 58 places in 185 ms of which 5 ms to minimize.
[2024-06-01 06:55:11] [INFO ] Deduced a trap composed of 77 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:55:11] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:55:11] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:55:11] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:55:12] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.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 1.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 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 390/948 variables, and 59 constraints, problems are : Problem set: 0 solved, 1146 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/390 constraints, ReadFeed: 0/194 constraints, PredecessorRefiner: 1146/1146 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 5 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 101 places in 254 ms of which 4 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 103 places in 269 ms of which 3 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 105 places in 219 ms of which 3 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 70 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 94 places in 262 ms of which 4 ms to minimize.
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 97 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 88 places in 257 ms of which 3 ms to minimize.
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 72 places in 270 ms of which 3 ms to minimize.
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 92 places in 268 ms of which 4 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 114 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 95 places in 251 ms of which 4 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 101 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 107 places in 240 ms of which 3 ms to minimize.
[2024-06-01 06:55:27] [INFO ] Deduced a trap composed of 79 places in 223 ms of which 3 ms to minimize.
[2024-06-01 06:55:27] [INFO ] Deduced a trap composed of 48 places in 241 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
[2024-06-01 06:55:28] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 80 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 78 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 74 places in 212 ms of which 4 ms to minimize.
[2024-06-01 06:55:30] [INFO ] Deduced a trap composed of 61 places in 216 ms of which 4 ms to minimize.
[2024-06-01 06:55:30] [INFO ] Deduced a trap composed of 88 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:55:30] [INFO ] Deduced a trap composed of 92 places in 258 ms of which 3 ms to minimize.
[2024-06-01 06:55:30] [INFO ] Deduced a trap composed of 63 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:55:31] [INFO ] Deduced a trap composed of 43 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:55:31] [INFO ] Deduced a trap composed of 77 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:55:31] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:55:31] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:55:31] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:55:31] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 3 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 3 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 77 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 78 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:55:33] [INFO ] Deduced a trap composed of 79 places in 199 ms of which 4 ms to minimize.
[2024-06-01 06:55:33] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:55:33] [INFO ] Deduced a trap composed of 89 places in 196 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
[2024-06-01 06:55:35] [INFO ] Deduced a trap composed of 56 places in 292 ms of which 3 ms to minimize.
[2024-06-01 06:55:35] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 4 ms to minimize.
[2024-06-01 06:55:36] [INFO ] Deduced a trap composed of 91 places in 211 ms of which 4 ms to minimize.
[2024-06-01 06:55:36] [INFO ] Deduced a trap composed of 84 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:55:36] [INFO ] Deduced a trap composed of 84 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:55:36] [INFO ] Deduced a trap composed of 78 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:55:37] [INFO ] Deduced a trap composed of 69 places in 255 ms of which 3 ms to minimize.
[2024-06-01 06:55:37] [INFO ] Deduced a trap composed of 82 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:55:37] [INFO ] Deduced a trap composed of 120 places in 288 ms of which 4 ms to minimize.
[2024-06-01 06:55:38] [INFO ] Deduced a trap composed of 29 places in 274 ms of which 4 ms to minimize.
[2024-06-01 06:55:38] [INFO ] Deduced a trap composed of 82 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:55:38] [INFO ] Deduced a trap composed of 79 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 46 places in 228 ms of which 3 ms to minimize.
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 90 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:55:40] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 4 ms to minimize.
[2024-06-01 06:55:40] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:55:40] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:55:40] [INFO ] Deduced a trap composed of 87 places in 243 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 111 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 55 places in 257 ms of which 3 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 95 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 99 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 76 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 4 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 75 places in 265 ms of which 3 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 72 places in 224 ms of which 3 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 4 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:55:47] [INFO ] Deduced a trap composed of 82 places in 254 ms of which 3 ms to minimize.
[2024-06-01 06:55:47] [INFO ] Deduced a trap composed of 93 places in 291 ms of which 4 ms to minimize.
[2024-06-01 06:55:47] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:55:48] [INFO ] Deduced a trap composed of 91 places in 291 ms of which 4 ms to minimize.
[2024-06-01 06:55:48] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 4 ms to minimize.
[2024-06-01 06:55:48] [INFO ] Deduced a trap composed of 101 places in 264 ms of which 3 ms to minimize.
[2024-06-01 06:55:48] [INFO ] Deduced a trap composed of 74 places in 248 ms of which 3 ms to minimize.
[2024-06-01 06:55:49] [INFO ] Deduced a trap composed of 67 places in 300 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/948 variables, and 139 constraints, problems are : Problem set: 0 solved, 1146 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/390 constraints, ReadFeed: 0/194 constraints, PredecessorRefiner: 0/1146 constraints, Known Traps: 120/120 constraints]
After SMT, in 60998ms problems are : Problem set: 0 solved, 1146 unsolved
Search for dead transitions found 0 dead transitions in 61053ms
Starting structural reductions in LTL mode, iteration 1 : 390/414 places, 1152/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63294 ms. Remains : 390/414 places, 1152/1296 transitions.
Support contains 52 out of 390 places after structural reductions.
[2024-06-01 06:55:50] [INFO ] Flatten gal took : 136 ms
[2024-06-01 06:55:50] [INFO ] Flatten gal took : 96 ms
[2024-06-01 06:55:50] [INFO ] Input system was already deterministic with 1152 transitions.
RANDOM walk for 40000 steps (8 resets) in 1861 ms. (21 steps per ms) remains 25/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
[2024-06-01 06:55:51] [INFO ] Flow matrix only has 558 transitions (discarded 594 similar events)
[2024-06-01 06:55:51] [INFO ] Invariant cache hit.
[2024-06-01 06:55:51] [INFO ] State equation strengthened by 194 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 344/388 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 2/390 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 558/948 variables, 390/409 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/948 variables, 194/603 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/948 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 0/948 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 948/948 variables, and 603 constraints, problems are : Problem set: 0 solved, 25 unsolved in 2035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 390/390 constraints, ReadFeed: 194/194 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 344/388 variables, 12/13 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 2 solved, 23 unsolved
[2024-06-01 06:55:54] [INFO ] Deduced a trap composed of 26 places in 290 ms of which 4 ms to minimize.
[2024-06-01 06:55:54] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:55:54] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 3 ms to minimize.
[2024-06-01 06:55:54] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:55:55] [INFO ] Deduced a trap composed of 23 places in 317 ms of which 4 ms to minimize.
[2024-06-01 06:55:55] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:55:55] [INFO ] Deduced a trap composed of 3 places in 278 ms of which 5 ms to minimize.
[2024-06-01 06:55:55] [INFO ] Deduced a trap composed of 55 places in 231 ms of which 4 ms to minimize.
[2024-06-01 06:55:55] [INFO ] Deduced a trap composed of 79 places in 284 ms of which 3 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 3 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 51 places in 244 ms of which 3 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 14/31 constraints. Problems are: Problem set: 2 solved, 23 unsolved
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 71 places in 226 ms of which 3 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 51 places in 241 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 2/33 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 2/390 variables, 2/35 constraints. Problems are: Problem set: 2 solved, 23 unsolved
[2024-06-01 06:55:58] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:55:58] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:55:59] [INFO ] Deduced a trap composed of 78 places in 284 ms of which 4 ms to minimize.
SMT process timed out in 7357ms, After SMT, problems are : Problem set: 2 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 390 transition count 1148
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 386 transition count 1148
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 8 place count 386 transition count 1037
Deduced a syphon composed of 111 places in 3 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 230 place count 275 transition count 1037
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 234 place count 271 transition count 1013
Iterating global reduction 2 with 4 rules applied. Total rules applied 238 place count 271 transition count 1013
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 298 place count 241 transition count 983
Applied a total of 298 rules in 187 ms. Remains 241 /390 variables (removed 149) and now considering 983/1152 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 241/390 places, 983/1152 transitions.
RANDOM walk for 40000 steps (8 resets) in 589 ms. (67 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 163527 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :1 out of 21
Probabilistic random walk after 163527 steps, saw 62568 distinct states, run finished after 3006 ms. (steps per millisecond=54 ) properties seen :1
[2024-06-01 06:56:02] [INFO ] Flow matrix only has 389 transitions (discarded 594 similar events)
// Phase 1: matrix 389 rows 241 cols
[2024-06-01 06:56:02] [INFO ] Computed 19 invariants in 5 ms
[2024-06-01 06:56:02] [INFO ] State equation strengthened by 174 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 202/239 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 2/241 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 389/630 variables, 241/260 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/630 variables, 174/434 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/630 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/630 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 630/630 variables, and 434 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1153 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 241/241 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 202/239 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 4 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 2 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 2 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:56:06] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:56:06] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 2 ms to minimize.
[2024-06-01 06:56:06] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:56:06] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:56:06] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 2 ms to minimize.
[2024-06-01 06:56:07] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:56:07] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:07] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:56:07] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:07] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:08] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:56:08] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:56:08] [INFO ] Deduced a trap composed of 97 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:56:08] [INFO ] Deduced a trap composed of 88 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:56:08] [INFO ] Deduced a trap composed of 80 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:56:09] [INFO ] Deduced a trap composed of 72 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:56:09] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 2/241 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:09] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:56:09] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:56:09] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:56:10] [INFO ] Deduced a trap composed of 72 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:56:10] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:56:10] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:56:10] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:56:10] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:56:10] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:56:11] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 2 ms to minimize.
[2024-06-01 06:56:11] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:56:11] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:11] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:56:11] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:11] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:56:12] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:56:12] [INFO ] Deduced a trap composed of 76 places in 196 ms of which 2 ms to minimize.
[2024-06-01 06:56:12] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:12] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 2 ms to minimize.
[2024-06-01 06:56:13] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:56:13] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 389/630 variables, 241/311 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/630 variables, 174/485 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/630 variables, 20/505 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/630 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/630 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/630 variables, 2/508 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/630 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:17] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/630 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/630 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 24 (OVERLAPS) 0/630 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 630/630 variables, and 510 constraints, problems are : Problem set: 0 solved, 20 unsolved in 14926 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 241/241 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 56/56 constraints]
After SMT, in 16121ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 2345 ms.
Support contains 37 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 983/983 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 241 transition count 981
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 239 transition count 981
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 238 transition count 975
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 238 transition count 975
Applied a total of 6 rules in 82 ms. Remains 238 /241 variables (removed 3) and now considering 975/983 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 238/241 places, 975/983 transitions.
RANDOM walk for 40000 steps (8 resets) in 391 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 210350 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 20
Probabilistic random walk after 210350 steps, saw 71420 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2024-06-01 06:56:24] [INFO ] Flow matrix only has 381 transitions (discarded 594 similar events)
// Phase 1: matrix 381 rows 238 cols
[2024-06-01 06:56:24] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 06:56:24] [INFO ] State equation strengthened by 169 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 199/236 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 2/238 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 381/619 variables, 238/257 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/619 variables, 169/426 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/619 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:25] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:56:25] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:56:25] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/619 variables, 3/429 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/619 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 0/619 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 619/619 variables, and 429 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 238/238 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 199/236 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:56:27] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:56:27] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:56:27] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:56:27] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:27] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 2/238 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 1 ms to minimize.
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 68 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 69 places in 175 ms of which 2 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 66 places in 177 ms of which 2 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 2 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 61 places in 191 ms of which 2 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 2 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:56:32] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:56:32] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:56:32] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:56:32] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 4 ms to minimize.
[2024-06-01 06:56:32] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:32] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:56:33] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:56:33] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 2 ms to minimize.
[2024-06-01 06:56:33] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 2 ms to minimize.
[2024-06-01 06:56:33] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:56:33] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 381/619 variables, 238/305 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/619 variables, 169/474 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/619 variables, 20/494 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/619 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:36] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:56:36] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/619 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/619 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 06:56:37] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 3 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/619 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/619 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 23 (OVERLAPS) 0/619 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 619/619 variables, and 497 constraints, problems are : Problem set: 0 solved, 20 unsolved in 12881 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 238/238 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 51/51 constraints]
After SMT, in 14933ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 3021 ms.
Support contains 37 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 975/975 transitions.
Applied a total of 0 rules in 49 ms. Remains 238 /238 variables (removed 0) and now considering 975/975 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 238/238 places, 975/975 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 975/975 transitions.
Applied a total of 0 rules in 37 ms. Remains 238 /238 variables (removed 0) and now considering 975/975 (removed 0) transitions.
[2024-06-01 06:56:42] [INFO ] Flow matrix only has 381 transitions (discarded 594 similar events)
[2024-06-01 06:56:42] [INFO ] Invariant cache hit.
[2024-06-01 06:56:42] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-06-01 06:56:42] [INFO ] Flow matrix only has 381 transitions (discarded 594 similar events)
[2024-06-01 06:56:42] [INFO ] Invariant cache hit.
[2024-06-01 06:56:42] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-06-01 06:56:43] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2024-06-01 06:56:43] [INFO ] Redundant transitions in 68 ms returned []
Running 969 sub problems to find dead transitions.
[2024-06-01 06:56:43] [INFO ] Flow matrix only has 381 transitions (discarded 594 similar events)
[2024-06-01 06:56:43] [INFO ] Invariant cache hit.
[2024-06-01 06:56:43] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 969 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 969 unsolved
[2024-06-01 06:56:50] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:56:50] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:56:50] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:56:50] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:51] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:56:51] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:56:51] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:56:51] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:56:51] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:56:51] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 69 places in 172 ms of which 2 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 2 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 88 places in 162 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 969 unsolved
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:56:55] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:56:59] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:56:59] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 2 ms to minimize.
[2024-06-01 06:56:59] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:57:00] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:57:00] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:57:00] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 2 ms to minimize.
[2024-06-01 06:57:00] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:57:01] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:57:01] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 2 ms to minimize.
[2024-06-01 06:57:01] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 2 ms to minimize.
[2024-06-01 06:57:01] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 2 ms to minimize.
[2024-06-01 06:57:01] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 2 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 2 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 969 unsolved
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:57:13] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/619 variables, and 62 constraints, problems are : Problem set: 0 solved, 969 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/238 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 969/969 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 969 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 969 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 969 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 43/62 constraints. Problems are: Problem set: 0 solved, 969 unsolved
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 54 places in 182 ms of which 2 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 69 places in 197 ms of which 2 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 74 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 61 places in 163 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 969 unsolved
[2024-06-01 06:57:28] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:57:32] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:57:34] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:57:34] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:57:34] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:57:34] [INFO ] Deduced a trap composed of 61 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:57:35] [INFO ] Deduced a trap composed of 69 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:57:35] [INFO ] Deduced a trap composed of 73 places in 174 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 969 unsolved
[2024-06-01 06:57:40] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 1 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:57:41] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:57:43] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:57:43] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:57:44] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 2 ms to minimize.
SMT process timed out in 60519ms, After SMT, problems are : Problem set: 0 solved, 969 unsolved
Search for dead transitions found 0 dead transitions in 60533ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61623 ms. Remains : 238/238 places, 975/975 transitions.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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))&&F(p1)))'
Support contains 4 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 385 transition count 1122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 385 transition count 1122
Applied a total of 10 rules in 28 ms. Remains 385 /390 variables (removed 5) and now considering 1122/1152 (removed 30) transitions.
[2024-06-01 06:57:44] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2024-06-01 06:57:44] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 06:57:44] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-06-01 06:57:44] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-06-01 06:57:44] [INFO ] Invariant cache hit.
[2024-06-01 06:57:45] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-06-01 06:57:46] [INFO ] Implicit Places using invariants and state equation in 1422 ms returned []
Implicit Place search using SMT with State Equation took 1785 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-06-01 06:57:46] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-06-01 06:57:46] [INFO ] Invariant cache hit.
[2024-06-01 06:57:46] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 3 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 63 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 58 places in 209 ms of which 4 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 64 places in 220 ms of which 3 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 58 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 88 places in 187 ms of which 4 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 73 places in 282 ms of which 4 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 104 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 57 places in 233 ms of which 4 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 75 places in 226 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:58:02] [INFO ] Deduced a trap composed of 51 places in 286 ms of which 4 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 81 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 57 places in 221 ms of which 3 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 3 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 100 places in 275 ms of which 4 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 79 places in 239 ms of which 3 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 62 places in 255 ms of which 3 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 53 places in 251 ms of which 3 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 4 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 4 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 3 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 86 places in 226 ms of which 3 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 43 places in 242 ms of which 3 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/913 variables, and 59 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/385 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 1116/1116 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 72 places in 224 ms of which 3 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:58:21] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:21] [INFO ] Deduced a trap composed of 85 places in 304 ms of which 4 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 107 places in 294 ms of which 4 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 96 places in 294 ms of which 4 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 89 places in 297 ms of which 4 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 86 places in 294 ms of which 4 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 3 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 55 places in 230 ms of which 3 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 108 places in 286 ms of which 4 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 91 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 57 places in 293 ms of which 4 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 72 places in 300 ms of which 4 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 98 places in 227 ms of which 4 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 70 places in 289 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 86 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 90 places in 219 ms of which 4 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 86 places in 248 ms of which 3 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 84 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:58:30] [INFO ] Deduced a trap composed of 79 places in 245 ms of which 3 ms to minimize.
[2024-06-01 06:58:30] [INFO ] Deduced a trap composed of 73 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:58:30] [INFO ] Deduced a trap composed of 69 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:58:30] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:58:31] [INFO ] Deduced a trap composed of 71 places in 294 ms of which 4 ms to minimize.
[2024-06-01 06:58:32] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 3 ms to minimize.
[2024-06-01 06:58:34] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:58:34] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 3 ms to minimize.
[2024-06-01 06:58:34] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 3 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 101 places in 265 ms of which 7 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 72 places in 258 ms of which 3 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 88 places in 253 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:58:40] [INFO ] Deduced a trap composed of 96 places in 280 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/913 variables, and 101 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/385 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 0/1116 constraints, Known Traps: 82/82 constraints]
After SMT, in 60579ms problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 60593ms
Starting structural reductions in LTL mode, iteration 1 : 385/390 places, 1122/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62411 ms. Remains : 385/390 places, 1122/1152 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 403 ms.
Product exploration explored 100000 steps with 0 reset in 405 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 p1 p0))), (X p0), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 132 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
[2024-06-01 06:58:48] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-06-01 06:58:48] [INFO ] Invariant cache hit.
[2024-06-01 06:58:48] [INFO ] State equation strengthened by 169 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/70 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 143/213 variables, 70/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 15/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 90/303 variables, 40/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 13/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 263/566 variables, 8/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/570 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/570 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/578 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/578 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 335/913 variables, 275/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/913 variables, 141/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/913 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/913 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 913/913 variables, and 573 constraints, problems are : Problem set: 0 solved, 1 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 385/385 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/70 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 143/213 variables, 70/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 15/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 90/303 variables, 40/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 13/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 263/566 variables, 8/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/570 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/570 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/570 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/578 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/578 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/578 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/578 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 335/913 variables, 275/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/913 variables, 141/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/913 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/913 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 913/913 variables, and 583 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1448 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 385/385 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 1858ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 2 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 1122/1122 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 385 transition count 1116
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 379 transition count 1116
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 379 transition count 1002
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 265 transition count 1002
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 235 transition count 972
Applied a total of 300 rules in 59 ms. Remains 235 /385 variables (removed 150) and now considering 972/1122 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 235/385 places, 972/1122 transitions.
RANDOM walk for 40000 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 615662 steps, run visited all 1 properties in 2739 ms. (steps per millisecond=224 )
Probabilistic random walk after 615662 steps, saw 157001 distinct states, run finished after 2744 ms. (steps per millisecond=224 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 9 factoid took 198 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-06-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-00 finished in 69017 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(p1)||(X(X(p0))&&X(p0)))))'
Support contains 4 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 12 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-06-01 06:58:53] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-06-01 06:58:53] [INFO ] Computed 19 invariants in 6 ms
[2024-06-01 06:58:53] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-06-01 06:58:53] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:58:53] [INFO ] Invariant cache hit.
[2024-06-01 06:58:54] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:58:54] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned []
Implicit Place search using SMT with State Equation took 1676 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 06:58:55] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:58:55] [INFO ] Invariant cache hit.
[2024-06-01 06:58:55] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 3 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 3 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 4 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 96 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 54 places in 283 ms of which 3 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 80 places in 271 ms of which 3 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 72 places in 262 ms of which 3 ms to minimize.
[2024-06-01 06:59:08] [INFO ] Deduced a trap composed of 78 places in 260 ms of which 4 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 2 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:59:09] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 89 places in 241 ms of which 4 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 76 places in 219 ms of which 3 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 86 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 75 places in 229 ms of which 3 ms to minimize.
[2024-06-01 06:59:11] [INFO ] Deduced a trap composed of 76 places in 226 ms of which 3 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 3 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 3 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 86 places in 221 ms of which 3 ms to minimize.
[2024-06-01 06:59:12] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 86 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 86 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 102 places in 250 ms of which 3 ms to minimize.
[2024-06-01 06:59:13] [INFO ] Deduced a trap composed of 72 places in 283 ms of which 3 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 4 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 105 places in 246 ms of which 3 ms to minimize.
[2024-06-01 06:59:14] [INFO ] Deduced a trap composed of 50 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 77 places in 262 ms of which 3 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 100 places in 251 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 06:59:25] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:59:25] [INFO ] Deduced a trap composed of 110 places in 191 ms of which 3 ms to minimize.
SMT process timed out in 30672ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 30686ms
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32376 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 225 ms.
Product exploration explored 100000 steps with 0 reset in 281 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 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 139 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 266 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 133931 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 6
Probabilistic random walk after 133931 steps, saw 86577 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-06-01 06:59:30] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 06:59:30] [INFO ] Invariant cache hit.
[2024-06-01 06:59:30] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 125/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:59:30] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 19/195 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 291/486 variables, 195/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/540 variables, 24/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 13/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 159/699 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/699 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/705 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 201/906 variables, 165/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/906 variables, 103/568 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/906 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/906 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 568 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 125/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:59:31] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/195 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 291/486 variables, 195/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 48/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 54/540 variables, 24/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 13/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 159/699 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 6/705 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/705 variables, 6/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 3 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:59:32] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/705 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/705 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 201/906 variables, 165/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/906 variables, 103/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/906 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/906 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 582 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2513 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 3567ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1054 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 58 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 234/384 places, 966/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 364 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 247758 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 6
Probabilistic random walk after 247758 steps, saw 75985 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-06-01 06:59:38] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-06-01 06:59:38] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 06:59:38] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 8/120 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 216/336 variables, 120/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 48/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 54/390 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 15/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 84/474 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 6/480 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 126/606 variables, 90/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/606 variables, 101/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 417 constraints, problems are : Problem set: 0 solved, 6 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:59:39] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:59:39] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 84/474 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/474 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 6/480 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:59:39] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:59:39] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/480 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 126/606 variables, 90/326 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 101/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/606 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 427 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1347 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 2072ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1078 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 24 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 24 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-06-01 06:59:41] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 06:59:41] [INFO ] Invariant cache hit.
[2024-06-01 06:59:41] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-06-01 06:59:41] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 06:59:41] [INFO ] Invariant cache hit.
[2024-06-01 06:59:42] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 06:59:42] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
[2024-06-01 06:59:42] [INFO ] Redundant transitions in 42 ms returned []
Running 960 sub problems to find dead transitions.
[2024-06-01 06:59:42] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 06:59:42] [INFO ] Invariant cache hit.
[2024-06-01 06:59:42] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 06:59:49] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:59:49] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:59:49] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:59:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:49] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:59:49] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 67 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:59:50] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:59:51] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 60 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:59:56] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:59:57] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:59:57] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:59:57] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 2 ms to minimize.
[2024-06-01 06:59:57] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 5 ms to minimize.
[2024-06-01 06:59:58] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 2 ms to minimize.
[2024-06-01 06:59:58] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 2 ms to minimize.
[2024-06-01 06:59:59] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 2 ms to minimize.
[2024-06-01 06:59:59] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:59:59] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 2 ms to minimize.
[2024-06-01 06:59:59] [INFO ] Deduced a trap composed of 50 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:00:00] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 2 ms to minimize.
[2024-06-01 07:00:00] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:00:00] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:00:00] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 2 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:00:11] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 2 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:00:12] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 58 places in 186 ms of which 2 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 67 places in 212 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 72 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 53/72 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:00:17] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:00:18] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:00:18] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:00:18] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:00:18] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:00:18] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:00:19] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:00:19] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:00:19] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:00:19] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:00:25] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:00:26] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:00:27] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:00:28] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:00:30] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:00:30] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:00:30] [INFO ] Deduced a trap composed of 58 places in 180 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:00:36] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:00:36] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:00:37] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:00:37] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:00:37] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 66 places in 179 ms of which 2 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:00:38] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 55 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:00:39] [INFO ] Deduced a trap composed of 62 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:00:40] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:00:40] [INFO ] Deduced a trap composed of 56 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:00:41] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:00:41] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:00:42] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:00:42] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/606 variables, and 121 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 102/102 constraints]
After SMT, in 60484ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60497ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61928 ms. Remains : 234/234 places, 966/966 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 5 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
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 275 place count 77 transition count 140
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 280 place count 77 transition count 135
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 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 48 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 96 rows 45 cols
[2024-06-01 07:00:43] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 07:00:43] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-06-01 07:00:43] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 07:00:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 07:00:43] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-01 07:00:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:00:43] [INFO ] After 42ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:00:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:00:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
TRAPS : Iteration 1
[2024-06-01 07:00:43] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 07:00:43] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 557 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 137 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 13 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-06-01 07:00:44] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-06-01 07:00:44] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 07:00:44] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-06-01 07:00:44] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:00:44] [INFO ] Invariant cache hit.
[2024-06-01 07:00:44] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:00:46] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 1766 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 07:00:46] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:00:46] [INFO ] Invariant cache hit.
[2024-06-01 07:00:46] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:00:56] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:00:56] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:00:56] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:00:56] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:00:56] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:00:57] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:00:57] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:00:57] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:00:57] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:00:57] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:00:57] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:00:58] [INFO ] Deduced a trap composed of 96 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:00:58] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:00:58] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:00:59] [INFO ] Deduced a trap composed of 54 places in 311 ms of which 4 ms to minimize.
[2024-06-01 07:00:59] [INFO ] Deduced a trap composed of 80 places in 275 ms of which 4 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 72 places in 272 ms of which 4 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 78 places in 284 ms of which 4 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 74 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:01:02] [INFO ] Deduced a trap composed of 89 places in 209 ms of which 3 ms to minimize.
[2024-06-01 07:01:02] [INFO ] Deduced a trap composed of 76 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:01:03] [INFO ] Deduced a trap composed of 86 places in 215 ms of which 4 ms to minimize.
[2024-06-01 07:01:03] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:01:03] [INFO ] Deduced a trap composed of 76 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:01:03] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 3 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 3 places in 256 ms of which 4 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 86 places in 222 ms of which 4 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 86 places in 238 ms of which 3 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 86 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 102 places in 290 ms of which 4 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 72 places in 259 ms of which 4 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 3 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 105 places in 261 ms of which 4 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 50 places in 251 ms of which 4 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 77 places in 267 ms of which 3 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 100 places in 257 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 86 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 91 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 90 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 77 places in 268 ms of which 3 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 58 places in 256 ms of which 3 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 98 places in 254 ms of which 3 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 3 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 55 places in 257 ms of which 3 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 103 places in 251 ms of which 4 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 108 places in 256 ms of which 4 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 3 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 87 places in 247 ms of which 4 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:01:26] [INFO ] Deduced a trap composed of 58 places in 248 ms of which 4 ms to minimize.
[2024-06-01 07:01:27] [INFO ] Deduced a trap composed of 114 places in 272 ms of which 3 ms to minimize.
[2024-06-01 07:01:27] [INFO ] Deduced a trap composed of 93 places in 301 ms of which 4 ms to minimize.
[2024-06-01 07:01:27] [INFO ] Deduced a trap composed of 91 places in 245 ms of which 4 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 93 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 3 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 4 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 84 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 93 places in 261 ms of which 4 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 72 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 82 places in 235 ms of which 3 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 69 places in 236 ms of which 3 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 95 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 96 places in 198 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 89 places in 258 ms of which 3 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 103 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 38 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 113 places in 270 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 60 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 86 places in 181 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 93 places in 249 ms of which 4 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 75 places in 253 ms of which 3 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 78 places in 236 ms of which 3 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 43 places in 307 ms of which 3 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 74 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 70 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 84 places in 240 ms of which 4 ms to minimize.
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 52 places in 240 ms of which 3 ms to minimize.
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 58 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 61 places in 260 ms of which 4 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 52 places in 253 ms of which 3 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 39 places in 276 ms of which 3 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 69 places in 263 ms of which 4 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 55 places in 268 ms of which 3 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 114 places in 267 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:01:45] [INFO ] Deduced a trap composed of 80 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:01:45] [INFO ] Deduced a trap composed of 80 places in 213 ms of which 4 ms to minimize.
[2024-06-01 07:01:45] [INFO ] Deduced a trap composed of 100 places in 265 ms of which 3 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 103 places in 260 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/906 variables, and 124 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/1110 constraints, Known Traps: 105/105 constraints]
After SMT, in 60538ms problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60552ms
Finished structural reductions in LTL mode , in 1 iterations and 62336 ms. Remains : 384/384 places, 1116/1116 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 136 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 123158 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 6
Probabilistic random walk after 123158 steps, saw 79909 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-06-01 07:01:50] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:01:50] [INFO ] Invariant cache hit.
[2024-06-01 07:01:50] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 125/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 19/195 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 291/486 variables, 195/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/540 variables, 24/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 13/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 159/699 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/699 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/705 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 201/906 variables, 165/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/906 variables, 103/568 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/906 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/906 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 568 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1059 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 125/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/195 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 291/486 variables, 195/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 48/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 54/540 variables, 24/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 13/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 159/699 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 6/705 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/705 variables, 6/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:01:52] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:01:52] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:01:52] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:01:52] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:01:52] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:01:53] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:01:53] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/705 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/705 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 201/906 variables, 165/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/906 variables, 103/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/906 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/906 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 582 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2580 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 3671ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1270 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 68 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 234/384 places, 966/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 828 ms. (48 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 206381 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 6
Probabilistic random walk after 206381 steps, saw 69133 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-06-01 07:01:58] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-06-01 07:01:58] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 07:01:58] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 8/120 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 216/336 variables, 120/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 48/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 54/390 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 15/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 84/474 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 6/480 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 126/606 variables, 90/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/606 variables, 101/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 417 constraints, problems are : Problem set: 0 solved, 6 unsolved in 796 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 84/474 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/474 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 6/480 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/480 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 126/606 variables, 90/326 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 101/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/606 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 427 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1404 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 2217ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1202 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 23 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 22 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-06-01 07:02:02] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:02:02] [INFO ] Invariant cache hit.
[2024-06-01 07:02:02] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-06-01 07:02:02] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:02:02] [INFO ] Invariant cache hit.
[2024-06-01 07:02:03] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:02:03] [INFO ] Implicit Places using invariants and state equation in 1116 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
[2024-06-01 07:02:03] [INFO ] Redundant transitions in 17 ms returned []
Running 960 sub problems to find dead transitions.
[2024-06-01 07:02:03] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:02:03] [INFO ] Invariant cache hit.
[2024-06-01 07:02:03] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:02:10] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:02:10] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:02:11] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:02:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:11] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:02:11] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:02:11] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:02:12] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 4 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 3 ms to minimize.
[2024-06-01 07:02:13] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 3 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:02:14] [INFO ] Deduced a trap composed of 59 places in 276 ms of which 3 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 60 places in 264 ms of which 4 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 73 places in 282 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 3 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:02:19] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:02:21] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:02:22] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 43 places in 305 ms of which 4 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 46 places in 304 ms of which 4 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 50 places in 257 ms of which 4 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 44 places in 301 ms of which 4 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 17 places in 301 ms of which 3 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 19 places in 290 ms of which 4 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 3 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 46 places in 293 ms of which 4 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 50 places in 279 ms of which 3 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 44 places in 296 ms of which 4 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 44 places in 276 ms of which 4 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:02:37] [INFO ] Deduced a trap composed of 33 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:02:40] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 47 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 3 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 60 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 55 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 61 places in 246 ms of which 3 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 33 places in 263 ms of which 4 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 51 places in 252 ms of which 7 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 53 places in 282 ms of which 4 ms to minimize.
[2024-06-01 07:02:44] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 3 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 51 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 46 places in 234 ms of which 3 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:02:46] [INFO ] Deduced a trap composed of 51 places in 246 ms of which 4 ms to minimize.
[2024-06-01 07:02:47] [INFO ] Deduced a trap composed of 45 places in 312 ms of which 4 ms to minimize.
[2024-06-01 07:02:47] [INFO ] Deduced a trap composed of 40 places in 275 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 56 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:02:49] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:02:52] [INFO ] Deduced a trap composed of 47 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 53 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 45 places in 248 ms of which 3 ms to minimize.
[2024-06-01 07:02:54] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 4 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 55 places in 258 ms of which 4 ms to minimize.
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 27 places in 291 ms of which 4 ms to minimize.
[2024-06-01 07:02:56] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:02:57] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 3 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 40 places in 252 ms of which 3 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 4 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 37 places in 289 ms of which 4 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 4 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 34 places in 286 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/606 variables, and 99 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 80/80 constraints]
After SMT, in 60510ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60522ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62114 ms. Remains : 234/234 places, 966/966 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
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 275 place count 77 transition count 140
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 280 place count 77 transition count 135
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 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 38 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 96 rows 45 cols
[2024-06-01 07:03:04] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 07:03:04] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 07:03:04] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 07:03:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 07:03:04] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-01 07:03:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:03:04] [INFO ] After 69ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-06-01 07:03:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:03:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
TRAPS : Iteration 1
[2024-06-01 07:03:05] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 07:03:05] [INFO ] After 565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 766 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 138 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 367 ms.
Product exploration explored 100000 steps with 0 reset in 352 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 10 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-06-01 07:03:06] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-06-01 07:03:06] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 07:03:07] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-06-01 07:03:07] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:03:07] [INFO ] Invariant cache hit.
[2024-06-01 07:03:07] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:03:09] [INFO ] Implicit Places using invariants and state equation in 2016 ms returned []
Implicit Place search using SMT with State Equation took 2478 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 07:03:09] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:03:09] [INFO ] Invariant cache hit.
[2024-06-01 07:03:09] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 3 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 34 places in 270 ms of which 3 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 4 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 3 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 4 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 5 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:03:26] [INFO ] Deduced a trap composed of 96 places in 277 ms of which 5 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 29 places in 317 ms of which 4 ms to minimize.
[2024-06-01 07:03:27] [INFO ] Deduced a trap composed of 58 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 54 places in 386 ms of which 6 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 80 places in 385 ms of which 6 ms to minimize.
[2024-06-01 07:03:29] [INFO ] Deduced a trap composed of 72 places in 413 ms of which 6 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 78 places in 395 ms of which 6 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 74 places in 296 ms of which 4 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 50 places in 227 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 74 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 89 places in 415 ms of which 6 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 76 places in 386 ms of which 5 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 86 places in 354 ms of which 5 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 75 places in 364 ms of which 5 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 76 places in 361 ms of which 5 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 5 ms to minimize.
[2024-06-01 07:03:35] [INFO ] Deduced a trap composed of 3 places in 422 ms of which 5 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 86 places in 366 ms of which 5 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:03:36] [INFO ] Deduced a trap composed of 86 places in 400 ms of which 5 ms to minimize.
[2024-06-01 07:03:37] [INFO ] Deduced a trap composed of 86 places in 335 ms of which 5 ms to minimize.
[2024-06-01 07:03:37] [INFO ] Deduced a trap composed of 102 places in 450 ms of which 6 ms to minimize.
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 72 places in 440 ms of which 5 ms to minimize.
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 20 places in 406 ms of which 5 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 105 places in 427 ms of which 5 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 50 places in 406 ms of which 5 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 77 places in 402 ms of which 5 ms to minimize.
SMT process timed out in 30809ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 30831ms
Finished structural reductions in LTL mode , in 1 iterations and 33324 ms. Remains : 384/384 places, 1116/1116 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-01 finished in 287041 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((F(p1)&&p0)))'
Support contains 6 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 19 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-06-01 07:03:40] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:03:40] [INFO ] Invariant cache hit.
[2024-06-01 07:03:40] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-06-01 07:03:40] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:03:40] [INFO ] Invariant cache hit.
[2024-06-01 07:03:41] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:03:42] [INFO ] Implicit Places using invariants and state equation in 2124 ms returned []
Implicit Place search using SMT with State Equation took 2610 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 07:03:43] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:03:43] [INFO ] Invariant cache hit.
[2024-06-01 07:03:43] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 4 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 34 places in 276 ms of which 4 ms to minimize.
[2024-06-01 07:03:58] [INFO ] Deduced a trap composed of 29 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 32 places in 307 ms of which 5 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 3 ms to minimize.
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 23 places in 351 ms of which 5 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:04:01] [INFO ] Deduced a trap composed of 96 places in 298 ms of which 5 ms to minimize.
[2024-06-01 07:04:01] [INFO ] Deduced a trap composed of 29 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:04:01] [INFO ] Deduced a trap composed of 58 places in 291 ms of which 5 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 54 places in 458 ms of which 6 ms to minimize.
[2024-06-01 07:04:03] [INFO ] Deduced a trap composed of 80 places in 411 ms of which 6 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 72 places in 469 ms of which 5 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 78 places in 404 ms of which 5 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 74 places in 297 ms of which 4 ms to minimize.
[2024-06-01 07:04:05] [INFO ] Deduced a trap composed of 50 places in 302 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:04:06] [INFO ] Deduced a trap composed of 74 places in 236 ms of which 4 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 89 places in 393 ms of which 6 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 76 places in 396 ms of which 6 ms to minimize.
[2024-06-01 07:04:09] [INFO ] Deduced a trap composed of 86 places in 372 ms of which 5 ms to minimize.
[2024-06-01 07:04:09] [INFO ] Deduced a trap composed of 75 places in 323 ms of which 5 ms to minimize.
[2024-06-01 07:04:09] [INFO ] Deduced a trap composed of 76 places in 356 ms of which 5 ms to minimize.
[2024-06-01 07:04:10] [INFO ] Deduced a trap composed of 4 places in 440 ms of which 5 ms to minimize.
[2024-06-01 07:04:10] [INFO ] Deduced a trap composed of 3 places in 438 ms of which 5 ms to minimize.
[2024-06-01 07:04:11] [INFO ] Deduced a trap composed of 86 places in 381 ms of which 6 ms to minimize.
[2024-06-01 07:04:11] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:04:11] [INFO ] Deduced a trap composed of 86 places in 388 ms of which 5 ms to minimize.
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 86 places in 327 ms of which 5 ms to minimize.
[2024-06-01 07:04:12] [INFO ] Deduced a trap composed of 102 places in 406 ms of which 6 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 72 places in 412 ms of which 5 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 20 places in 437 ms of which 5 ms to minimize.
[2024-06-01 07:04:13] [INFO ] Deduced a trap composed of 105 places in 411 ms of which 5 ms to minimize.
SMT process timed out in 30962ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 30987ms
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33622 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-03 finished in 33827 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(((p1||X(F(p2)))&&p0)))'
Support contains 7 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 385 transition count 1122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 385 transition count 1122
Applied a total of 10 rules in 19 ms. Remains 385 /390 variables (removed 5) and now considering 1122/1152 (removed 30) transitions.
[2024-06-01 07:04:14] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2024-06-01 07:04:14] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 07:04:14] [INFO ] Implicit Places using invariants in 574 ms returned []
[2024-06-01 07:04:14] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-06-01 07:04:14] [INFO ] Invariant cache hit.
[2024-06-01 07:04:15] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-06-01 07:04:16] [INFO ] Implicit Places using invariants and state equation in 2151 ms returned []
Implicit Place search using SMT with State Equation took 2730 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-06-01 07:04:16] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-06-01 07:04:16] [INFO ] Invariant cache hit.
[2024-06-01 07:04:16] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 07:04:32] [INFO ] Deduced a trap composed of 44 places in 244 ms of which 4 ms to minimize.
[2024-06-01 07:04:32] [INFO ] Deduced a trap composed of 38 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:04:32] [INFO ] Deduced a trap composed of 20 places in 375 ms of which 6 ms to minimize.
[2024-06-01 07:04:33] [INFO ] Deduced a trap composed of 35 places in 402 ms of which 6 ms to minimize.
[2024-06-01 07:04:33] [INFO ] Deduced a trap composed of 74 places in 404 ms of which 5 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 64 places in 369 ms of which 6 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 58 places in 349 ms of which 4 ms to minimize.
[2024-06-01 07:04:35] [INFO ] Deduced a trap composed of 83 places in 374 ms of which 6 ms to minimize.
[2024-06-01 07:04:35] [INFO ] Deduced a trap composed of 23 places in 398 ms of which 5 ms to minimize.
[2024-06-01 07:04:35] [INFO ] Deduced a trap composed of 58 places in 374 ms of which 5 ms to minimize.
[2024-06-01 07:04:36] [INFO ] Deduced a trap composed of 58 places in 367 ms of which 5 ms to minimize.
[2024-06-01 07:04:36] [INFO ] Deduced a trap composed of 72 places in 360 ms of which 5 ms to minimize.
[2024-06-01 07:04:36] [INFO ] Deduced a trap composed of 57 places in 345 ms of which 5 ms to minimize.
[2024-06-01 07:04:37] [INFO ] Deduced a trap composed of 58 places in 310 ms of which 5 ms to minimize.
[2024-06-01 07:04:37] [INFO ] Deduced a trap composed of 74 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:04:39] [INFO ] Deduced a trap composed of 53 places in 457 ms of which 6 ms to minimize.
[2024-06-01 07:04:39] [INFO ] Deduced a trap composed of 76 places in 422 ms of which 6 ms to minimize.
[2024-06-01 07:04:39] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:04:40] [INFO ] Deduced a trap composed of 68 places in 432 ms of which 5 ms to minimize.
[2024-06-01 07:04:40] [INFO ] Deduced a trap composed of 60 places in 426 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:04:41] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 56 places in 382 ms of which 5 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 75 places in 433 ms of which 5 ms to minimize.
[2024-06-01 07:04:43] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 4 ms to minimize.
[2024-06-01 07:04:44] [INFO ] Deduced a trap composed of 57 places in 413 ms of which 5 ms to minimize.
[2024-06-01 07:04:44] [INFO ] Deduced a trap composed of 60 places in 352 ms of which 6 ms to minimize.
[2024-06-01 07:04:45] [INFO ] Deduced a trap composed of 83 places in 362 ms of which 5 ms to minimize.
[2024-06-01 07:04:45] [INFO ] Deduced a trap composed of 65 places in 362 ms of which 6 ms to minimize.
[2024-06-01 07:04:45] [INFO ] Deduced a trap composed of 78 places in 379 ms of which 5 ms to minimize.
[2024-06-01 07:04:46] [INFO ] Deduced a trap composed of 64 places in 378 ms of which 5 ms to minimize.
[2024-06-01 07:04:46] [INFO ] Deduced a trap composed of 52 places in 369 ms of which 5 ms to minimize.
[2024-06-01 07:04:47] [INFO ] Deduced a trap composed of 76 places in 360 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/913 variables, and 53 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/385 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 1116/1116 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 34/53 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 07:04:50] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:04:50] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:04:50] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:04:50] [INFO ] Deduced a trap composed of 57 places in 237 ms of which 4 ms to minimize.
[2024-06-01 07:04:50] [INFO ] Deduced a trap composed of 54 places in 244 ms of which 5 ms to minimize.
[2024-06-01 07:04:52] [INFO ] Deduced a trap composed of 96 places in 444 ms of which 6 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 64 places in 454 ms of which 6 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 98 places in 314 ms of which 5 ms to minimize.
[2024-06-01 07:04:54] [INFO ] Deduced a trap composed of 89 places in 471 ms of which 6 ms to minimize.
[2024-06-01 07:04:54] [INFO ] Deduced a trap composed of 84 places in 456 ms of which 6 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 27 places in 473 ms of which 6 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 24 places in 473 ms of which 6 ms to minimize.
[2024-06-01 07:04:56] [INFO ] Deduced a trap composed of 110 places in 445 ms of which 8 ms to minimize.
[2024-06-01 07:04:56] [INFO ] Deduced a trap composed of 98 places in 443 ms of which 6 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 81 places in 475 ms of which 6 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 93 places in 444 ms of which 6 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 96 places in 451 ms of which 6 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 99 places in 473 ms of which 5 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 95 places in 453 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 94 places in 259 ms of which 4 ms to minimize.
[2024-06-01 07:05:02] [INFO ] Deduced a trap composed of 39 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:05:04] [INFO ] Deduced a trap composed of 38 places in 301 ms of which 4 ms to minimize.
[2024-06-01 07:05:04] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 4 ms to minimize.
[2024-06-01 07:05:04] [INFO ] Deduced a trap composed of 38 places in 298 ms of which 4 ms to minimize.
[2024-06-01 07:05:04] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:05:06] [INFO ] Deduced a trap composed of 43 places in 426 ms of which 6 ms to minimize.
[2024-06-01 07:05:07] [INFO ] Deduced a trap composed of 14 places in 411 ms of which 5 ms to minimize.
[2024-06-01 07:05:07] [INFO ] Deduced a trap composed of 17 places in 423 ms of which 6 ms to minimize.
[2024-06-01 07:05:08] [INFO ] Deduced a trap composed of 32 places in 425 ms of which 6 ms to minimize.
[2024-06-01 07:05:08] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:05:08] [INFO ] Deduced a trap composed of 20 places in 411 ms of which 6 ms to minimize.
[2024-06-01 07:05:11] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/913 variables, and 86 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/385 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 0/1116 constraints, Known Traps: 67/67 constraints]
After SMT, in 60646ms problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 60665ms
Starting structural reductions in LTL mode, iteration 1 : 385/390 places, 1122/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63418 ms. Remains : 385/390 places, 1122/1152 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-04 finished in 63652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((!p0 U (G(!p0)||!p0)) U (G((!p0 U (p1||G(!p0))))||(G(!p2)&&(!p0 U (p1||G(!p0))))))))))'
Support contains 5 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 20 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-06-01 07:05:17] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-06-01 07:05:17] [INFO ] Computed 19 invariants in 5 ms
[2024-06-01 07:05:18] [INFO ] Implicit Places using invariants in 634 ms returned []
[2024-06-01 07:05:18] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:05:18] [INFO ] Invariant cache hit.
[2024-06-01 07:05:18] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:05:20] [INFO ] Implicit Places using invariants and state equation in 1843 ms returned []
Implicit Place search using SMT with State Equation took 2480 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 07:05:20] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:05:20] [INFO ] Invariant cache hit.
[2024-06-01 07:05:20] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:05:35] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:05:35] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 5 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:05:37] [INFO ] Deduced a trap composed of 96 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:05:38] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:05:38] [INFO ] Deduced a trap composed of 58 places in 192 ms of which 4 ms to minimize.
[2024-06-01 07:05:40] [INFO ] Deduced a trap composed of 54 places in 490 ms of which 6 ms to minimize.
[2024-06-01 07:05:40] [INFO ] Deduced a trap composed of 80 places in 437 ms of which 6 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 72 places in 447 ms of which 6 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 78 places in 459 ms of which 6 ms to minimize.
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 74 places in 307 ms of which 4 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 50 places in 308 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 74 places in 241 ms of which 2 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 89 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 76 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 86 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 75 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 76 places in 225 ms of which 4 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 6 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 3 places in 389 ms of which 3 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 86 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:05:46] [INFO ] Deduced a trap composed of 86 places in 324 ms of which 5 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 86 places in 272 ms of which 5 ms to minimize.
[2024-06-01 07:05:47] [INFO ] Deduced a trap composed of 102 places in 414 ms of which 6 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 72 places in 418 ms of which 6 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 20 places in 361 ms of which 6 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 105 places in 266 ms of which 3 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 50 places in 246 ms of which 4 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 77 places in 377 ms of which 5 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 100 places in 359 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 86 places in 348 ms of which 5 ms to minimize.
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 91 places in 300 ms of which 4 ms to minimize.
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 54 places in 254 ms of which 4 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 70 places in 322 ms of which 4 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 90 places in 299 ms of which 4 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:05:59] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 77 places in 423 ms of which 5 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 58 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 98 places in 255 ms of which 3 ms to minimize.
[2024-06-01 07:06:00] [INFO ] Deduced a trap composed of 38 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:06:01] [INFO ] Deduced a trap composed of 55 places in 263 ms of which 4 ms to minimize.
[2024-06-01 07:06:01] [INFO ] Deduced a trap composed of 103 places in 324 ms of which 5 ms to minimize.
[2024-06-01 07:06:01] [INFO ] Deduced a trap composed of 108 places in 321 ms of which 4 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 4 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 87 places in 256 ms of which 3 ms to minimize.
[2024-06-01 07:06:02] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:06:03] [INFO ] Deduced a trap composed of 58 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 114 places in 411 ms of which 6 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 93 places in 306 ms of which 4 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 91 places in 254 ms of which 4 ms to minimize.
[2024-06-01 07:06:05] [INFO ] Deduced a trap composed of 93 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 24 places in 326 ms of which 5 ms to minimize.
[2024-06-01 07:06:06] [INFO ] Deduced a trap composed of 22 places in 370 ms of which 5 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 84 places in 331 ms of which 4 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 93 places in 304 ms of which 4 ms to minimize.
[2024-06-01 07:06:07] [INFO ] Deduced a trap composed of 72 places in 264 ms of which 4 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 82 places in 295 ms of which 4 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 69 places in 324 ms of which 5 ms to minimize.
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 95 places in 313 ms of which 5 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 96 places in 373 ms of which 4 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 89 places in 426 ms of which 6 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 103 places in 427 ms of which 5 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 38 places in 426 ms of which 6 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 113 places in 433 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 90 places in 262 ms of which 5 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 60 places in 301 ms of which 4 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:06:17] [INFO ] Deduced a trap composed of 86 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:06:18] [INFO ] Deduced a trap composed of 93 places in 415 ms of which 6 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 75 places in 415 ms of which 6 ms to minimize.
[2024-06-01 07:06:19] [INFO ] Deduced a trap composed of 78 places in 407 ms of which 6 ms to minimize.
[2024-06-01 07:06:21] [INFO ] Deduced a trap composed of 43 places in 378 ms of which 5 ms to minimize.
SMT process timed out in 61087ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 61109ms
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63612 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 308 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 408 ms.
Product exploration explored 100000 steps with 0 reset in 447 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 p2) p1), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 195 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 452 ms. (88 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 5/5 properties
[2024-06-01 07:06:23] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:06:23] [INFO ] Invariant cache hit.
[2024-06-01 07:06:23] [INFO ] State equation strengthened by 164 read => feed constraints.
Problem apf3 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 124/129 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/195 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 291/486 variables, 195/205 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 46/251 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/251 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 54/540 variables, 24/275 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 15/290 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/290 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/699 variables, 6/296 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/699 variables, 0/296 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/705 variables, 3/299 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/705 variables, 0/299 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 201/906 variables, 165/464 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/906 variables, 103/567 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/906 variables, 0/567 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/906 variables, 0/567 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 567 constraints, problems are : Problem set: 3 solved, 2 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 124/129 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/195 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-06-01 07:06:24] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 291/486 variables, 195/206 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 46/252 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/252 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/540 variables, 24/276 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 15/291 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/291 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 159/699 variables, 6/297 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/699 variables, 0/297 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/705 variables, 3/300 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 2/302 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/705 variables, 0/302 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 201/906 variables, 165/467 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/906 variables, 103/570 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-06-01 07:06:25] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/906 variables, 1/571 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/906 variables, 0/571 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/906 variables, 0/571 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 571 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1366 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 2142ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 239 ms.
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 384 transition count 1111
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 379 transition count 1111
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 10 place count 379 transition count 997
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 238 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 298 place count 235 transition count 967
Applied a total of 298 rules in 84 ms. Remains 235 /384 variables (removed 149) and now considering 967/1116 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 235/384 places, 967/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 1122 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 262262 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 2
Probabilistic random walk after 262262 steps, saw 81530 distinct states, run finished after 3003 ms. (steps per millisecond=87 ) properties seen :0
[2024-06-01 07:06:29] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-06-01 07:06:29] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 07:06:29] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/338 variables, 121/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 46/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 54/392 variables, 24/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 18/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 84/476 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/482 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 126/608 variables, 90/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/608 variables, 100/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/608 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 418 constraints, problems are : Problem set: 0 solved, 2 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:06:30] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:06:30] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 54/392 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 18/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 84/476 variables, 6/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 6/482 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 126/608 variables, 90/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 100/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 422 constraints, problems are : Problem set: 0 solved, 2 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1243ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 117 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 42 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 235/235 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 34 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-06-01 07:06:31] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:06:31] [INFO ] Invariant cache hit.
[2024-06-01 07:06:31] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-06-01 07:06:31] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:06:31] [INFO ] Invariant cache hit.
[2024-06-01 07:06:31] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:06:32] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
[2024-06-01 07:06:32] [INFO ] Redundant transitions in 10 ms returned []
Running 961 sub problems to find dead transitions.
[2024-06-01 07:06:32] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:06:32] [INFO ] Invariant cache hit.
[2024-06-01 07:06:32] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 4 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 4 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 3 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 56 places in 257 ms of which 4 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 4 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 3 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 54 places in 253 ms of which 4 ms to minimize.
[2024-06-01 07:06:47] [INFO ] Deduced a trap composed of 41 places in 266 ms of which 4 ms to minimize.
[2024-06-01 07:06:47] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:06:49] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:06:51] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:06:51] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 3 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 4 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 3 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 4 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 3 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 45 places in 347 ms of which 4 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 45 places in 503 ms of which 3 ms to minimize.
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 90 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 71 places in 332 ms of which 4 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 25 places in 326 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 59 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 52 places in 260 ms of which 3 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 46 places in 232 ms of which 4 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 46 places in 209 ms of which 3 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 52 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 48 places in 215 ms of which 4 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 45 places in 282 ms of which 4 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 2 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 2 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 47 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 4 ms to minimize.
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 3 ms to minimize.
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 44 places in 308 ms of which 4 ms to minimize.
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 44 places in 310 ms of which 4 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 46 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 51 places in 257 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 45 places in 280 ms of which 4 ms to minimize.
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 50 places in 271 ms of which 4 ms to minimize.
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 59 places in 268 ms of which 3 ms to minimize.
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 61 places in 317 ms of which 3 ms to minimize.
[2024-06-01 07:07:30] [INFO ] Deduced a trap composed of 68 places in 325 ms of which 3 ms to minimize.
[2024-06-01 07:07:30] [INFO ] Deduced a trap composed of 62 places in 331 ms of which 4 ms to minimize.
[2024-06-01 07:07:30] [INFO ] Deduced a trap composed of 64 places in 333 ms of which 4 ms to minimize.
[2024-06-01 07:07:31] [INFO ] Deduced a trap composed of 54 places in 324 ms of which 4 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 68 places in 306 ms of which 4 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 63 places in 316 ms of which 3 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 56 places in 307 ms of which 4 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 57 places in 266 ms of which 3 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 51 places in 269 ms of which 3 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 76 places in 252 ms of which 3 ms to minimize.
SMT process timed out in 60608ms, After SMT, problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60619ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62272 ms. Remains : 235/235 places, 967/967 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 864 edges and 235 vertex of which 36 / 235 are part of one of the 6 SCC in 2 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 205 transition count 236
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 80 transition count 164
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 80 transition count 135
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 74 transition count 135
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 292 place count 74 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 298 place count 74 transition count 123
Free-agglomeration rule applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 327 place count 74 transition count 94
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 356 place count 45 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 362 place count 45 transition count 94
Applied a total of 362 rules in 31 ms. Remains 45 /235 variables (removed 190) and now considering 94/967 (removed 873) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 45 cols
[2024-06-01 07:07:33] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 07:07:33] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 07:07:33] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 07:07:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-06-01 07:07:33] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 07:07:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:07:33] [INFO ] After 28ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 1
[2024-06-01 07:07:33] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 07:07:33] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 468 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p2 p1)), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 539 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 9 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-06-01 07:07:34] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-06-01 07:07:34] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 07:07:35] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-06-01 07:07:35] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:07:35] [INFO ] Invariant cache hit.
[2024-06-01 07:07:35] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:07:37] [INFO ] Implicit Places using invariants and state equation in 2034 ms returned []
Implicit Place search using SMT with State Equation took 2576 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 07:07:37] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:07:37] [INFO ] Invariant cache hit.
[2024-06-01 07:07:37] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 32 places in 298 ms of which 5 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 4 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 3 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 23 places in 362 ms of which 6 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 5 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 96 places in 285 ms of which 4 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 5 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 58 places in 320 ms of which 5 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 54 places in 464 ms of which 6 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 80 places in 453 ms of which 6 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 72 places in 435 ms of which 6 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 78 places in 439 ms of which 5 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 74 places in 296 ms of which 5 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 50 places in 320 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 74 places in 247 ms of which 5 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 89 places in 395 ms of which 5 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 76 places in 389 ms of which 5 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 86 places in 375 ms of which 5 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 75 places in 373 ms of which 5 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 76 places in 362 ms of which 5 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 5 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 3 places in 443 ms of which 6 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 86 places in 383 ms of which 5 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 86 places in 371 ms of which 5 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 86 places in 276 ms of which 5 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 102 places in 363 ms of which 6 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 72 places in 392 ms of which 6 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 20 places in 340 ms of which 5 ms to minimize.
SMT process timed out in 30582ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 30601ms
Finished structural reductions in LTL mode , in 1 iterations and 33190 ms. Remains : 384/384 places, 1116/1116 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 229 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 574 ms. (69 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
[2024-06-01 07:08:08] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:08:08] [INFO ] Invariant cache hit.
[2024-06-01 07:08:08] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 124/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/195 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 291/486 variables, 195/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 46/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/540 variables, 24/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 15/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 159/699 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/699 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/705 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 201/906 variables, 165/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/906 variables, 103/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/906 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/906 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 668 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 124/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/195 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 291/486 variables, 195/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 46/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/540 variables, 24/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 15/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 159/699 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/699 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/705 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/705 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 201/906 variables, 165/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/906 variables, 103/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/906 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/906 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 570 constraints, problems are : Problem set: 0 solved, 2 unsolved in 891 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1573ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 168 ms.
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 384 transition count 1111
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 379 transition count 1111
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 10 place count 379 transition count 997
Deduced a syphon composed of 114 places in 2 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 238 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 298 place count 235 transition count 967
Applied a total of 298 rules in 71 ms. Remains 235 /384 variables (removed 149) and now considering 967/1116 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 235/384 places, 967/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 903 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 333648 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 2
Probabilistic random walk after 333648 steps, saw 98655 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-06-01 07:08:13] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-06-01 07:08:13] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 07:08:13] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/338 variables, 121/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 46/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 54/392 variables, 24/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 18/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 84/476 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/482 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 126/608 variables, 90/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/608 variables, 100/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/608 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 418 constraints, problems are : Problem set: 0 solved, 2 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/338 variables, 121/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 46/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 54/392 variables, 24/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 18/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 84/476 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/482 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 126/608 variables, 90/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 100/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 422 constraints, problems are : Problem set: 0 solved, 2 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1412ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 179 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 34 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 235/235 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 35 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-06-01 07:08:15] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:08:15] [INFO ] Invariant cache hit.
[2024-06-01 07:08:16] [INFO ] Implicit Places using invariants in 578 ms returned []
[2024-06-01 07:08:16] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:08:16] [INFO ] Invariant cache hit.
[2024-06-01 07:08:16] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:08:17] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned []
Implicit Place search using SMT with State Equation took 1722 ms to find 0 implicit places.
[2024-06-01 07:08:17] [INFO ] Redundant transitions in 18 ms returned []
Running 961 sub problems to find dead transitions.
[2024-06-01 07:08:17] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:08:17] [INFO ] Invariant cache hit.
[2024-06-01 07:08:17] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 4 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 57 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 50 places in 240 ms of which 3 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 3 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 3 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 4 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 19 places in 314 ms of which 3 ms to minimize.
[2024-06-01 07:08:40] [INFO ] Deduced a trap composed of 17 places in 280 ms of which 3 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 20 places in 270 ms of which 3 ms to minimize.
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 21 places in 275 ms of which 4 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 45 places in 322 ms of which 4 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 45 places in 312 ms of which 3 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 90 places in 343 ms of which 3 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 26 places in 325 ms of which 4 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 71 places in 341 ms of which 4 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 25 places in 310 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 59 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 52 places in 260 ms of which 4 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 3 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 46 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 48 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 52 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 48 places in 268 ms of which 4 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 45 places in 300 ms of which 4 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 3 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 47 places in 289 ms of which 3 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 47 places in 297 ms of which 3 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 59 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 44 places in 333 ms of which 4 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 44 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 44 places in 297 ms of which 3 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 51 places in 246 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 45 places in 282 ms of which 3 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 50 places in 271 ms of which 4 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 59 places in 258 ms of which 3 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 61 places in 297 ms of which 4 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 68 places in 326 ms of which 4 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 62 places in 319 ms of which 4 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 64 places in 315 ms of which 4 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 54 places in 333 ms of which 4 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 68 places in 305 ms of which 4 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 63 places in 308 ms of which 4 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 56 places in 301 ms of which 4 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 57 places in 274 ms of which 4 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 51 places in 263 ms of which 3 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 76 places in 272 ms of which 3 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 59 places in 279 ms of which 3 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 53 places in 286 ms of which 4 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 45 places in 291 ms of which 4 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 48 places in 253 ms of which 2 ms to minimize.
SMT process timed out in 60819ms, After SMT, problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60838ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62623 ms. Remains : 235/235 places, 967/967 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 864 edges and 235 vertex of which 36 / 235 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 205 transition count 236
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 80 transition count 164
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 80 transition count 135
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 74 transition count 135
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 292 place count 74 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 298 place count 74 transition count 123
Free-agglomeration rule applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 327 place count 74 transition count 94
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 356 place count 45 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 362 place count 45 transition count 94
Applied a total of 362 rules in 25 ms. Remains 45 /235 variables (removed 190) and now considering 94/967 (removed 873) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 45 cols
[2024-06-01 07:09:18] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 07:09:18] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-06-01 07:09:18] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 07:09:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-06-01 07:09:18] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 07:09:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:09:18] [INFO ] After 16ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 66 ms
TRAPS : Iteration 1
[2024-06-01 07:09:18] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 07:09:18] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 278 ms.
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 5 factoid took 160 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 213 ms.
Product exploration explored 100000 steps with 0 reset in 277 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 384 transition count 1116
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 109 Pre rules applied. Total rules applied 5 place count 384 transition count 1284
Deduced a syphon composed of 114 places in 1 ms
Iterating global reduction 1 with 109 rules applied. Total rules applied 114 place count 384 transition count 1284
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 149 places in 1 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 149 place count 384 transition count 1284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 154 place count 379 transition count 1279
Deduced a syphon composed of 144 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 159 place count 379 transition count 1279
Deduced a syphon composed of 144 places in 1 ms
Applied a total of 159 rules in 119 ms. Remains 379 /384 variables (removed 5) and now considering 1279/1116 (removed -163) transitions.
[2024-06-01 07:09:20] [INFO ] Redundant transitions in 22 ms returned []
Running 1273 sub problems to find dead transitions.
[2024-06-01 07:09:20] [INFO ] Flow matrix only has 601 transitions (discarded 678 similar events)
// Phase 1: matrix 601 rows 379 cols
[2024-06-01 07:09:20] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 07:09:20] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/379 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1273 unsolved
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 5 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 4 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 4 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 38 places in 323 ms of which 4 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 42 places in 312 ms of which 5 ms to minimize.
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 45 places in 304 ms of which 5 ms to minimize.
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 2 ms to minimize.
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 20/39 constraints. Problems are: Problem set: 281 solved, 992 unsolved
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 29 places in 446 ms of which 6 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 15 places in 470 ms of which 6 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 20 places in 381 ms of which 5 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 21 places in 451 ms of which 5 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 40 places in 346 ms of which 5 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 25 places in 365 ms of which 5 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 11 places in 400 ms of which 5 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 13 places in 388 ms of which 5 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 15 places in 429 ms of which 5 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 17 places in 451 ms of which 6 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 82 places in 460 ms of which 6 ms to minimize.
SMT process timed out in 30712ms, After SMT, problems are : Problem set: 281 solved, 992 unsolved
Search for dead transitions found 297 dead transitions in 30728ms
Found 297 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 297 transitions
Dead transitions reduction (with SMT) removed 297 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 379/384 places, 982/1116 transitions.
Graph (complete) has 2211 edges and 379 vertex of which 242 are kept as prefixes of interest. Removing 137 places using SCC suffix rule.5 ms
Discarding 137 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 1 ms
Applied a total of 1 rules in 71 ms. Remains 242 /379 variables (removed 137) and now considering 982/982 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/384 places, 982/1116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30950 ms. Remains : 242/384 places, 982/1116 transitions.
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 14 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-06-01 07:09:50] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-06-01 07:09:50] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 07:09:51] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-06-01 07:09:51] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:09:51] [INFO ] Invariant cache hit.
[2024-06-01 07:09:51] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:09:52] [INFO ] Implicit Places using invariants and state equation in 1486 ms returned []
Implicit Place search using SMT with State Equation took 2019 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 07:09:52] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:09:52] [INFO ] Invariant cache hit.
[2024-06-01 07:09:52] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 34 places in 258 ms of which 4 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 29 places in 287 ms of which 4 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 32 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 3 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 4 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 4 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 23 places in 361 ms of which 5 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 96 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 5 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 58 places in 317 ms of which 5 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 54 places in 441 ms of which 6 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 80 places in 394 ms of which 5 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 72 places in 397 ms of which 5 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 78 places in 452 ms of which 6 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 74 places in 291 ms of which 4 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 50 places in 308 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 74 places in 247 ms of which 4 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 89 places in 385 ms of which 5 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 76 places in 388 ms of which 5 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 86 places in 380 ms of which 4 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 75 places in 307 ms of which 5 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 76 places in 259 ms of which 4 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 4 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 3 places in 306 ms of which 5 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 86 places in 282 ms of which 4 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 86 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 86 places in 224 ms of which 4 ms to minimize.
[2024-06-01 07:10:21] [INFO ] Deduced a trap composed of 102 places in 348 ms of which 5 ms to minimize.
[2024-06-01 07:10:21] [INFO ] Deduced a trap composed of 72 places in 444 ms of which 5 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 20 places in 298 ms of which 3 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 105 places in 345 ms of which 5 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 50 places in 328 ms of which 4 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 77 places in 379 ms of which 6 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 100 places in 342 ms of which 5 ms to minimize.
SMT process timed out in 30604ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 30617ms
Finished structural reductions in LTL mode , in 1 iterations and 32654 ms. Remains : 384/384 places, 1116/1116 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-05 finished in 305834 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(((F(p0)&&F(!p1)) U p1))))'
Support contains 6 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 22 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-06-01 07:10:23] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:10:23] [INFO ] Invariant cache hit.
[2024-06-01 07:10:24] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-06-01 07:10:24] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:10:24] [INFO ] Invariant cache hit.
[2024-06-01 07:10:24] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:10:26] [INFO ] Implicit Places using invariants and state equation in 1836 ms returned []
Implicit Place search using SMT with State Equation took 2355 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 07:10:26] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:10:26] [INFO ] Invariant cache hit.
[2024-06-01 07:10:26] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 4 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 4 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 4 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 32 places in 341 ms of which 5 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 21 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 23 places in 389 ms of which 5 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 96 places in 305 ms of which 4 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 29 places in 304 ms of which 5 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 58 places in 319 ms of which 4 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 54 places in 506 ms of which 7 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 80 places in 440 ms of which 6 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 72 places in 469 ms of which 6 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 78 places in 466 ms of which 6 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 74 places in 338 ms of which 5 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 50 places in 344 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 74 places in 287 ms of which 4 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 89 places in 427 ms of which 5 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 76 places in 399 ms of which 5 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 86 places in 415 ms of which 5 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 75 places in 389 ms of which 5 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 76 places in 361 ms of which 5 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 6 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 3 places in 419 ms of which 5 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 86 places in 386 ms of which 5 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 86 places in 379 ms of which 5 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 86 places in 316 ms of which 4 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 102 places in 427 ms of which 6 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 72 places in 416 ms of which 6 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 20 places in 393 ms of which 5 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 105 places in 385 ms of which 6 ms to minimize.
SMT process timed out in 30660ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 30678ms
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33060 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 277 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-08 finished in 33583 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||G(F((p1||(F(p3)&&p2)))))))'
Support contains 7 out of 390 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 390 transition count 1147
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 385 transition count 1147
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 10 place count 385 transition count 1034
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 236 place count 272 transition count 1034
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 242 place count 266 transition count 998
Iterating global reduction 2 with 6 rules applied. Total rules applied 248 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 308 place count 236 transition count 968
Applied a total of 308 rules in 106 ms. Remains 236 /390 variables (removed 154) and now considering 968/1152 (removed 184) transitions.
[2024-06-01 07:10:57] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-06-01 07:10:57] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 07:10:57] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-06-01 07:10:57] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:10:57] [INFO ] Invariant cache hit.
[2024-06-01 07:10:58] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:10:59] [INFO ] Implicit Places using invariants and state equation in 1346 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
[2024-06-01 07:10:59] [INFO ] Redundant transitions in 20 ms returned []
Running 962 sub problems to find dead transitions.
[2024-06-01 07:10:59] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:10:59] [INFO ] Invariant cache hit.
[2024-06-01 07:10:59] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 4 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 58 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 37 places in 241 ms of which 4 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 69 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 52 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 62 places in 219 ms of which 3 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 3 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 60 places in 263 ms of which 3 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 3 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 4 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 56 places in 233 ms of which 4 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 45 places in 234 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 4 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 52 places in 252 ms of which 3 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 3 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 3 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 56 places in 211 ms of which 3 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 53 places in 283 ms of which 3 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 58 places in 316 ms of which 4 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 44 places in 315 ms of which 4 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 50 places in 279 ms of which 3 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 55 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 56 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 51 places in 269 ms of which 4 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 54 places in 317 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 4 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 20 places in 286 ms of which 4 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 3 ms to minimize.
[2024-06-01 07:11:40] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 3 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:41] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 51 places in 262 ms of which 4 ms to minimize.
[2024-06-01 07:11:42] [INFO ] Deduced a trap composed of 75 places in 282 ms of which 3 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 46 places in 276 ms of which 3 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 46 places in 276 ms of which 4 ms to minimize.
[2024-06-01 07:11:43] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 3 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 47 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 45 places in 250 ms of which 4 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 50 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:11:44] [INFO ] Deduced a trap composed of 66 places in 284 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 50 places in 261 ms of which 3 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 53 places in 240 ms of which 3 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 53 places in 286 ms of which 3 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 50 places in 250 ms of which 3 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 54 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 44 places in 269 ms of which 4 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 4 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 44 places in 298 ms of which 4 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 56 places in 333 ms of which 4 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 59 places in 279 ms of which 3 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 71 places in 320 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/610 variables, and 90 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 71/71 constraints]
After SMT, in 60768ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60785ms
Starting structural reductions in SI_LTL mode, iteration 1 : 236/390 places, 968/1152 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62794 ms. Remains : 236/390 places, 968/1152 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 345 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-10 finished in 63364 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(G(p0))||(F(p2)&&p1))))'
Support contains 9 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 385 transition count 1122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 385 transition count 1122
Applied a total of 10 rules in 19 ms. Remains 385 /390 variables (removed 5) and now considering 1122/1152 (removed 30) transitions.
[2024-06-01 07:12:00] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2024-06-01 07:12:00] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 07:12:01] [INFO ] Implicit Places using invariants in 578 ms returned []
[2024-06-01 07:12:01] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-06-01 07:12:01] [INFO ] Invariant cache hit.
[2024-06-01 07:12:01] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-06-01 07:12:03] [INFO ] Implicit Places using invariants and state equation in 2002 ms returned []
Implicit Place search using SMT with State Equation took 2581 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-06-01 07:12:03] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-06-01 07:12:03] [INFO ] Invariant cache hit.
[2024-06-01 07:12:03] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 4 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 2 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 33 places in 256 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 3 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 36 places in 301 ms of which 4 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 5 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 26 places in 321 ms of which 4 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 51 places in 477 ms of which 6 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 80 places in 424 ms of which 6 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 72 places in 432 ms of which 6 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 89 places in 375 ms of which 4 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 76 places in 275 ms of which 4 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 95 places in 248 ms of which 5 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 97 places in 323 ms of which 5 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 79 places in 223 ms of which 3 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 74 places in 220 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 75 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:12:22] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 78 places in 395 ms of which 5 ms to minimize.
[2024-06-01 07:12:23] [INFO ] Deduced a trap composed of 106 places in 453 ms of which 6 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 76 places in 432 ms of which 6 ms to minimize.
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 111 places in 361 ms of which 5 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 86 places in 434 ms of which 5 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 83 places in 429 ms of which 6 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 87 places in 450 ms of which 6 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 77 places in 260 ms of which 3 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 79 places in 209 ms of which 3 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 74 places in 301 ms of which 4 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 80 places in 261 ms of which 4 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 77 places in 260 ms of which 4 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 92 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 106 places in 258 ms of which 4 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 114 places in 258 ms of which 4 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 94 places in 268 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/913 variables, and 59 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/385 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 1116/1116 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 90 places in 330 ms of which 5 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 82 places in 298 ms of which 5 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 41 places in 308 ms of which 5 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 95 places in 394 ms of which 5 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 117 places in 380 ms of which 3 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 93 places in 236 ms of which 5 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 108 places in 353 ms of which 4 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 3 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 88 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 59 places in 388 ms of which 5 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 102 places in 400 ms of which 5 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 40 places in 403 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 86 places in 246 ms of which 4 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 84 places in 291 ms of which 4 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 84 places in 321 ms of which 5 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 73 places in 293 ms of which 5 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 72 places in 312 ms of which 5 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 84 places in 412 ms of which 6 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 75 places in 420 ms of which 5 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 93 places in 409 ms of which 6 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 112 places in 373 ms of which 6 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 3 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 59 places in 392 ms of which 5 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 117 places in 392 ms of which 5 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 19 places in 362 ms of which 5 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 4 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 17 places in 349 ms of which 5 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 44 places in 482 ms of which 6 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 21 places in 391 ms of which 5 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 70 places in 423 ms of which 5 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 84 places in 410 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 91 places in 301 ms of which 5 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 88 places in 414 ms of which 5 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 63 places in 385 ms of which 5 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 72 places in 375 ms of which 5 ms to minimize.
SMT process timed out in 60932ms, After SMT, problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 60948ms
Starting structural reductions in LTL mode, iteration 1 : 385/390 places, 1122/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63552 ms. Remains : 385/390 places, 1122/1152 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 555 ms.
Product exploration explored 100000 steps with 50000 reset in 565 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 p2 p1 p0), (X p2), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-11 finished in 64988 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 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 12 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-06-01 07:13:05] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-06-01 07:13:05] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 07:13:06] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-06-01 07:13:06] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:13:06] [INFO ] Invariant cache hit.
[2024-06-01 07:13:06] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:13:08] [INFO ] Implicit Places using invariants and state equation in 2102 ms returned []
Implicit Place search using SMT with State Equation took 2550 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 07:13:08] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:13:08] [INFO ] Invariant cache hit.
[2024-06-01 07:13:08] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 4 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 34 places in 272 ms of which 3 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 29 places in 305 ms of which 4 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 32 places in 316 ms of which 4 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 3 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 23 places in 360 ms of which 5 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 96 places in 296 ms of which 4 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 5 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 58 places in 311 ms of which 5 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 54 places in 494 ms of which 6 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 80 places in 445 ms of which 6 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 72 places in 346 ms of which 5 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 78 places in 440 ms of which 6 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 74 places in 255 ms of which 4 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 50 places in 327 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 3 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 74 places in 268 ms of which 4 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 89 places in 394 ms of which 5 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 76 places in 387 ms of which 5 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 86 places in 382 ms of which 5 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 75 places in 356 ms of which 5 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 76 places in 345 ms of which 5 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 4 places in 422 ms of which 6 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 3 places in 417 ms of which 6 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 86 places in 373 ms of which 6 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 86 places in 381 ms of which 5 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 86 places in 255 ms of which 4 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 102 places in 419 ms of which 5 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 72 places in 395 ms of which 6 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 20 places in 419 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 55 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 4 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 61 places in 197 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 75 places in 318 ms of which 4 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 86 places in 308 ms of which 4 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 72 places in 307 ms of which 5 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 90 places in 237 ms of which 4 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 76 places in 281 ms of which 5 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 56 places in 259 ms of which 3 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 56 places in 402 ms of which 5 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 106 places in 395 ms of which 5 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 111 places in 382 ms of which 6 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 39 places in 350 ms of which 5 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 87 places in 332 ms of which 5 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 58 places in 334 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 58 places in 251 ms of which 4 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 113 places in 415 ms of which 6 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 77 places in 410 ms of which 5 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 71 places in 406 ms of which 5 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 18 places in 423 ms of which 5 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 84 places in 376 ms of which 5 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 73 places in 343 ms of which 5 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 88 places in 406 ms of which 5 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 77 places in 467 ms of which 6 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 106 places in 477 ms of which 7 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 38 places in 332 ms of which 6 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 78 places in 494 ms of which 6 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 104 places in 427 ms of which 6 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 117 places in 502 ms of which 6 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 92 places in 361 ms of which 6 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 38 places in 320 ms of which 3 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 93 places in 269 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 69 places in 445 ms of which 6 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 100 places in 396 ms of which 6 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 74 places in 354 ms of which 5 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 14 places in 371 ms of which 5 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 103 places in 335 ms of which 4 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 101 places in 320 ms of which 5 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 75 places in 417 ms of which 5 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 72 places in 389 ms of which 6 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 80 places in 351 ms of which 5 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 66 places in 363 ms of which 5 ms to minimize.
SMT process timed out in 60745ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60767ms
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63333 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-12 finished in 63470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||G(F((!p1 U (p2||G(!p1)))))||(F((!p1 U (p2||G(!p1))))&&X(p3)))))))'
Support contains 7 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 16 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-06-01 07:14:09] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:14:09] [INFO ] Invariant cache hit.
[2024-06-01 07:14:09] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-06-01 07:14:09] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:14:09] [INFO ] Invariant cache hit.
[2024-06-01 07:14:09] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:14:11] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 2005 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 07:14:11] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:14:11] [INFO ] Invariant cache hit.
[2024-06-01 07:14:11] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 4 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 3 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 29 places in 276 ms of which 4 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 32 places in 307 ms of which 4 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 4 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 3 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 23 places in 338 ms of which 5 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 96 places in 280 ms of which 4 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 58 places in 285 ms of which 4 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 54 places in 445 ms of which 6 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 80 places in 351 ms of which 5 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 72 places in 399 ms of which 6 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 78 places in 390 ms of which 5 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 74 places in 264 ms of which 4 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 50 places in 293 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 74 places in 259 ms of which 5 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 89 places in 371 ms of which 6 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 76 places in 366 ms of which 5 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 86 places in 350 ms of which 5 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 75 places in 353 ms of which 5 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 76 places in 359 ms of which 5 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 4 places in 481 ms of which 5 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 3 places in 409 ms of which 6 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 86 places in 383 ms of which 5 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 86 places in 343 ms of which 5 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 86 places in 304 ms of which 5 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 102 places in 393 ms of which 5 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 72 places in 373 ms of which 5 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 20 places in 354 ms of which 4 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 105 places in 247 ms of which 4 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 50 places in 245 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 77 places in 263 ms of which 4 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 100 places in 232 ms of which 4 ms to minimize.
SMT process timed out in 30718ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 30737ms
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32763 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 473 ms.
Product exploration explored 100000 steps with 25000 reset in 405 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 p2 p0 (NOT p1) p3), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p2) p1 (NOT p3)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1 (NOT p3)), (AND (NOT p0) (NOT p2) p1 (NOT p3)), (AND (NOT p0) (NOT p2) p1 (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 607 ms. (65 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 490 ms. (81 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 581 ms. (68 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
[2024-06-01 07:14:44] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:14:44] [INFO ] Invariant cache hit.
[2024-06-01 07:14:44] [INFO ] State equation strengthened by 164 read => feed constraints.
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 182/189 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/190 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 49/239 variables, 4/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/258 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 368/626 variables, 258/272 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/626 variables, 74/346 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 0/346 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 36/662 variables, 16/362 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/662 variables, 12/374 constraints. Problems are: Problem set: 2 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/662 variables, 0/374 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 106/768 variables, 4/378 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/768 variables, 0/378 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 4/772 variables, 2/380 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/772 variables, 0/380 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 134/906 variables, 110/490 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/906 variables, 78/568 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/906 variables, 0/568 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/906 variables, 0/568 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 568 constraints, problems are : Problem set: 2 solved, 6 unsolved in 2057 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 182/189 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/190 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 49/239 variables, 4/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 19/258 variables, 2/14 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 368/626 variables, 258/273 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 74/347 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/626 variables, 1/348 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 0/348 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 36/662 variables, 16/364 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/662 variables, 12/376 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/662 variables, 0/376 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 106/768 variables, 4/380 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/768 variables, 0/380 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 4/772 variables, 2/382 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 6/388 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 5 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 3 places in 379 ms of which 5 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 4 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/772 variables, 6/394 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/772 variables, 0/394 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 134/906 variables, 110/504 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/906 variables, 78/582 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/906 variables, 0/582 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/906 variables, 0/582 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 582 constraints, problems are : Problem set: 2 solved, 6 unsolved in 4470 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 9/9 constraints]
After SMT, in 6545ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 2450 ms.
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 378 transition count 997
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 265 transition count 997
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 296 place count 236 transition count 968
Applied a total of 296 rules in 47 ms. Remains 236 /384 variables (removed 148) and now considering 968/1116 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 236/384 places, 968/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 1321 ms. (30 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 226023 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 3
Probabilistic random walk after 226023 steps, saw 69602 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-06-01 07:14:57] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-06-01 07:14:57] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 07:14:57] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/160 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 270/430 variables, 160/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 74/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 36/466 variables, 16/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 14/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 56/522 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/522 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 4/526 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 84/610 variables, 60/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/610 variables, 76/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/610 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 419 constraints, problems are : Problem set: 0 solved, 3 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/160 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 270/430 variables, 160/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 74/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 36/466 variables, 16/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 56/522 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/522 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 4/526 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 84/610 variables, 60/349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/610 variables, 76/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/610 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/610 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 425 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1090 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 1792ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 201 ms.
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 35 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 33 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-06-01 07:14:59] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:14:59] [INFO ] Invariant cache hit.
[2024-06-01 07:14:59] [INFO ] Implicit Places using invariants in 489 ms returned []
[2024-06-01 07:14:59] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:14:59] [INFO ] Invariant cache hit.
[2024-06-01 07:15:00] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:15:01] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 1922 ms to find 0 implicit places.
[2024-06-01 07:15:01] [INFO ] Redundant transitions in 17 ms returned []
Running 962 sub problems to find dead transitions.
[2024-06-01 07:15:01] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:15:01] [INFO ] Invariant cache hit.
[2024-06-01 07:15:01] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 3 places in 306 ms of which 4 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 68 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 59 places in 259 ms of which 4 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 71 places in 263 ms of which 3 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 69 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 51 places in 207 ms of which 3 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 3 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 3 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 3 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 72 places in 306 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:15:16] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 61 places in 206 ms of which 4 ms to minimize.
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 3 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 57 places in 220 ms of which 4 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 59 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 4 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 56 places in 272 ms of which 3 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 54 places in 277 ms of which 4 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 69 places in 268 ms of which 4 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 55 places in 265 ms of which 4 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 63 places in 259 ms of which 3 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 63 places in 241 ms of which 3 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 56 places in 260 ms of which 3 ms to minimize.
[2024-06-01 07:15:22] [INFO ] Deduced a trap composed of 46 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:15:22] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 4 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 3 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 56 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 3 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 3 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 42 places in 232 ms of which 4 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 42 places in 290 ms of which 3 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 51 places in 224 ms of which 4 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 37 places in 294 ms of which 3 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 49 places in 298 ms of which 5 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 34 places in 284 ms of which 3 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 15 places in 283 ms of which 4 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 53 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 3 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 34 places in 269 ms of which 3 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 77 places in 237 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 53 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 50 places in 273 ms of which 4 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 55 places in 276 ms of which 3 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 58 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 59 places in 237 ms of which 4 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 4 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 4 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 3 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 4 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 4 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 4 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 61 places in 272 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 73 places in 245 ms of which 3 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 75 places in 215 ms of which 4 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 53 places in 259 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/610 variables, and 102 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 83/83 constraints]
After SMT, in 60713ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60731ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62714 ms. Remains : 236/236 places, 968/968 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 849 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 569 transitions
Reduce isomorphic transitions removed 683 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 240
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 161 transition count 240
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 91 place count 161 transition count 228
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 120 place count 144 transition count 228
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 238 place count 85 transition count 169
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 265 place count 85 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 271 place count 82 transition count 142
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 274 place count 82 transition count 139
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 281 place count 82 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 281 place count 82 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 81 transition count 131
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 315 place count 81 transition count 99
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 347 place count 49 transition count 99
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 353 place count 49 transition count 99
Applied a total of 353 rules in 28 ms. Remains 49 /236 variables (removed 187) and now considering 99/968 (removed 869) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 99 rows 49 cols
[2024-06-01 07:16:02] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 07:16:02] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 07:16:02] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 07:16:02] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 07:16:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 07:16:02] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 19 ms returned sat
[2024-06-01 07:16:02] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-01 07:16:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:16:02] [INFO ] After 42ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 07:16:02] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 07:16:02] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 431 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p1) p3), (X (X p2)), (G (OR p0 p2 (NOT p1))), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p3)), (F p1)]
Knowledge based reduction with 4 factoid took 250 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 166 ms :[false, false, false, false, false]
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 5 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-06-01 07:16:03] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-06-01 07:16:03] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 07:16:03] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-06-01 07:16:03] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:16:03] [INFO ] Invariant cache hit.
[2024-06-01 07:16:04] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:16:05] [INFO ] Implicit Places using invariants and state equation in 1966 ms returned []
Implicit Place search using SMT with State Equation took 2524 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 07:16:05] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:16:05] [INFO ] Invariant cache hit.
[2024-06-01 07:16:05] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 4 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 4 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 32 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 23 places in 353 ms of which 5 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 96 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 54 places in 435 ms of which 6 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 80 places in 400 ms of which 5 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 72 places in 407 ms of which 5 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 78 places in 305 ms of which 3 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 74 places in 292 ms of which 4 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 50 places in 314 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 74 places in 261 ms of which 4 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 89 places in 403 ms of which 5 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 76 places in 371 ms of which 5 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 86 places in 355 ms of which 5 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 75 places in 350 ms of which 4 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 76 places in 352 ms of which 5 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 5 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 3 places in 391 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 86 places in 219 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 86 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 86 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 102 places in 278 ms of which 6 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 72 places in 417 ms of which 6 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 20 places in 400 ms of which 5 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 105 places in 385 ms of which 6 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 50 places in 394 ms of which 5 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 77 places in 394 ms of which 5 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 100 places in 379 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 86 places in 321 ms of which 5 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 91 places in 265 ms of which 5 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 54 places in 262 ms of which 4 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 70 places in 305 ms of which 4 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 90 places in 300 ms of which 5 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 77 places in 427 ms of which 6 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 58 places in 420 ms of which 6 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 98 places in 430 ms of which 6 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 38 places in 327 ms of which 5 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 55 places in 434 ms of which 6 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 103 places in 377 ms of which 5 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 108 places in 436 ms of which 5 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 39 places in 442 ms of which 5 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 87 places in 386 ms of which 5 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 39 places in 431 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 58 places in 276 ms of which 4 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 114 places in 482 ms of which 6 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 93 places in 368 ms of which 6 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 91 places in 394 ms of which 5 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 93 places in 377 ms of which 5 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 24 places in 397 ms of which 5 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 22 places in 388 ms of which 5 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 84 places in 361 ms of which 5 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 93 places in 380 ms of which 6 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 72 places in 347 ms of which 5 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 82 places in 371 ms of which 5 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 69 places in 379 ms of which 5 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 95 places in 311 ms of which 4 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 96 places in 320 ms of which 5 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 89 places in 400 ms of which 5 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 103 places in 401 ms of which 6 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 38 places in 366 ms of which 6 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 113 places in 384 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 90 places in 261 ms of which 4 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 60 places in 339 ms of which 5 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 41 places in 332 ms of which 5 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 86 places in 258 ms of which 4 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 93 places in 242 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/906 variables, and 104 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/1110 constraints, Known Traps: 85/85 constraints]
After SMT, in 60778ms problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60798ms
Finished structural reductions in LTL mode , in 1 iterations and 63333 ms. Remains : 384/384 places, 1116/1116 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 p2 (NOT p1) p3)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[false, false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 2038 ms. (19 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 408 ms. (97 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 5/5 properties
[2024-06-01 07:17:08] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:17:08] [INFO ] Invariant cache hit.
[2024-06-01 07:17:08] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 182/189 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/190 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 49/239 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 19/258 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 368/626 variables, 258/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/626 variables, 74/345 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/626 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 36/662 variables, 16/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/662 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/662 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 106/768 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/768 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 4/772 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/772 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 134/906 variables, 110/489 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/906 variables, 78/567 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/906 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/906 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 567 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1605 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 182/189 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/190 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 49/239 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 19/258 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 368/626 variables, 258/274 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 74/348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/626 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 36/662 variables, 16/364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/662 variables, 12/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/662 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 106/768 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/768 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 4/772 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/772 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 134/906 variables, 110/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/906 variables, 78/576 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/906 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/906 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/906 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 577 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3201 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 4834ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4423 ms.
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 378 transition count 997
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 265 transition count 997
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 296 place count 236 transition count 968
Applied a total of 296 rules in 78 ms. Remains 236 /384 variables (removed 148) and now considering 968/1116 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 236/384 places, 968/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 1757 ms. (22 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 143654 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 5
Probabilistic random walk after 143654 steps, saw 52122 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
[2024-06-01 07:17:21] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-06-01 07:17:21] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 07:17:21] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 270/430 variables, 160/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 74/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 36/466 variables, 16/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 56/522 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/522 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 4/526 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 84/610 variables, 60/344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 76/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/610 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/610 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 420 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1203 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 8/160 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 270/430 variables, 160/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 74/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 36/466 variables, 16/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/466 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 56/522 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/522 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 4/526 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/526 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 84/610 variables, 60/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/610 variables, 76/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/610 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/610 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 428 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1757 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 2984ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 2846 ms.
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 35 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 35 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-06-01 07:17:27] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:17:27] [INFO ] Invariant cache hit.
[2024-06-01 07:17:28] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-06-01 07:17:28] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:17:28] [INFO ] Invariant cache hit.
[2024-06-01 07:17:28] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:17:29] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 2018 ms to find 0 implicit places.
[2024-06-01 07:17:29] [INFO ] Redundant transitions in 18 ms returned []
Running 962 sub problems to find dead transitions.
[2024-06-01 07:17:29] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:17:29] [INFO ] Invariant cache hit.
[2024-06-01 07:17:29] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 3 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 68 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 4 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 59 places in 258 ms of which 4 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 71 places in 252 ms of which 4 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 69 places in 218 ms of which 4 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 51 places in 243 ms of which 3 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 50 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 3 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 72 places in 304 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 4 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 61 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 57 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 56 places in 256 ms of which 4 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 54 places in 256 ms of which 3 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 69 places in 261 ms of which 3 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 4 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 63 places in 263 ms of which 3 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 63 places in 238 ms of which 3 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 56 places in 254 ms of which 3 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 46 places in 279 ms of which 4 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 3 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 56 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 42 places in 259 ms of which 4 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 42 places in 270 ms of which 3 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 51 places in 260 ms of which 4 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 51 places in 290 ms of which 3 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 37 places in 276 ms of which 4 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 49 places in 272 ms of which 4 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 34 places in 235 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 4 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 53 places in 295 ms of which 4 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 34 places in 324 ms of which 4 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 77 places in 230 ms of which 4 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 66 places in 279 ms of which 4 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 53 places in 239 ms of which 4 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 50 places in 268 ms of which 4 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 55 places in 259 ms of which 4 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 58 places in 250 ms of which 3 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 50 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 59 places in 238 ms of which 3 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 4 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 3 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 22 places in 265 ms of which 3 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 4 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 3 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 4 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 61 places in 280 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 73 places in 261 ms of which 3 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 75 places in 213 ms of which 3 ms to minimize.
SMT process timed out in 60786ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60805ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62887 ms. Remains : 236/236 places, 968/968 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 849 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 569 transitions
Reduce isomorphic transitions removed 683 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 240
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 161 transition count 240
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 91 place count 161 transition count 228
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 120 place count 144 transition count 228
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 238 place count 85 transition count 169
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 265 place count 85 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 271 place count 82 transition count 142
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 274 place count 82 transition count 139
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 281 place count 82 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 281 place count 82 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 81 transition count 131
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 315 place count 81 transition count 99
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 347 place count 49 transition count 99
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 353 place count 49 transition count 99
Applied a total of 353 rules in 35 ms. Remains 49 /236 variables (removed 187) and now considering 99/968 (removed 869) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 99 rows 49 cols
[2024-06-01 07:18:30] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 07:18:30] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 07:18:30] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 07:18:30] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-01 07:18:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 07:18:30] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 07:18:30] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-01 07:18:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:18:30] [INFO ] After 66ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 1
[2024-06-01 07:18:31] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-01 07:18:31] [INFO ] After 557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 752 ms.
Knowledge obtained : [(AND p2 (NOT p1) p3)]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 248 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 240 ms :[false, false, false, false, false]
Product exploration explored 100000 steps with 25000 reset in 563 ms.
Product exploration explored 100000 steps with 25000 reset in 384 ms.
Applying partial POR strategy [false, true, true, false, false]
Stuttering acceptance computed with spot in 234 ms :[false, false, false, false, false]
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1116
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 107 Pre rules applied. Total rules applied 6 place count 384 transition count 1284
Deduced a syphon composed of 113 places in 2 ms
Iterating global reduction 1 with 107 rules applied. Total rules applied 113 place count 384 transition count 1284
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 148 places in 2 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 148 place count 384 transition count 1284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 154 place count 378 transition count 1278
Deduced a syphon composed of 142 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 160 place count 378 transition count 1278
Deduced a syphon composed of 142 places in 1 ms
Applied a total of 160 rules in 86 ms. Remains 378 /384 variables (removed 6) and now considering 1278/1116 (removed -162) transitions.
[2024-06-01 07:18:33] [INFO ] Redundant transitions in 34 ms returned []
Running 1272 sub problems to find dead transitions.
[2024-06-01 07:18:33] [INFO ] Flow matrix only has 600 transitions (discarded 678 similar events)
// Phase 1: matrix 600 rows 378 cols
[2024-06-01 07:18:33] [INFO ] Computed 19 invariants in 5 ms
[2024-06-01 07:18:33] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1272 unsolved
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 4 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 4 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 3 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 1 ms to minimize.
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 4 ms to minimize.
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1276 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/39 constraints. Problems are: Problem set: 310 solved, 962 unsolved
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 25 places in 371 ms of which 5 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 42 places in 297 ms of which 4 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 51 places in 384 ms of which 5 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 11 places in 357 ms of which 4 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 52 places in 369 ms of which 5 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 51 places in 347 ms of which 4 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 45 places in 310 ms of which 4 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 43 places in 430 ms of which 6 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 34 places in 367 ms of which 5 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 51 places in 370 ms of which 4 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 52 places in 336 ms of which 5 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 51 places in 416 ms of which 6 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 16 places in 264 ms of which 3 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 24 places in 370 ms of which 5 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 52 places in 344 ms of which 5 ms to minimize.
SMT process timed out in 31053ms, After SMT, problems are : Problem set: 310 solved, 962 unsolved
Search for dead transitions found 310 dead transitions in 31079ms
Found 310 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 310 transitions
Dead transitions reduction (with SMT) removed 310 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 378/384 places, 968/1116 transitions.
Graph (complete) has 2186 edges and 378 vertex of which 236 are kept as prefixes of interest. Removing 142 places using SCC suffix rule.2 ms
Discarding 142 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 38 ms. Remains 236 /378 variables (removed 142) and now considering 968/968 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 236/384 places, 968/1116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31262 ms. Remains : 236/384 places, 968/1116 transitions.
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 9 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-06-01 07:19:04] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-06-01 07:19:04] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 07:19:05] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-06-01 07:19:05] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:19:05] [INFO ] Invariant cache hit.
[2024-06-01 07:19:05] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:19:07] [INFO ] Implicit Places using invariants and state equation in 2124 ms returned []
Implicit Place search using SMT with State Equation took 2711 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 07:19:07] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:19:07] [INFO ] Invariant cache hit.
[2024-06-01 07:19:07] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 44 places in 258 ms of which 3 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 34 places in 279 ms of which 4 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 4 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 32 places in 303 ms of which 4 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 23 places in 351 ms of which 5 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 96 places in 297 ms of which 5 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 29 places in 300 ms of which 5 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 58 places in 315 ms of which 5 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 54 places in 476 ms of which 6 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 80 places in 448 ms of which 6 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 72 places in 422 ms of which 5 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 78 places in 409 ms of which 5 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 74 places in 288 ms of which 5 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 50 places in 308 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 74 places in 257 ms of which 4 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 89 places in 398 ms of which 6 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 76 places in 374 ms of which 5 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 86 places in 337 ms of which 5 ms to minimize.
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 75 places in 352 ms of which 5 ms to minimize.
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 76 places in 365 ms of which 5 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 4 places in 412 ms of which 6 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 3 places in 409 ms of which 6 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 86 places in 364 ms of which 5 ms to minimize.
[2024-06-01 07:19:36] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:19:36] [INFO ] Deduced a trap composed of 86 places in 355 ms of which 5 ms to minimize.
[2024-06-01 07:19:36] [INFO ] Deduced a trap composed of 86 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:19:37] [INFO ] Deduced a trap composed of 102 places in 396 ms of which 5 ms to minimize.
[2024-06-01 07:19:37] [INFO ] Deduced a trap composed of 72 places in 392 ms of which 5 ms to minimize.
[2024-06-01 07:19:38] [INFO ] Deduced a trap composed of 20 places in 395 ms of which 5 ms to minimize.
SMT process timed out in 30797ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 30819ms
Finished structural reductions in LTL mode , in 1 iterations and 33544 ms. Remains : 384/384 places, 1116/1116 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-13 finished in 329153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||F(p1)) U X(G(((p2 U X(p1)) U p3)))))'
Support contains 9 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 19 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-06-01 07:19:38] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:19:38] [INFO ] Invariant cache hit.
[2024-06-01 07:19:38] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-06-01 07:19:38] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:19:38] [INFO ] Invariant cache hit.
[2024-06-01 07:19:39] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:19:40] [INFO ] Implicit Places using invariants and state equation in 2090 ms returned []
Implicit Place search using SMT with State Equation took 2670 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-06-01 07:19:40] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-06-01 07:19:40] [INFO ] Invariant cache hit.
[2024-06-01 07:19:40] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 5 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 3 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 6 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 28 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 96 places in 288 ms of which 5 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 5 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 58 places in 293 ms of which 5 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 54 places in 376 ms of which 6 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 80 places in 416 ms of which 6 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 72 places in 434 ms of which 6 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 78 places in 418 ms of which 5 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 74 places in 317 ms of which 4 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 50 places in 283 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 74 places in 266 ms of which 5 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 89 places in 381 ms of which 6 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 76 places in 376 ms of which 5 ms to minimize.
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 86 places in 363 ms of which 5 ms to minimize.
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 75 places in 361 ms of which 6 ms to minimize.
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 76 places in 370 ms of which 5 ms to minimize.
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 5 ms to minimize.
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 3 places in 413 ms of which 5 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 86 places in 366 ms of which 5 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 86 places in 332 ms of which 6 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 86 places in 301 ms of which 4 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 102 places in 404 ms of which 6 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 72 places in 397 ms of which 7 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 20 places in 393 ms of which 6 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 105 places in 393 ms of which 5 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 50 places in 394 ms of which 6 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 77 places in 399 ms of which 5 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 100 places in 395 ms of which 5 ms to minimize.
SMT process timed out in 30964ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 30984ms
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33683 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 549 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-14
Product exploration explored 100000 steps with 274 reset in 285 ms.
Stack based approach found an accepted trace after 76 steps with 0 reset with depth 77 and stack size 77 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-14 finished in 34587 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(p1)||(X(X(p0))&&X(p0)))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-01
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 390 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 390 transition count 1146
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 384 transition count 1146
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 384 transition count 1032
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 270 transition count 1032
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 246 place count 264 transition count 996
Iterating global reduction 2 with 6 rules applied. Total rules applied 252 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 312 place count 234 transition count 966
Applied a total of 312 rules in 58 ms. Remains 234 /390 variables (removed 156) and now considering 966/1152 (removed 186) transitions.
[2024-06-01 07:20:13] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-06-01 07:20:13] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 07:20:13] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-06-01 07:20:13] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:20:13] [INFO ] Invariant cache hit.
[2024-06-01 07:20:14] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:20:15] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 1992 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2024-06-01 07:20:15] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:20:15] [INFO ] Invariant cache hit.
[2024-06-01 07:20:15] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 4 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 4 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 67 places in 213 ms of which 3 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 4 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 27 places in 265 ms of which 3 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 3 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 53 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 70 places in 209 ms of which 4 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 48 places in 252 ms of which 4 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 3 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 51 places in 257 ms of which 3 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 19 places in 312 ms of which 4 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 44 places in 303 ms of which 4 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:20:39] [INFO ] Deduced a trap composed of 58 places in 283 ms of which 4 ms to minimize.
[2024-06-01 07:20:39] [INFO ] Deduced a trap composed of 57 places in 294 ms of which 3 ms to minimize.
[2024-06-01 07:20:39] [INFO ] Deduced a trap composed of 57 places in 309 ms of which 3 ms to minimize.
[2024-06-01 07:20:40] [INFO ] Deduced a trap composed of 44 places in 282 ms of which 3 ms to minimize.
[2024-06-01 07:20:40] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 3 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 4 ms to minimize.
[2024-06-01 07:20:50] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:20:51] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 56 places in 282 ms of which 4 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 52 places in 254 ms of which 4 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 3 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 55 places in 297 ms of which 4 ms to minimize.
[2024-06-01 07:20:53] [INFO ] Deduced a trap composed of 54 places in 240 ms of which 3 ms to minimize.
[2024-06-01 07:20:53] [INFO ] Deduced a trap composed of 50 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:20:53] [INFO ] Deduced a trap composed of 48 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:20:53] [INFO ] Deduced a trap composed of 55 places in 246 ms of which 3 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 4 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 3 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 4 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 2 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 3 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 4 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 4 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 60 places in 248 ms of which 4 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 64 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 67 places in 273 ms of which 3 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 57 places in 262 ms of which 4 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 4 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 69 places in 253 ms of which 3 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 4 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 52 places in 234 ms of which 3 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 51 places in 230 ms of which 4 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 46 places in 238 ms of which 3 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 69 places in 243 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 45 places in 246 ms of which 4 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 4 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 44 places in 289 ms of which 4 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 46 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 3 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 44 places in 279 ms of which 4 ms to minimize.
SMT process timed out in 60976ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60995ms
Starting structural reductions in LI_LTL mode, iteration 1 : 234/390 places, 966/1152 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 63049 ms. Remains : 234/390 places, 966/1152 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 380 ms.
Product exploration explored 100000 steps with 0 reset in 397 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 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 194 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1728 ms. (23 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 111293 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 6
Probabilistic random walk after 111293 steps, saw 44785 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2024-06-01 07:21:21] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:21:21] [INFO ] Invariant cache hit.
[2024-06-01 07:21:21] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:21:21] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 126/606 variables, 90/317 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 101/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 418 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1117 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:21:23] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:21:23] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 126/606 variables, 90/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 101/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 426 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1697 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 2832ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2141 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 33 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 234/234 places, 966/966 transitions.
RANDOM walk for 40000 steps (8 resets) in 1611 ms. (24 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 142401 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 6
Probabilistic random walk after 142401 steps, saw 52675 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
[2024-06-01 07:21:30] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:21:30] [INFO ] Invariant cache hit.
[2024-06-01 07:21:30] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 126/606 variables, 90/317 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 101/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 418 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 126/606 variables, 90/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 101/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 426 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1684 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 2802ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1944 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 30 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 30 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-06-01 07:21:35] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:21:35] [INFO ] Invariant cache hit.
[2024-06-01 07:21:35] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-06-01 07:21:35] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:21:35] [INFO ] Invariant cache hit.
[2024-06-01 07:21:36] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:21:37] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
[2024-06-01 07:21:37] [INFO ] Redundant transitions in 15 ms returned []
Running 960 sub problems to find dead transitions.
[2024-06-01 07:21:37] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:21:37] [INFO ] Invariant cache hit.
[2024-06-01 07:21:37] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 3 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 67 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 58 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 4 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 28 places in 254 ms of which 3 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 53 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 70 places in 214 ms of which 4 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 48 places in 235 ms of which 3 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 51 places in 237 ms of which 4 ms to minimize.
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:21:53] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:21:53] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:21:55] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:21:55] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:21:56] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 17 places in 297 ms of which 3 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 19 places in 314 ms of which 6 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 44 places in 324 ms of which 4 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 58 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 57 places in 304 ms of which 4 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 57 places in 292 ms of which 4 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 4 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 6 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 3 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 56 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 52 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 3 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 55 places in 273 ms of which 3 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 50 places in 243 ms of which 3 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 48 places in 243 ms of which 4 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 55 places in 246 ms of which 4 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 54 places in 221 ms of which 4 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 4 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:22:22] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 4 ms to minimize.
[2024-06-01 07:22:23] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 4 ms to minimize.
[2024-06-01 07:22:24] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 3 ms to minimize.
[2024-06-01 07:22:24] [INFO ] Deduced a trap composed of 60 places in 248 ms of which 3 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 64 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 67 places in 286 ms of which 3 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 57 places in 260 ms of which 4 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 46 places in 246 ms of which 3 ms to minimize.
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 69 places in 247 ms of which 4 ms to minimize.
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 46 places in 259 ms of which 4 ms to minimize.
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 52 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 51 places in 243 ms of which 3 ms to minimize.
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:22:28] [INFO ] Deduced a trap composed of 69 places in 236 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 57 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 44 places in 234 ms of which 3 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 45 places in 276 ms of which 3 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 4 ms to minimize.
SMT process timed out in 60771ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60787ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62630 ms. Remains : 234/234 places, 966/966 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
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 275 place count 77 transition count 140
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 280 place count 77 transition count 135
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 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 31 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 96 rows 45 cols
[2024-06-01 07:22:38] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 07:22:38] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 07:22:38] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 07:22:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 07:22:38] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-01 07:22:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:22:38] [INFO ] After 65ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
TRAPS : Iteration 1
[2024-06-01 07:22:38] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 07:22:38] [INFO ] After 517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 693 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 212 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-06-01 07:22:39] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-06-01 07:22:39] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 07:22:39] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-06-01 07:22:39] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:22:39] [INFO ] Invariant cache hit.
[2024-06-01 07:22:40] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:22:41] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 2019 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2024-06-01 07:22:41] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:22:41] [INFO ] Invariant cache hit.
[2024-06-01 07:22:41] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 3 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:22:51] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:22:52] [INFO ] Deduced a trap composed of 67 places in 211 ms of which 4 ms to minimize.
[2024-06-01 07:22:52] [INFO ] Deduced a trap composed of 58 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:22:52] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 4 ms to minimize.
[2024-06-01 07:22:52] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:22:52] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:22:53] [INFO ] Deduced a trap composed of 53 places in 218 ms of which 4 ms to minimize.
[2024-06-01 07:22:53] [INFO ] Deduced a trap composed of 70 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:22:53] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:22:53] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:22:53] [INFO ] Deduced a trap composed of 48 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:22:54] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:22:54] [INFO ] Deduced a trap composed of 51 places in 240 ms of which 3 ms to minimize.
[2024-06-01 07:22:54] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:22:55] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:22:57] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:22:57] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:22:58] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 4 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 17 places in 303 ms of which 4 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 19 places in 296 ms of which 4 ms to minimize.
[2024-06-01 07:23:04] [INFO ] Deduced a trap composed of 44 places in 291 ms of which 3 ms to minimize.
[2024-06-01 07:23:04] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:23:04] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 58 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 57 places in 304 ms of which 3 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 57 places in 343 ms of which 4 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 44 places in 286 ms of which 4 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 64 places in 254 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:23:14] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:23:14] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:23:14] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:23:14] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:23:16] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 3 ms to minimize.
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 56 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 52 places in 249 ms of which 4 ms to minimize.
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 33 places in 267 ms of which 4 ms to minimize.
[2024-06-01 07:23:18] [INFO ] Deduced a trap composed of 55 places in 299 ms of which 3 ms to minimize.
[2024-06-01 07:23:18] [INFO ] Deduced a trap composed of 54 places in 235 ms of which 3 ms to minimize.
[2024-06-01 07:23:18] [INFO ] Deduced a trap composed of 50 places in 265 ms of which 3 ms to minimize.
[2024-06-01 07:23:19] [INFO ] Deduced a trap composed of 48 places in 270 ms of which 3 ms to minimize.
[2024-06-01 07:23:19] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:23:19] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:23:19] [INFO ] Deduced a trap composed of 38 places in 248 ms of which 4 ms to minimize.
[2024-06-01 07:23:19] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 3 ms to minimize.
[2024-06-01 07:23:20] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 4 ms to minimize.
[2024-06-01 07:23:20] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 3 ms to minimize.
[2024-06-01 07:23:20] [INFO ] Deduced a trap composed of 35 places in 225 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:23:22] [INFO ] Deduced a trap composed of 54 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:23:23] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:23:24] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:23:24] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:23:24] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:23:25] [INFO ] Deduced a trap composed of 45 places in 267 ms of which 4 ms to minimize.
[2024-06-01 07:23:26] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 4 ms to minimize.
[2024-06-01 07:23:27] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 4 ms to minimize.
[2024-06-01 07:23:27] [INFO ] Deduced a trap composed of 60 places in 256 ms of which 3 ms to minimize.
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 64 places in 292 ms of which 3 ms to minimize.
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 67 places in 275 ms of which 4 ms to minimize.
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 57 places in 264 ms of which 4 ms to minimize.
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 3 ms to minimize.
[2024-06-01 07:23:29] [INFO ] Deduced a trap composed of 69 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:23:29] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 3 ms to minimize.
[2024-06-01 07:23:29] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 4 ms to minimize.
[2024-06-01 07:23:29] [INFO ] Deduced a trap composed of 51 places in 232 ms of which 4 ms to minimize.
[2024-06-01 07:23:30] [INFO ] Deduced a trap composed of 47 places in 232 ms of which 3 ms to minimize.
[2024-06-01 07:23:30] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 4 ms to minimize.
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 69 places in 243 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 57 places in 232 ms of which 4 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 4 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 4 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 52 places in 227 ms of which 4 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 4 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 4 ms to minimize.
[2024-06-01 07:23:42] [INFO ] Deduced a trap composed of 44 places in 239 ms of which 3 ms to minimize.
SMT process timed out in 60859ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60877ms
Finished structural reductions in LTL mode , in 1 iterations and 62907 ms. Remains : 234/234 places, 966/966 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 205 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1451 ms. (27 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 118580 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 6
Probabilistic random walk after 118580 steps, saw 46658 distinct states, run finished after 3004 ms. (steps per millisecond=39 ) properties seen :0
[2024-06-01 07:23:46] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:23:46] [INFO ] Invariant cache hit.
[2024-06-01 07:23:46] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 126/606 variables, 90/317 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 101/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 418 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1069 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 126/606 variables, 90/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 101/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 426 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1697 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 2790ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1968 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 33 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 234/234 places, 966/966 transitions.
RANDOM walk for 40000 steps (8 resets) in 1619 ms. (24 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 120232 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 6
Probabilistic random walk after 120232 steps, saw 47226 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 07:23:55] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:23:55] [INFO ] Invariant cache hit.
[2024-06-01 07:23:55] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:23:55] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 126/606 variables, 90/317 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 101/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 418 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1117 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:23:57] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:23:57] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 126/606 variables, 90/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 101/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 426 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1688 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 2826ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2136 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 33 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 32 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-06-01 07:24:00] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:24:00] [INFO ] Invariant cache hit.
[2024-06-01 07:24:01] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-06-01 07:24:01] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:24:01] [INFO ] Invariant cache hit.
[2024-06-01 07:24:01] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:24:02] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
[2024-06-01 07:24:02] [INFO ] Redundant transitions in 18 ms returned []
Running 960 sub problems to find dead transitions.
[2024-06-01 07:24:02] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:24:02] [INFO ] Invariant cache hit.
[2024-06-01 07:24:02] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 4 ms to minimize.
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 33 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 67 places in 211 ms of which 3 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 58 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 4 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 4 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 53 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 70 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 48 places in 243 ms of which 3 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 4 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 51 places in 245 ms of which 3 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:24:19] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:24:19] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 2 ms to minimize.
[2024-06-01 07:24:22] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 3 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 3 ms to minimize.
[2024-06-01 07:24:26] [INFO ] Deduced a trap composed of 44 places in 292 ms of which 4 ms to minimize.
[2024-06-01 07:24:26] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:24:27] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:27] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:24:27] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:24:27] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:24:27] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:24:27] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:28] [INFO ] Deduced a trap composed of 58 places in 302 ms of which 4 ms to minimize.
[2024-06-01 07:24:28] [INFO ] Deduced a trap composed of 57 places in 282 ms of which 4 ms to minimize.
[2024-06-01 07:24:28] [INFO ] Deduced a trap composed of 57 places in 302 ms of which 4 ms to minimize.
[2024-06-01 07:24:29] [INFO ] Deduced a trap composed of 44 places in 303 ms of which 4 ms to minimize.
[2024-06-01 07:24:29] [INFO ] Deduced a trap composed of 64 places in 275 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:24:36] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 3 ms to minimize.
[2024-06-01 07:24:36] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:24:36] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:24:37] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 4 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 56 places in 271 ms of which 4 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 52 places in 241 ms of which 3 ms to minimize.
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 4 ms to minimize.
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 55 places in 241 ms of which 3 ms to minimize.
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 54 places in 237 ms of which 4 ms to minimize.
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 50 places in 240 ms of which 3 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 55 places in 243 ms of which 3 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 3 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 4 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:24:45] [INFO ] Deduced a trap composed of 54 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:24:45] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 45 places in 257 ms of which 3 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 33 places in 267 ms of which 3 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 64 places in 239 ms of which 4 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 60 places in 259 ms of which 3 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 64 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 67 places in 289 ms of which 4 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 57 places in 280 ms of which 4 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 46 places in 257 ms of which 4 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 69 places in 259 ms of which 3 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 46 places in 237 ms of which 3 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 52 places in 246 ms of which 4 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 3 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 46 places in 238 ms of which 3 ms to minimize.
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 69 places in 246 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:24:58] [INFO ] Deduced a trap composed of 57 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:24:58] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:24:58] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 3 ms to minimize.
[2024-06-01 07:25:03] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 3 ms to minimize.
[2024-06-01 07:25:03] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 4 ms to minimize.
SMT process timed out in 60771ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60790ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62907 ms. Remains : 234/234 places, 966/966 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
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 275 place count 77 transition count 140
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 280 place count 77 transition count 135
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 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 24 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 96 rows 45 cols
[2024-06-01 07:25:03] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 07:25:03] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 07:25:03] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 07:25:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 07:25:04] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-01 07:25:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:25:04] [INFO ] After 65ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 07:25:04] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:25:04] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:25:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
TRAPS : Iteration 1
[2024-06-01 07:25:04] [INFO ] After 295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 07:25:04] [INFO ] After 551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 727 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 203 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 388 ms.
Product exploration explored 100000 steps with 0 reset in 350 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 3 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-06-01 07:25:05] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-06-01 07:25:05] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 07:25:06] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-06-01 07:25:06] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:25:06] [INFO ] Invariant cache hit.
[2024-06-01 07:25:06] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:25:07] [INFO ] Implicit Places using invariants and state equation in 1481 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2024-06-01 07:25:07] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-06-01 07:25:07] [INFO ] Invariant cache hit.
[2024-06-01 07:25:07] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 3 places in 285 ms of which 3 ms to minimize.
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:25:18] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:25:18] [INFO ] Deduced a trap composed of 67 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:25:19] [INFO ] Deduced a trap composed of 58 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:25:19] [INFO ] Deduced a trap composed of 27 places in 257 ms of which 3 ms to minimize.
[2024-06-01 07:25:19] [INFO ] Deduced a trap composed of 28 places in 266 ms of which 3 ms to minimize.
[2024-06-01 07:25:19] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:25:20] [INFO ] Deduced a trap composed of 53 places in 219 ms of which 4 ms to minimize.
[2024-06-01 07:25:20] [INFO ] Deduced a trap composed of 70 places in 237 ms of which 4 ms to minimize.
[2024-06-01 07:25:20] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:25:20] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:25:20] [INFO ] Deduced a trap composed of 48 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 3 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 51 places in 261 ms of which 3 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:25:25] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:25:26] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:25:30] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 4 ms to minimize.
[2024-06-01 07:25:30] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 4 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 44 places in 314 ms of which 3 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 58 places in 291 ms of which 4 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 57 places in 290 ms of which 3 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 57 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 44 places in 290 ms of which 4 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.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 1.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 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.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 1.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 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 2 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 52 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 56 places in 272 ms of which 4 ms to minimize.
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 52 places in 238 ms of which 3 ms to minimize.
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 4 ms to minimize.
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 55 places in 285 ms of which 4 ms to minimize.
[2024-06-01 07:25:45] [INFO ] Deduced a trap composed of 54 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:25:45] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:25:45] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:25:45] [INFO ] Deduced a trap composed of 55 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:25:45] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:25:46] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:25:46] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:25:46] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:25:46] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 4 ms to minimize.
[2024-06-01 07:25:47] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 4 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 33 places in 268 ms of which 3 ms to minimize.
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 60 places in 257 ms of which 3 ms to minimize.
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 64 places in 284 ms of which 4 ms to minimize.
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 67 places in 285 ms of which 4 ms to minimize.
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 57 places in 274 ms of which 4 ms to minimize.
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 46 places in 250 ms of which 4 ms to minimize.
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 69 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 52 places in 220 ms of which 4 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 51 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 4 ms to minimize.
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 46 places in 238 ms of which 4 ms to minimize.
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 69 places in 245 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 07:26:02] [INFO ] Deduced a trap composed of 57 places in 238 ms of which 4 ms to minimize.
[2024-06-01 07:26:02] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 4 ms to minimize.
[2024-06-01 07:26:07] [INFO ] Deduced a trap composed of 45 places in 266 ms of which 3 ms to minimize.
[2024-06-01 07:26:07] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:26:07] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:26:08] [INFO ] Deduced a trap composed of 44 places in 292 ms of which 3 ms to minimize.
[2024-06-01 07:26:08] [INFO ] Deduced a trap composed of 46 places in 263 ms of which 3 ms to minimize.
SMT process timed out in 60750ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60767ms
Finished structural reductions in LTL mode , in 1 iterations and 62667 ms. Remains : 234/234 places, 966/966 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-01 finished in 355855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((!p0 U (G(!p0)||!p0)) U (G((!p0 U (p1||G(!p0))))||(G(!p2)&&(!p0 U (p1||G(!p0))))))))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-05
Stuttering acceptance computed with spot in 276 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 5 out of 390 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 390 transition count 1147
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 385 transition count 1147
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 10 place count 385 transition count 1033
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 238 place count 271 transition count 1033
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 244 place count 265 transition count 997
Iterating global reduction 2 with 6 rules applied. Total rules applied 250 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 310 place count 235 transition count 967
Applied a total of 310 rules in 50 ms. Remains 235 /390 variables (removed 155) and now considering 967/1152 (removed 185) transitions.
[2024-06-01 07:26:09] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-06-01 07:26:09] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 07:26:09] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-06-01 07:26:09] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:26:09] [INFO ] Invariant cache hit.
[2024-06-01 07:26:09] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:26:11] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 1818 ms to find 0 implicit places.
Running 961 sub problems to find dead transitions.
[2024-06-01 07:26:11] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:26:11] [INFO ] Invariant cache hit.
[2024-06-01 07:26:11] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 3 places in 285 ms of which 3 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 1 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 57 places in 201 ms of which 4 ms to minimize.
[2024-06-01 07:26:21] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:26:21] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:26:22] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:26:22] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:26:22] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:26:22] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 3 ms to minimize.
[2024-06-01 07:26:23] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 3 ms to minimize.
[2024-06-01 07:26:23] [INFO ] Deduced a trap composed of 56 places in 232 ms of which 3 ms to minimize.
[2024-06-01 07:26:23] [INFO ] Deduced a trap composed of 33 places in 256 ms of which 3 ms to minimize.
[2024-06-01 07:26:23] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 50 places in 269 ms of which 4 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 53 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 56 places in 231 ms of which 4 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:26:27] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:26:28] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:26:28] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:26:30] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:26:33] [INFO ] Deduced a trap composed of 17 places in 302 ms of which 4 ms to minimize.
[2024-06-01 07:26:33] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 4 ms to minimize.
[2024-06-01 07:26:33] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 4 ms to minimize.
[2024-06-01 07:26:34] [INFO ] Deduced a trap composed of 21 places in 273 ms of which 3 ms to minimize.
[2024-06-01 07:26:34] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 4 ms to minimize.
[2024-06-01 07:26:35] [INFO ] Deduced a trap composed of 46 places in 307 ms of which 4 ms to minimize.
[2024-06-01 07:26:35] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 3 ms to minimize.
[2024-06-01 07:26:35] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 4 ms to minimize.
[2024-06-01 07:26:36] [INFO ] Deduced a trap composed of 44 places in 274 ms of which 4 ms to minimize.
[2024-06-01 07:26:36] [INFO ] Deduced a trap composed of 68 places in 296 ms of which 3 ms to minimize.
[2024-06-01 07:26:36] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 1 ms to minimize.
[2024-06-01 07:26:36] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:26:36] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:26:36] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:26:37] [INFO ] Deduced a trap composed of 56 places in 305 ms of which 3 ms to minimize.
[2024-06-01 07:26:37] [INFO ] Deduced a trap composed of 52 places in 323 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.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 1.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 1.0)
(s148 0.0)
(s149 0.0)
(s150 1.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 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 59 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:26:45] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 3 ms to minimize.
[2024-06-01 07:26:46] [INFO ] Deduced a trap composed of 34 places in 255 ms of which 3 ms to minimize.
[2024-06-01 07:26:47] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 52 places in 270 ms of which 4 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 4 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 18 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:26:52] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:26:53] [INFO ] Deduced a trap composed of 48 places in 275 ms of which 3 ms to minimize.
[2024-06-01 07:26:53] [INFO ] Deduced a trap composed of 52 places in 257 ms of which 4 ms to minimize.
[2024-06-01 07:26:53] [INFO ] Deduced a trap composed of 46 places in 234 ms of which 3 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 46 places in 206 ms of which 3 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 3 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 4 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 58 places in 285 ms of which 3 ms to minimize.
[2024-06-01 07:26:56] [INFO ] Deduced a trap composed of 55 places in 275 ms of which 4 ms to minimize.
[2024-06-01 07:26:56] [INFO ] Deduced a trap composed of 61 places in 248 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 45 places in 268 ms of which 4 ms to minimize.
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 45 places in 234 ms of which 3 ms to minimize.
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 47 places in 303 ms of which 4 ms to minimize.
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 52 places in 306 ms of which 4 ms to minimize.
[2024-06-01 07:27:06] [INFO ] Deduced a trap composed of 45 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:27:06] [INFO ] Deduced a trap composed of 47 places in 319 ms of which 4 ms to minimize.
[2024-06-01 07:27:07] [INFO ] Deduced a trap composed of 55 places in 234 ms of which 4 ms to minimize.
[2024-06-01 07:27:07] [INFO ] Deduced a trap composed of 34 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:27:08] [INFO ] Deduced a trap composed of 59 places in 270 ms of which 3 ms to minimize.
[2024-06-01 07:27:08] [INFO ] Deduced a trap composed of 44 places in 291 ms of which 3 ms to minimize.
[2024-06-01 07:27:09] [INFO ] Deduced a trap composed of 52 places in 290 ms of which 3 ms to minimize.
[2024-06-01 07:27:09] [INFO ] Deduced a trap composed of 55 places in 264 ms of which 3 ms to minimize.
[2024-06-01 07:27:09] [INFO ] Deduced a trap composed of 51 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 52 places in 250 ms of which 3 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 47 places in 316 ms of which 3 ms to minimize.
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 49 places in 284 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/608 variables, and 95 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 76/76 constraints]
After SMT, in 60733ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60751ms
Starting structural reductions in LI_LTL mode, iteration 1 : 235/390 places, 967/1152 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62623 ms. Remains : 235/390 places, 967/1152 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 441 ms.
Product exploration explored 100000 steps with 0 reset in 462 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 p2) p1), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 134 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 987 ms. (40 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 371 ms. (107 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 413 ms. (96 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 446 ms. (89 steps per ms) remains 5/5 properties
[2024-06-01 07:27:14] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:27:14] [INFO ] Invariant cache hit.
[2024-06-01 07:27:14] [INFO ] State equation strengthened by 164 read => feed constraints.
Problem apf3 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/338 variables, 121/131 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 46/177 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/177 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 54/392 variables, 24/201 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 18/219 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/219 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 84/476 variables, 6/225 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 0/225 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/482 variables, 3/228 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/228 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 126/608 variables, 90/318 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/608 variables, 100/418 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 0/418 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/608 variables, 0/418 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 418 constraints, problems are : Problem set: 3 solved, 2 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-06-01 07:27:14] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/392 variables, 24/202 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 18/220 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/220 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/476 variables, 6/226 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/226 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/482 variables, 3/229 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 2/231 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 0/231 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 126/608 variables, 90/321 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 100/421 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 0/421 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/608 variables, 0/421 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 421 constraints, problems are : Problem set: 3 solved, 2 unsolved in 812 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 1372ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 185 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 36 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 235/235 places, 967/967 transitions.
RANDOM walk for 40000 steps (8 resets) in 1399 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 224805 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 2
Probabilistic random walk after 224805 steps, saw 75178 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2024-06-01 07:27:19] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:27:19] [INFO ] Invariant cache hit.
[2024-06-01 07:27:19] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:27:19] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/392 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 18/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/476 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/482 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 126/608 variables, 90/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 100/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/608 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 419 constraints, problems are : Problem set: 0 solved, 2 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/392 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 18/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/476 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/482 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:27:20] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 126/608 variables, 90/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 100/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 422 constraints, problems are : Problem set: 0 solved, 2 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1564ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 208 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 30 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 235/235 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 30 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-06-01 07:27:21] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:27:21] [INFO ] Invariant cache hit.
[2024-06-01 07:27:21] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-06-01 07:27:21] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:27:21] [INFO ] Invariant cache hit.
[2024-06-01 07:27:21] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:27:23] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
[2024-06-01 07:27:23] [INFO ] Redundant transitions in 17 ms returned []
Running 961 sub problems to find dead transitions.
[2024-06-01 07:27:23] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:27:23] [INFO ] Invariant cache hit.
[2024-06-01 07:27:23] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 3 places in 232 ms of which 4 ms to minimize.
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:27:33] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:27:33] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 3 ms to minimize.
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 35 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 3 ms to minimize.
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 4 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 4 ms to minimize.
[2024-06-01 07:27:36] [INFO ] Deduced a trap composed of 56 places in 251 ms of which 4 ms to minimize.
[2024-06-01 07:27:36] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 4 ms to minimize.
[2024-06-01 07:27:36] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:27:36] [INFO ] Deduced a trap composed of 50 places in 266 ms of which 4 ms to minimize.
[2024-06-01 07:27:37] [INFO ] Deduced a trap composed of 53 places in 240 ms of which 3 ms to minimize.
[2024-06-01 07:27:37] [INFO ] Deduced a trap composed of 56 places in 239 ms of which 4 ms to minimize.
[2024-06-01 07:27:37] [INFO ] Deduced a trap composed of 41 places in 265 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:27:40] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:27:41] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 4 ms to minimize.
[2024-06-01 07:27:41] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:27:43] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:27:46] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 7 ms to minimize.
[2024-06-01 07:27:46] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 4 ms to minimize.
[2024-06-01 07:27:46] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 4 ms to minimize.
[2024-06-01 07:27:47] [INFO ] Deduced a trap composed of 21 places in 262 ms of which 4 ms to minimize.
[2024-06-01 07:27:47] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:27:48] [INFO ] Deduced a trap composed of 46 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:27:48] [INFO ] Deduced a trap composed of 46 places in 271 ms of which 4 ms to minimize.
[2024-06-01 07:27:48] [INFO ] Deduced a trap composed of 44 places in 305 ms of which 4 ms to minimize.
[2024-06-01 07:27:49] [INFO ] Deduced a trap composed of 44 places in 274 ms of which 3 ms to minimize.
[2024-06-01 07:27:49] [INFO ] Deduced a trap composed of 68 places in 293 ms of which 4 ms to minimize.
[2024-06-01 07:27:49] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:27:49] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:27:49] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:50] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:27:50] [INFO ] Deduced a trap composed of 56 places in 306 ms of which 4 ms to minimize.
[2024-06-01 07:27:50] [INFO ] Deduced a trap composed of 52 places in 297 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 59 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 34 places in 235 ms of which 4 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 49 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 52 places in 283 ms of which 3 ms to minimize.
[2024-06-01 07:28:04] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:28:04] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 2 ms to minimize.
[2024-06-01 07:28:04] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:28:05] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:28:05] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:05] [INFO ] Deduced a trap composed of 48 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:28:05] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 2 ms to minimize.
[2024-06-01 07:28:05] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:28:05] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 2 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 2 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 2 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 59 places in 202 ms of which 2 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 2 ms to minimize.
[2024-06-01 07:28:16] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:28:16] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:28:16] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:28:17] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:28:17] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/608 variables, and 95 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 76/76 constraints]
After SMT, in 60683ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60701ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62769 ms. Remains : 235/235 places, 967/967 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 864 edges and 235 vertex of which 36 / 235 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 205 transition count 236
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 158 transition count 223
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 80 transition count 164
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 80 transition count 135
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 74 transition count 135
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 292 place count 74 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 298 place count 74 transition count 123
Free-agglomeration rule applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 327 place count 74 transition count 94
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 356 place count 45 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 362 place count 45 transition count 94
Applied a total of 362 rules in 11 ms. Remains 45 /235 variables (removed 190) and now considering 94/967 (removed 873) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 45 cols
[2024-06-01 07:28:23] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 07:28:23] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-06-01 07:28:23] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 07:28:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-06-01 07:28:23] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 07:28:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:28:23] [INFO ] After 17ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 07:28:24] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:28:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-06-01 07:28:24] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:28:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
TRAPS : Iteration 1
[2024-06-01 07:28:24] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 07:28:24] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 310 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p2 p1)), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 427 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-06-01 07:28:24] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-06-01 07:28:24] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 07:28:25] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-06-01 07:28:25] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:28:25] [INFO ] Invariant cache hit.
[2024-06-01 07:28:25] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:28:26] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
Running 961 sub problems to find dead transitions.
[2024-06-01 07:28:26] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:28:26] [INFO ] Invariant cache hit.
[2024-06-01 07:28:26] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:28:37] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:28:37] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:28:38] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:28:39] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:28:41] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:28:41] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:28:41] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:28:41] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:28:41] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:28:42] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:28:42] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:28:42] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 2 ms to minimize.
[2024-06-01 07:28:42] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:28:43] [INFO ] Deduced a trap composed of 68 places in 180 ms of which 2 ms to minimize.
[2024-06-01 07:28:43] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:28:43] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:28:43] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:28:43] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:28:43] [INFO ] Deduced a trap composed of 56 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:28:43] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 64 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 3 ms to minimize.
SMT process timed out in 30457ms, After SMT, problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 30468ms
Finished structural reductions in LTL mode , in 1 iterations and 31743 ms. Remains : 235/235 places, 967/967 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 800 ms. (49 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
[2024-06-01 07:28:57] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:28:57] [INFO ] Invariant cache hit.
[2024-06-01 07:28:57] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/392 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 18/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/476 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/482 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 126/608 variables, 90/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 100/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/608 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 419 constraints, problems are : Problem set: 0 solved, 2 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/392 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 18/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/476 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/482 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 126/608 variables, 90/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 100/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 422 constraints, problems are : Problem set: 0 solved, 2 unsolved in 573 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1026ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 114 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 21 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 235/235 places, 967/967 transitions.
RANDOM walk for 40000 steps (8 resets) in 621 ms. (64 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 416556 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 2
Probabilistic random walk after 416556 steps, saw 111655 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
[2024-06-01 07:29:01] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:29:01] [INFO ] Invariant cache hit.
[2024-06-01 07:29:01] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:29:01] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/392 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 18/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/476 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/482 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 126/608 variables, 90/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 100/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/608 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 419 constraints, problems are : Problem set: 0 solved, 2 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/392 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 18/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/476 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/482 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 126/608 variables, 90/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 100/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 422 constraints, problems are : Problem set: 0 solved, 2 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1023ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 114 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 20 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 235/235 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 20 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-06-01 07:29:02] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:29:02] [INFO ] Invariant cache hit.
[2024-06-01 07:29:03] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-06-01 07:29:03] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:29:03] [INFO ] Invariant cache hit.
[2024-06-01 07:29:03] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:29:04] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1346 ms to find 0 implicit places.
[2024-06-01 07:29:04] [INFO ] Redundant transitions in 11 ms returned []
Running 961 sub problems to find dead transitions.
[2024-06-01 07:29:04] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:29:04] [INFO ] Invariant cache hit.
[2024-06-01 07:29:04] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:29:15] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 2 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:29:20] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:29:20] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 2 ms to minimize.
[2024-06-01 07:29:20] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 68 places in 178 ms of which 2 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 56 places in 181 ms of which 2 ms to minimize.
[2024-06-01 07:29:22] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:29:28] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:29:29] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:29:29] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:29:31] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:29:31] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:29:31] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:29:31] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:29:32] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:29:32] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:29:32] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 2 ms to minimize.
SMT process timed out in 30465ms, After SMT, problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 30476ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31861 ms. Remains : 235/235 places, 967/967 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 864 edges and 235 vertex of which 36 / 235 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 205 transition count 236
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 80 transition count 164
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 80 transition count 135
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 74 transition count 135
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 292 place count 74 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 298 place count 74 transition count 123
Free-agglomeration rule applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 327 place count 74 transition count 94
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 356 place count 45 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 362 place count 45 transition count 94
Applied a total of 362 rules in 10 ms. Remains 45 /235 variables (removed 190) and now considering 94/967 (removed 873) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 45 cols
[2024-06-01 07:29:34] [INFO ] Computed 13 invariants in 0 ms
[2024-06-01 07:29:34] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 07:29:34] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 07:29:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-06-01 07:29:34] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 07:29:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:29:34] [INFO ] After 17ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 74 ms
TRAPS : Iteration 1
[2024-06-01 07:29:34] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 07:29:34] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 283 ms.
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 244 ms.
Product exploration explored 100000 steps with 0 reset in 282 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 20 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-06-01 07:29:36] [INFO ] Redundant transitions in 10 ms returned []
Running 961 sub problems to find dead transitions.
[2024-06-01 07:29:36] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-06-01 07:29:36] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 07:29:36] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:29:42] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:29:42] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:29:42] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:29:42] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:29:43] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:29:43] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:29:43] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:29:43] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:29:44] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:29:44] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:29:44] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:29:44] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:45] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:29:45] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:29:45] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:29:45] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:29:45] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:29:46] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:29:46] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 2 ms to minimize.
[2024-06-01 07:29:46] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:29:47] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 2 ms to minimize.
[2024-06-01 07:29:47] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:29:48] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:29:48] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:29:48] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 4 ms to minimize.
[2024-06-01 07:29:48] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:29:48] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:29:48] [INFO ] Deduced a trap composed of 58 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 63 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 83 places in 178 ms of which 2 ms to minimize.
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 56 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 2 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:30:04] [INFO ] Deduced a trap composed of 46 places in 213 ms of which 2 ms to minimize.
[2024-06-01 07:30:04] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 2 ms to minimize.
[2024-06-01 07:30:04] [INFO ] Deduced a trap composed of 63 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:30:05] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 2 ms to minimize.
[2024-06-01 07:30:05] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:30:05] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 2 ms to minimize.
[2024-06-01 07:30:05] [INFO ] Deduced a trap composed of 57 places in 239 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 79 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 60/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:30:10] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:30:10] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:30:10] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 1 ms to minimize.
[2024-06-01 07:30:11] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:30:12] [INFO ] Deduced a trap composed of 71 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:30:13] [INFO ] Deduced a trap composed of 67 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:30:13] [INFO ] Deduced a trap composed of 60 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:30:13] [INFO ] Deduced a trap composed of 53 places in 240 ms of which 2 ms to minimize.
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 56 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 2 ms to minimize.
[2024-06-01 07:30:15] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:30:15] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:30:15] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:30:15] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:30:15] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:30:16] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:30:16] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:30:21] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:30:22] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:30:22] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:30:22] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:30:22] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 2 ms to minimize.
[2024-06-01 07:30:23] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 3 ms to minimize.
[2024-06-01 07:30:23] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:30:23] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:30:23] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 3 ms to minimize.
[2024-06-01 07:30:24] [INFO ] Deduced a trap composed of 44 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:30:24] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:30:24] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:30:24] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:30:24] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 2 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 2 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 56 places in 154 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:30:29] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:30:30] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:30:30] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:30:30] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:30:31] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 2 ms to minimize.
[2024-06-01 07:30:31] [INFO ] Deduced a trap composed of 69 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:30:32] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:30:32] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:30:33] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:30:33] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:30:33] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:30:34] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:30:34] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:30:34] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:30:35] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:30:35] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:30:35] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:30:35] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/608 variables, and 139 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 120/120 constraints]
After SMT, in 60459ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60470ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60512 ms. Remains : 235/235 places, 967/967 transitions.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-06-01 07:30:36] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:30:36] [INFO ] Invariant cache hit.
[2024-06-01 07:30:37] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-06-01 07:30:37] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:30:37] [INFO ] Invariant cache hit.
[2024-06-01 07:30:37] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:30:38] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
Running 961 sub problems to find dead transitions.
[2024-06-01 07:30:38] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-06-01 07:30:38] [INFO ] Invariant cache hit.
[2024-06-01 07:30:38] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:30:44] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:30:44] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:30:44] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:30:44] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:30:44] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:30:45] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:30:45] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:30:45] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:30:46] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:30:46] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:30:46] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:30:46] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:30:46] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:30:46] [INFO ] Deduced a trap composed of 56 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:30:46] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:30:47] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:30:47] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:30:47] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:30:47] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:30:47] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:30:49] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:30:49] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:30:50] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:30:51] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:30:52] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:30:53] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 2 ms to minimize.
[2024-06-01 07:30:53] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:30:53] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:30:53] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:30:54] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:30:54] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:30:54] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 2 ms to minimize.
[2024-06-01 07:30:54] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:30:54] [INFO ] Deduced a trap composed of 68 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:30:54] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:30:55] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:30:55] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:30:55] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:30:55] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:30:55] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:31:05] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:31:05] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 2 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 79 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 60/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:31:14] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:31:14] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:31:15] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:31:15] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:31:15] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:31:15] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:31:15] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:31:15] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 2 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 2 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:31:24] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:31:24] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:31:24] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:31:25] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:31:25] [INFO ] Deduced a trap composed of 53 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:31:27] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:31:28] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/106 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 07:31:34] [INFO ] Deduced a trap composed of 67 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:31:34] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 2 ms to minimize.
[2024-06-01 07:31:34] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:31:35] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:31:35] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:31:36] [INFO ] Deduced a trap composed of 58 places in 188 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/608 variables, and 112 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 93/93 constraints]
After SMT, in 60451ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60462ms
Finished structural reductions in LTL mode , in 1 iterations and 61773 ms. Remains : 235/235 places, 967/967 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-05 finished in 329968 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||G(F((!p1 U (p2||G(!p1)))))||(F((!p1 U (p2||G(!p1))))&&X(p3)))))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-13
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 390 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 390 transition count 1146
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 384 transition count 1146
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 384 transition count 1033
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 271 transition count 1033
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 244 place count 265 transition count 997
Iterating global reduction 2 with 6 rules applied. Total rules applied 250 place count 265 transition count 997
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 308 place count 236 transition count 968
Applied a total of 308 rules in 32 ms. Remains 236 /390 variables (removed 154) and now considering 968/1152 (removed 184) transitions.
[2024-06-01 07:31:39] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-06-01 07:31:39] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 07:31:39] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-06-01 07:31:39] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:31:39] [INFO ] Invariant cache hit.
[2024-06-01 07:31:39] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:31:40] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 07:31:40] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:31:40] [INFO ] Invariant cache hit.
[2024-06-01 07:31:40] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:31:46] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:31:46] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:31:48] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:31:48] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:31:48] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:31:48] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:31:48] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:31:49] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:31:49] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:31:49] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:31:49] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:31:49] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:31:49] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:31:49] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:31:50] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:31:51] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 1 ms to minimize.
[2024-06-01 07:31:52] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:31:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:31:52] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:31:52] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:31:53] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:31:53] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:31:53] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:31:53] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:31:53] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:31:53] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:31:54] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:31:54] [INFO ] Deduced a trap composed of 62 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:31:54] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:31:54] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:31:54] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:31:55] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:31:55] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:31:55] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:31:55] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:32:02] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:32:03] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:32:03] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:32:04] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:32:04] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:32:04] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:32:04] [INFO ] Deduced a trap composed of 79 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:32:04] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:32:04] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:32:04] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:32:05] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:32:05] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:32:05] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:32:05] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:32:05] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:32:05] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:32:06] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:32:06] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:32:06] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 2 ms to minimize.
[2024-06-01 07:32:06] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 79 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 60/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:32:13] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:32:13] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 2 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:32:14] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:32:15] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:32:15] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:32:15] [INFO ] Deduced a trap composed of 70 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:32:15] [INFO ] Deduced a trap composed of 68 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:32:15] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:32:15] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:32:17] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:32:17] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:32:18] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:32:19] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:32:19] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:32:20] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:32:20] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:32:20] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:32:21] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:32:21] [INFO ] Deduced a trap composed of 53 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:32:22] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:32:22] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:32:22] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:32:22] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:32:22] [INFO ] Deduced a trap composed of 69 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:32:22] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:32:23] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:32:23] [INFO ] Deduced a trap composed of 46 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:32:23] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:32:23] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:32:23] [INFO ] Deduced a trap composed of 58 places in 183 ms of which 2 ms to minimize.
[2024-06-01 07:32:24] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:32:28] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:32:29] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:32:29] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:32:29] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:32:30] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:32:30] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:32:30] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:32:30] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:32:30] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:32:31] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:32:31] [INFO ] Deduced a trap composed of 59 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:32:32] [INFO ] Deduced a trap composed of 69 places in 191 ms of which 2 ms to minimize.
[2024-06-01 07:32:32] [INFO ] Deduced a trap composed of 56 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:32:32] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:32:32] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 2 ms to minimize.
[2024-06-01 07:32:32] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:32:33] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:32:33] [INFO ] Deduced a trap composed of 53 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:32:33] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:32:33] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:32:39] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:32:39] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:32:39] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:32:39] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:32:40] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:32:40] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:32:40] [INFO ] Deduced a trap composed of 67 places in 154 ms of which 2 ms to minimize.
SMT process timed out in 60566ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60577ms
Starting structural reductions in LI_LTL mode, iteration 1 : 236/390 places, 968/1152 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61913 ms. Remains : 236/390 places, 968/1152 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 340 ms.
Product exploration explored 100000 steps with 25000 reset in 355 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 p2 p0 (NOT p1) p3), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p2) p1 (NOT p3)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1 (NOT p3)), (AND (NOT p0) (NOT p2) p1 (NOT p3)), (AND (NOT p0) (NOT p2) p1 (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 1647 ms. (24 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 8/8 properties
[2024-06-01 07:32:43] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:32:43] [INFO ] Invariant cache hit.
[2024-06-01 07:32:43] [INFO ] State equation strengthened by 164 read => feed constraints.
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 8/160 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 07:32:43] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 270/430 variables, 160/174 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 74/248 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/248 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 36/466 variables, 16/264 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 14/278 constraints. Problems are: Problem set: 2 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 56/522 variables, 4/282 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/522 variables, 0/282 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 4/526 variables, 2/284 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 0/284 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 84/610 variables, 60/344 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 76/420 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/610 variables, 0/420 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/610 variables, 0/420 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 420 constraints, problems are : Problem set: 2 solved, 6 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 07:32:44] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:32:44] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/16 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 270/430 variables, 160/176 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 74/250 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 0/250 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 36/466 variables, 16/266 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 14/280 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 0/280 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 56/522 variables, 4/284 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/522 variables, 0/284 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 4/526 variables, 2/286 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 6/292 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 07:32:45] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 1/293 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 0/293 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 84/610 variables, 60/353 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/610 variables, 76/429 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/610 variables, 0/429 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/610 variables, 0/429 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 429 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 2378ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1903 ms.
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 20 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 236/236 places, 968/968 transitions.
RANDOM walk for 40000 steps (8 resets) in 1015 ms. (39 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 208383 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 6
Probabilistic random walk after 208383 steps, saw 64261 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-06-01 07:32:51] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:32:51] [INFO ] Invariant cache hit.
[2024-06-01 07:32:51] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:32:51] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:32:51] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 270/430 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 74/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:32:52] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 36/466 variables, 16/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/466 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 56/522 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/522 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 4/526 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 84/610 variables, 60/346 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/610 variables, 76/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/610 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/610 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 422 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1158 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 270/430 variables, 160/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 74/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 36/466 variables, 16/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 56/522 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/522 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 4/526 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 6/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:32:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:32:53] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 84/610 variables, 60/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/610 variables, 76/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/610 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/610 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 430 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1331 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 2505ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1157 ms.
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 23 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 19 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-06-01 07:32:55] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:32:55] [INFO ] Invariant cache hit.
[2024-06-01 07:32:55] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-06-01 07:32:55] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:32:55] [INFO ] Invariant cache hit.
[2024-06-01 07:32:55] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:32:56] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1296 ms to find 0 implicit places.
[2024-06-01 07:32:56] [INFO ] Redundant transitions in 11 ms returned []
Running 962 sub problems to find dead transitions.
[2024-06-01 07:32:56] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:32:56] [INFO ] Invariant cache hit.
[2024-06-01 07:32:56] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:33:02] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:33:02] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:33:02] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:33:02] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:33:03] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:33:03] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:33:03] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:33:03] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:33:04] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:33:04] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:33:04] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:33:04] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:33:04] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:33:04] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:33:05] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:33:05] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:33:05] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:33:05] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:33:05] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:33:05] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:33:08] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:33:08] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:33:08] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:33:09] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:33:09] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:33:09] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:33:09] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:33:10] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:33:10] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:33:10] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:33:10] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:33:10] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:33:10] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:33:10] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:33:11] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:33:18] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 1 ms to minimize.
[2024-06-01 07:33:18] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:33:18] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:33:19] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:33:19] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:33:19] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:33:19] [INFO ] Deduced a trap composed of 79 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:33:19] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:33:19] [INFO ] Deduced a trap composed of 52 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:33:20] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:33:20] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:33:20] [INFO ] Deduced a trap composed of 62 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:33:20] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:33:20] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:33:21] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:33:21] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:33:21] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:33:21] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:33:21] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:33:22] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:33:26] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 80 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 61/80 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:33:30] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:33:30] [INFO ] Deduced a trap composed of 52 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:33:30] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:33:31] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:33:31] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 3 ms to minimize.
[2024-06-01 07:33:32] [INFO ] Deduced a trap composed of 52 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:33:33] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 3 ms to minimize.
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 54 places in 258 ms of which 3 ms to minimize.
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 47 places in 272 ms of which 4 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 63 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 2 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 38 places in 256 ms of which 3 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 54 places in 237 ms of which 4 ms to minimize.
[2024-06-01 07:33:39] [INFO ] Deduced a trap composed of 65 places in 302 ms of which 4 ms to minimize.
[2024-06-01 07:33:39] [INFO ] Deduced a trap composed of 56 places in 298 ms of which 4 ms to minimize.
[2024-06-01 07:33:39] [INFO ] Deduced a trap composed of 49 places in 305 ms of which 4 ms to minimize.
[2024-06-01 07:33:40] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:33:43] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:33:43] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:33:43] [INFO ] Deduced a trap composed of 51 places in 265 ms of which 3 ms to minimize.
[2024-06-01 07:33:44] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 4 ms to minimize.
[2024-06-01 07:33:44] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 36 places in 223 ms of which 3 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 67 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 2 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:33:46] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 8 ms to minimize.
[2024-06-01 07:33:46] [INFO ] Deduced a trap composed of 51 places in 211 ms of which 3 ms to minimize.
[2024-06-01 07:33:46] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 4 ms to minimize.
[2024-06-01 07:33:46] [INFO ] Deduced a trap composed of 69 places in 245 ms of which 3 ms to minimize.
[2024-06-01 07:33:47] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:33:47] [INFO ] Deduced a trap composed of 52 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:33:47] [INFO ] Deduced a trap composed of 45 places in 268 ms of which 4 ms to minimize.
[2024-06-01 07:33:48] [INFO ] Deduced a trap composed of 57 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:33:48] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 4 ms to minimize.
[2024-06-01 07:33:48] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:33:51] [INFO ] Deduced a trap composed of 67 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:33:52] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 2 ms to minimize.
[2024-06-01 07:33:52] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:33:52] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:33:52] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:33:53] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:33:53] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:33:53] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:33:54] [INFO ] Deduced a trap composed of 58 places in 250 ms of which 3 ms to minimize.
[2024-06-01 07:33:54] [INFO ] Deduced a trap composed of 59 places in 253 ms of which 3 ms to minimize.
[2024-06-01 07:33:55] [INFO ] Deduced a trap composed of 59 places in 211 ms of which 3 ms to minimize.
[2024-06-01 07:33:55] [INFO ] Deduced a trap composed of 68 places in 259 ms of which 3 ms to minimize.
[2024-06-01 07:33:56] [INFO ] Deduced a trap composed of 76 places in 281 ms of which 3 ms to minimize.
[2024-06-01 07:33:56] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:33:56] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:33:56] [INFO ] Deduced a trap composed of 46 places in 238 ms of which 3 ms to minimize.
[2024-06-01 07:33:57] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 3 ms to minimize.
SMT process timed out in 60667ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60678ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62012 ms. Remains : 236/236 places, 968/968 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 849 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 569 transitions
Reduce isomorphic transitions removed 683 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 240
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 161 transition count 240
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 91 place count 161 transition count 228
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 120 place count 144 transition count 228
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 238 place count 85 transition count 169
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 265 place count 85 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 271 place count 82 transition count 142
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 274 place count 82 transition count 139
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 281 place count 82 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 281 place count 82 transition count 131
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 81 transition count 131
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 315 place count 81 transition count 99
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 347 place count 49 transition count 99
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 353 place count 49 transition count 99
Applied a total of 353 rules in 18 ms. Remains 49 /236 variables (removed 187) and now considering 99/968 (removed 869) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 99 rows 49 cols
[2024-06-01 07:33:57] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 07:33:57] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 07:33:57] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 13 ms returned sat
[2024-06-01 07:33:57] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 07:33:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 07:33:57] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 07:33:57] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-01 07:33:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:33:57] [INFO ] After 81ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 07:33:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:33:57] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:33:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
TRAPS : Iteration 1
[2024-06-01 07:33:57] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 07:33:57] [INFO ] After 621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 809 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p1) p3), (X (X p2)), (G (OR p0 p2 (NOT p1))), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 257 ms :[false, false, false, false, false]
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-06-01 07:33:58] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-06-01 07:33:58] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 07:33:59] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-06-01 07:33:59] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:33:59] [INFO ] Invariant cache hit.
[2024-06-01 07:33:59] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:34:00] [INFO ] Implicit Places using invariants and state equation in 1386 ms returned []
Implicit Place search using SMT with State Equation took 1916 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 07:34:00] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:34:00] [INFO ] Invariant cache hit.
[2024-06-01 07:34:00] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 4 ms to minimize.
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:34:11] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:34:12] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 3 ms to minimize.
[2024-06-01 07:34:12] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 3 ms to minimize.
[2024-06-01 07:34:13] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 4 ms to minimize.
[2024-06-01 07:34:13] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:34:13] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:34:13] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:34:14] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:34:14] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:34:14] [INFO ] Deduced a trap composed of 49 places in 253 ms of which 3 ms to minimize.
[2024-06-01 07:34:15] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 4 ms to minimize.
[2024-06-01 07:34:15] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:34:15] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:34:15] [INFO ] Deduced a trap composed of 48 places in 251 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:34:17] [INFO ] Deduced a trap composed of 54 places in 213 ms of which 4 ms to minimize.
[2024-06-01 07:34:18] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 3 ms to minimize.
[2024-06-01 07:34:18] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:34:18] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:34:18] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:34:19] [INFO ] Deduced a trap composed of 41 places in 258 ms of which 3 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 55 places in 243 ms of which 3 ms to minimize.
[2024-06-01 07:34:21] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:34:21] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 66 places in 234 ms of which 3 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 62 places in 254 ms of which 3 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 76 places in 263 ms of which 4 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 4 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 75 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 50 places in 236 ms of which 3 ms to minimize.
[2024-06-01 07:34:24] [INFO ] Deduced a trap composed of 57 places in 235 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:34:35] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:34:37] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:34:37] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 4 ms to minimize.
[2024-06-01 07:34:37] [INFO ] Deduced a trap composed of 46 places in 267 ms of which 4 ms to minimize.
[2024-06-01 07:34:38] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:34:38] [INFO ] Deduced a trap composed of 54 places in 223 ms of which 4 ms to minimize.
[2024-06-01 07:34:38] [INFO ] Deduced a trap composed of 44 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:34:38] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:34:39] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:34:39] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 2 ms to minimize.
[2024-06-01 07:34:39] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 2 ms to minimize.
[2024-06-01 07:34:40] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:34:40] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:34:40] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:34:40] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:34:41] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:34:41] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:34:41] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:34:41] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:34:47] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 3 ms to minimize.
[2024-06-01 07:34:47] [INFO ] Deduced a trap composed of 53 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:34:48] [INFO ] Deduced a trap composed of 65 places in 283 ms of which 4 ms to minimize.
[2024-06-01 07:34:48] [INFO ] Deduced a trap composed of 57 places in 275 ms of which 4 ms to minimize.
[2024-06-01 07:34:48] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 3 ms to minimize.
[2024-06-01 07:34:48] [INFO ] Deduced a trap composed of 46 places in 274 ms of which 4 ms to minimize.
[2024-06-01 07:34:49] [INFO ] Deduced a trap composed of 52 places in 240 ms of which 3 ms to minimize.
[2024-06-01 07:34:49] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 3 ms to minimize.
[2024-06-01 07:34:49] [INFO ] Deduced a trap composed of 51 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:34:50] [INFO ] Deduced a trap composed of 64 places in 279 ms of which 4 ms to minimize.
[2024-06-01 07:34:50] [INFO ] Deduced a trap composed of 51 places in 262 ms of which 4 ms to minimize.
[2024-06-01 07:34:50] [INFO ] Deduced a trap composed of 34 places in 284 ms of which 4 ms to minimize.
[2024-06-01 07:34:50] [INFO ] Deduced a trap composed of 45 places in 271 ms of which 4 ms to minimize.
[2024-06-01 07:34:51] [INFO ] Deduced a trap composed of 52 places in 254 ms of which 4 ms to minimize.
[2024-06-01 07:34:51] [INFO ] Deduced a trap composed of 52 places in 240 ms of which 3 ms to minimize.
[2024-06-01 07:34:51] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:34:52] [INFO ] Deduced a trap composed of 46 places in 283 ms of which 4 ms to minimize.
[2024-06-01 07:34:52] [INFO ] Deduced a trap composed of 53 places in 281 ms of which 3 ms to minimize.
[2024-06-01 07:34:52] [INFO ] Deduced a trap composed of 48 places in 293 ms of which 3 ms to minimize.
[2024-06-01 07:34:52] [INFO ] Deduced a trap composed of 55 places in 294 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:34:55] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:34:56] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:34:56] [INFO ] Deduced a trap composed of 44 places in 257 ms of which 4 ms to minimize.
[2024-06-01 07:34:56] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:34:57] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:34:57] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:34:57] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:34:58] [INFO ] Deduced a trap composed of 59 places in 249 ms of which 4 ms to minimize.
[2024-06-01 07:34:59] [INFO ] Deduced a trap composed of 49 places in 298 ms of which 4 ms to minimize.
[2024-06-01 07:34:59] [INFO ] Deduced a trap composed of 59 places in 277 ms of which 4 ms to minimize.
[2024-06-01 07:35:00] [INFO ] Deduced a trap composed of 56 places in 279 ms of which 3 ms to minimize.
[2024-06-01 07:35:00] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 4 ms to minimize.
[2024-06-01 07:35:00] [INFO ] Deduced a trap composed of 58 places in 245 ms of which 3 ms to minimize.
[2024-06-01 07:35:00] [INFO ] Deduced a trap composed of 50 places in 277 ms of which 4 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 55 places in 283 ms of which 3 ms to minimize.
SMT process timed out in 60679ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60698ms
Finished structural reductions in LTL mode , in 1 iterations and 62623 ms. Remains : 236/236 places, 968/968 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 p2 (NOT p1) p3)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[false, false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 2051 ms. (19 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 349 ms. (114 steps per ms) remains 5/5 properties
[2024-06-01 07:35:02] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:35:02] [INFO ] Invariant cache hit.
[2024-06-01 07:35:02] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 270/430 variables, 160/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 74/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 36/466 variables, 16/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 56/522 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/522 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 4/526 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 84/610 variables, 60/344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 76/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/610 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/610 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 420 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1127 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:35:04] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 270/430 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 74/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:35:04] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 36/466 variables, 16/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/466 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 56/522 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/522 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 4/526 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/526 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 84/610 variables, 60/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/610 variables, 76/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/610 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/610 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 428 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1897 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 3042ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1127 ms.
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 33 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 236/236 places, 968/968 transitions.
RANDOM walk for 40000 steps (8 resets) in 1761 ms. (22 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 170163 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 5
Probabilistic random walk after 170163 steps, saw 56149 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-06-01 07:35:11] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:35:11] [INFO ] Invariant cache hit.
[2024-06-01 07:35:11] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:35:11] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 270/430 variables, 160/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 74/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 36/466 variables, 16/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 56/522 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/522 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 4/526 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 84/610 variables, 60/344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 76/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/610 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/610 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 420 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1055 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:35:12] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 270/430 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 74/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:35:12] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 36/466 variables, 16/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/466 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 56/522 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/522 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 4/526 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:35:13] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/526 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 84/610 variables, 60/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/610 variables, 76/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/610 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/610 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 428 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1887 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 2957ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1121 ms.
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 30 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 31 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-06-01 07:35:15] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:35:15] [INFO ] Invariant cache hit.
[2024-06-01 07:35:15] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-06-01 07:35:15] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:35:15] [INFO ] Invariant cache hit.
[2024-06-01 07:35:16] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:35:17] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
[2024-06-01 07:35:17] [INFO ] Redundant transitions in 19 ms returned []
Running 962 sub problems to find dead transitions.
[2024-06-01 07:35:17] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:35:17] [INFO ] Invariant cache hit.
[2024-06-01 07:35:17] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:35:28] [INFO ] Deduced a trap composed of 53 places in 206 ms of which 3 ms to minimize.
[2024-06-01 07:35:28] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:35:29] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:35:29] [INFO ] Deduced a trap composed of 43 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:35:30] [INFO ] Deduced a trap composed of 58 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:35:30] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:35:30] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:35:30] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:35:31] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:35:31] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:35:31] [INFO ] Deduced a trap composed of 49 places in 234 ms of which 3 ms to minimize.
[2024-06-01 07:35:32] [INFO ] Deduced a trap composed of 45 places in 283 ms of which 3 ms to minimize.
[2024-06-01 07:35:32] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:35:32] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:35:32] [INFO ] Deduced a trap composed of 48 places in 251 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:35:34] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:35:34] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:35:34] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:35:34] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:35:35] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:35:36] [INFO ] Deduced a trap composed of 41 places in 271 ms of which 4 ms to minimize.
[2024-06-01 07:35:36] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 3 ms to minimize.
[2024-06-01 07:35:36] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 3 ms to minimize.
[2024-06-01 07:35:37] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:35:37] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 6 ms to minimize.
[2024-06-01 07:35:37] [INFO ] Deduced a trap composed of 64 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:35:38] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 3 ms to minimize.
[2024-06-01 07:35:38] [INFO ] Deduced a trap composed of 62 places in 264 ms of which 4 ms to minimize.
[2024-06-01 07:35:39] [INFO ] Deduced a trap composed of 76 places in 266 ms of which 3 ms to minimize.
[2024-06-01 07:35:39] [INFO ] Deduced a trap composed of 53 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:35:39] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:35:39] [INFO ] Deduced a trap composed of 44 places in 280 ms of which 4 ms to minimize.
[2024-06-01 07:35:40] [INFO ] Deduced a trap composed of 75 places in 228 ms of which 4 ms to minimize.
[2024-06-01 07:35:40] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:35:40] [INFO ] Deduced a trap composed of 57 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:35:51] [INFO ] Deduced a trap composed of 36 places in 234 ms of which 3 ms to minimize.
[2024-06-01 07:35:53] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:35:53] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 3 ms to minimize.
[2024-06-01 07:35:54] [INFO ] Deduced a trap composed of 46 places in 255 ms of which 4 ms to minimize.
[2024-06-01 07:35:54] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:35:54] [INFO ] Deduced a trap composed of 54 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:35:55] [INFO ] Deduced a trap composed of 44 places in 257 ms of which 3 ms to minimize.
[2024-06-01 07:35:55] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:35:55] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:35:56] [INFO ] Deduced a trap composed of 45 places in 206 ms of which 3 ms to minimize.
[2024-06-01 07:35:56] [INFO ] Deduced a trap composed of 45 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:35:57] [INFO ] Deduced a trap composed of 53 places in 293 ms of which 3 ms to minimize.
[2024-06-01 07:35:57] [INFO ] Deduced a trap composed of 36 places in 333 ms of which 3 ms to minimize.
[2024-06-01 07:35:57] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 4 ms to minimize.
[2024-06-01 07:35:58] [INFO ] Deduced a trap composed of 46 places in 287 ms of which 4 ms to minimize.
[2024-06-01 07:35:58] [INFO ] Deduced a trap composed of 53 places in 218 ms of which 4 ms to minimize.
[2024-06-01 07:35:58] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:35:58] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:35:59] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:36:00] [INFO ] Deduced a trap composed of 59 places in 293 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:36:05] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 4 ms to minimize.
[2024-06-01 07:36:06] [INFO ] Deduced a trap composed of 53 places in 245 ms of which 3 ms to minimize.
[2024-06-01 07:36:06] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 3 ms to minimize.
[2024-06-01 07:36:06] [INFO ] Deduced a trap composed of 57 places in 285 ms of which 4 ms to minimize.
[2024-06-01 07:36:06] [INFO ] Deduced a trap composed of 46 places in 250 ms of which 3 ms to minimize.
[2024-06-01 07:36:07] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 4 ms to minimize.
[2024-06-01 07:36:07] [INFO ] Deduced a trap composed of 52 places in 235 ms of which 3 ms to minimize.
[2024-06-01 07:36:07] [INFO ] Deduced a trap composed of 47 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:36:08] [INFO ] Deduced a trap composed of 51 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:36:08] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 4 ms to minimize.
[2024-06-01 07:36:08] [INFO ] Deduced a trap composed of 51 places in 284 ms of which 4 ms to minimize.
[2024-06-01 07:36:08] [INFO ] Deduced a trap composed of 34 places in 278 ms of which 3 ms to minimize.
[2024-06-01 07:36:09] [INFO ] Deduced a trap composed of 45 places in 268 ms of which 4 ms to minimize.
[2024-06-01 07:36:09] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 3 ms to minimize.
[2024-06-01 07:36:09] [INFO ] Deduced a trap composed of 52 places in 240 ms of which 3 ms to minimize.
[2024-06-01 07:36:09] [INFO ] Deduced a trap composed of 35 places in 246 ms of which 3 ms to minimize.
[2024-06-01 07:36:10] [INFO ] Deduced a trap composed of 46 places in 283 ms of which 4 ms to minimize.
[2024-06-01 07:36:10] [INFO ] Deduced a trap composed of 53 places in 268 ms of which 4 ms to minimize.
[2024-06-01 07:36:10] [INFO ] Deduced a trap composed of 48 places in 291 ms of which 4 ms to minimize.
[2024-06-01 07:36:11] [INFO ] Deduced a trap composed of 55 places in 281 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:36:13] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:36:14] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 6 ms to minimize.
[2024-06-01 07:36:14] [INFO ] Deduced a trap composed of 44 places in 256 ms of which 4 ms to minimize.
[2024-06-01 07:36:14] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:36:14] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:36:15] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 3 ms to minimize.
[2024-06-01 07:36:15] [INFO ] Deduced a trap composed of 45 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:36:16] [INFO ] Deduced a trap composed of 59 places in 237 ms of which 4 ms to minimize.
[2024-06-01 07:36:17] [INFO ] Deduced a trap composed of 49 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:36:17] [INFO ] Deduced a trap composed of 59 places in 274 ms of which 4 ms to minimize.
[2024-06-01 07:36:18] [INFO ] Deduced a trap composed of 56 places in 263 ms of which 3 ms to minimize.
SMT process timed out in 60730ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60748ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62803 ms. Remains : 236/236 places, 968/968 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 849 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 569 transitions
Reduce isomorphic transitions removed 683 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 240
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 161 transition count 240
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 91 place count 161 transition count 228
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 120 place count 144 transition count 228
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 238 place count 85 transition count 169
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 265 place count 85 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 271 place count 82 transition count 142
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 274 place count 82 transition count 139
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 281 place count 82 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 281 place count 82 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 81 transition count 131
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 315 place count 81 transition count 99
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 347 place count 49 transition count 99
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 353 place count 49 transition count 99
Applied a total of 353 rules in 25 ms. Remains 49 /236 variables (removed 187) and now considering 99/968 (removed 869) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 99 rows 49 cols
[2024-06-01 07:36:18] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 07:36:18] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 07:36:18] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 07:36:18] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-01 07:36:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 07:36:18] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 07:36:18] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-01 07:36:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:36:18] [INFO ] After 72ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-01 07:36:18] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:36:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-06-01 07:36:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:36:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
TRAPS : Iteration 1
[2024-06-01 07:36:18] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-01 07:36:18] [INFO ] After 598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 786 ms.
Knowledge obtained : [(AND p2 (NOT p1) p3)]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 310 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 252 ms :[false, false, false, false, false]
Product exploration explored 100000 steps with 25000 reset in 549 ms.
Product exploration explored 100000 steps with 25000 reset in 576 ms.
Applying partial POR strategy [false, true, true, false, false]
Stuttering acceptance computed with spot in 256 ms :[false, false, false, false, false]
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 34 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-06-01 07:36:21] [INFO ] Redundant transitions in 17 ms returned []
Running 962 sub problems to find dead transitions.
[2024-06-01 07:36:21] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-06-01 07:36:21] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 07:36:21] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:36:30] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 4 ms to minimize.
[2024-06-01 07:36:30] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:36:30] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:36:30] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:36:30] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:36:30] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:36:30] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:36:30] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:36:31] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:36:32] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:36:32] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:36:32] [INFO ] Deduced a trap composed of 56 places in 250 ms of which 3 ms to minimize.
[2024-06-01 07:36:33] [INFO ] Deduced a trap composed of 18 places in 292 ms of which 3 ms to minimize.
[2024-06-01 07:36:33] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:36:33] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:36:33] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:36:34] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:36:34] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:36:34] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:36:34] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:36:36] [INFO ] Deduced a trap composed of 57 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:36:36] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:36:39] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:36:40] [INFO ] Deduced a trap composed of 34 places in 245 ms of which 4 ms to minimize.
[2024-06-01 07:36:40] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:36:41] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 3 ms to minimize.
[2024-06-01 07:36:41] [INFO ] Deduced a trap composed of 71 places in 253 ms of which 4 ms to minimize.
[2024-06-01 07:36:41] [INFO ] Deduced a trap composed of 57 places in 242 ms of which 4 ms to minimize.
[2024-06-01 07:36:42] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 4 ms to minimize.
[2024-06-01 07:36:42] [INFO ] Deduced a trap composed of 48 places in 259 ms of which 3 ms to minimize.
[2024-06-01 07:36:42] [INFO ] Deduced a trap composed of 57 places in 296 ms of which 4 ms to minimize.
[2024-06-01 07:36:43] [INFO ] Deduced a trap composed of 43 places in 283 ms of which 4 ms to minimize.
[2024-06-01 07:36:43] [INFO ] Deduced a trap composed of 64 places in 295 ms of which 4 ms to minimize.
[2024-06-01 07:36:43] [INFO ] Deduced a trap composed of 57 places in 280 ms of which 4 ms to minimize.
[2024-06-01 07:36:43] [INFO ] Deduced a trap composed of 68 places in 258 ms of which 4 ms to minimize.
[2024-06-01 07:36:44] [INFO ] Deduced a trap composed of 60 places in 307 ms of which 4 ms to minimize.
[2024-06-01 07:36:44] [INFO ] Deduced a trap composed of 63 places in 296 ms of which 4 ms to minimize.
[2024-06-01 07:36:45] [INFO ] Deduced a trap composed of 53 places in 306 ms of which 4 ms to minimize.
[2024-06-01 07:36:45] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 3 ms to minimize.
[2024-06-01 07:36:45] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:37:00] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:37:01] [INFO ] Deduced a trap composed of 17 places in 315 ms of which 4 ms to minimize.
[2024-06-01 07:37:02] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 3 ms to minimize.
[2024-06-01 07:37:02] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 3 ms to minimize.
[2024-06-01 07:37:02] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 4 ms to minimize.
[2024-06-01 07:37:03] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 3 ms to minimize.
[2024-06-01 07:37:03] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 4 ms to minimize.
[2024-06-01 07:37:03] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:37:03] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:37:04] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:37:04] [INFO ] Deduced a trap composed of 45 places in 248 ms of which 3 ms to minimize.
[2024-06-01 07:37:04] [INFO ] Deduced a trap composed of 52 places in 246 ms of which 3 ms to minimize.
[2024-06-01 07:37:05] [INFO ] Deduced a trap composed of 62 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:37:05] [INFO ] Deduced a trap composed of 49 places in 243 ms of which 3 ms to minimize.
[2024-06-01 07:37:05] [INFO ] Deduced a trap composed of 52 places in 223 ms of which 4 ms to minimize.
[2024-06-01 07:37:06] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:37:06] [INFO ] Deduced a trap composed of 55 places in 206 ms of which 3 ms to minimize.
[2024-06-01 07:37:06] [INFO ] Deduced a trap composed of 62 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:37:06] [INFO ] Deduced a trap composed of 48 places in 269 ms of which 4 ms to minimize.
[2024-06-01 07:37:07] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:37:15] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:37:16] [INFO ] Deduced a trap composed of 46 places in 295 ms of which 3 ms to minimize.
[2024-06-01 07:37:16] [INFO ] Deduced a trap composed of 48 places in 265 ms of which 4 ms to minimize.
[2024-06-01 07:37:16] [INFO ] Deduced a trap composed of 44 places in 287 ms of which 4 ms to minimize.
[2024-06-01 07:37:16] [INFO ] Deduced a trap composed of 44 places in 272 ms of which 4 ms to minimize.
[2024-06-01 07:37:17] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:37:17] [INFO ] Deduced a trap composed of 44 places in 281 ms of which 3 ms to minimize.
[2024-06-01 07:37:17] [INFO ] Deduced a trap composed of 44 places in 296 ms of which 3 ms to minimize.
[2024-06-01 07:37:18] [INFO ] Deduced a trap composed of 34 places in 308 ms of which 4 ms to minimize.
[2024-06-01 07:37:18] [INFO ] Deduced a trap composed of 44 places in 286 ms of which 3 ms to minimize.
[2024-06-01 07:37:19] [INFO ] Deduced a trap composed of 52 places in 257 ms of which 3 ms to minimize.
[2024-06-01 07:37:19] [INFO ] Deduced a trap composed of 66 places in 283 ms of which 4 ms to minimize.
[2024-06-01 07:37:19] [INFO ] Deduced a trap composed of 48 places in 251 ms of which 3 ms to minimize.
[2024-06-01 07:37:20] [INFO ] Deduced a trap composed of 58 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:37:20] [INFO ] Deduced a trap composed of 52 places in 248 ms of which 3 ms to minimize.
[2024-06-01 07:37:20] [INFO ] Deduced a trap composed of 55 places in 299 ms of which 3 ms to minimize.
[2024-06-01 07:37:21] [INFO ] Deduced a trap composed of 52 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:37:21] [INFO ] Deduced a trap composed of 56 places in 266 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/610 variables, and 97 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 78/78 constraints]
After SMT, in 60756ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60775ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60836 ms. Remains : 236/236 places, 968/968 transitions.
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-06-01 07:37:22] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:37:22] [INFO ] Invariant cache hit.
[2024-06-01 07:37:22] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-06-01 07:37:22] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:37:22] [INFO ] Invariant cache hit.
[2024-06-01 07:37:23] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 07:37:24] [INFO ] Implicit Places using invariants and state equation in 1463 ms returned []
Implicit Place search using SMT with State Equation took 1983 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 07:37:24] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-06-01 07:37:24] [INFO ] Invariant cache hit.
[2024-06-01 07:37:24] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:37:34] [INFO ] Deduced a trap composed of 3 places in 308 ms of which 3 ms to minimize.
[2024-06-01 07:37:34] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:37:34] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:37:34] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:37:34] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:37:34] [INFO ] Deduced a trap composed of 53 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:37:35] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:37:36] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:37:36] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:37:36] [INFO ] Deduced a trap composed of 58 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:37:37] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:37:37] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 4 ms to minimize.
[2024-06-01 07:37:37] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:37:38] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 3 ms to minimize.
[2024-06-01 07:37:38] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:37:38] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 3 ms to minimize.
[2024-06-01 07:37:38] [INFO ] Deduced a trap composed of 45 places in 246 ms of which 3 ms to minimize.
[2024-06-01 07:37:39] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:37:39] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:37:39] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:37:41] [INFO ] Deduced a trap composed of 54 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:37:42] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:37:42] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:37:42] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:37:42] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:37:43] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:37:43] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:37:44] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:37:44] [INFO ] Deduced a trap composed of 55 places in 229 ms of which 4 ms to minimize.
[2024-06-01 07:37:44] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:37:45] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:37:45] [INFO ] Deduced a trap composed of 66 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:37:46] [INFO ] Deduced a trap composed of 62 places in 285 ms of which 3 ms to minimize.
[2024-06-01 07:37:46] [INFO ] Deduced a trap composed of 76 places in 230 ms of which 4 ms to minimize.
[2024-06-01 07:37:46] [INFO ] Deduced a trap composed of 53 places in 240 ms of which 4 ms to minimize.
[2024-06-01 07:37:47] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:37:47] [INFO ] Deduced a trap composed of 44 places in 274 ms of which 3 ms to minimize.
[2024-06-01 07:37:47] [INFO ] Deduced a trap composed of 75 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:37:47] [INFO ] Deduced a trap composed of 50 places in 237 ms of which 3 ms to minimize.
[2024-06-01 07:37:48] [INFO ] Deduced a trap composed of 57 places in 236 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:37:59] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 3 ms to minimize.
[2024-06-01 07:38:01] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 3 ms to minimize.
[2024-06-01 07:38:01] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:38:01] [INFO ] Deduced a trap composed of 46 places in 252 ms of which 3 ms to minimize.
[2024-06-01 07:38:02] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:38:02] [INFO ] Deduced a trap composed of 54 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:38:02] [INFO ] Deduced a trap composed of 44 places in 248 ms of which 3 ms to minimize.
[2024-06-01 07:38:02] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:38:03] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2024-06-01 07:38:03] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 3 ms to minimize.
[2024-06-01 07:38:04] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 3 ms to minimize.
[2024-06-01 07:38:04] [INFO ] Deduced a trap composed of 53 places in 276 ms of which 4 ms to minimize.
[2024-06-01 07:38:04] [INFO ] Deduced a trap composed of 36 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:38:05] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 4 ms to minimize.
[2024-06-01 07:38:05] [INFO ] Deduced a trap composed of 46 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:38:05] [INFO ] Deduced a trap composed of 53 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:38:06] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:38:06] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:38:06] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 3 ms to minimize.
[2024-06-01 07:38:07] [INFO ] Deduced a trap composed of 59 places in 299 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:38:13] [INFO ] Deduced a trap composed of 64 places in 255 ms of which 3 ms to minimize.
[2024-06-01 07:38:13] [INFO ] Deduced a trap composed of 53 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:38:13] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 3 ms to minimize.
[2024-06-01 07:38:14] [INFO ] Deduced a trap composed of 57 places in 262 ms of which 3 ms to minimize.
[2024-06-01 07:38:14] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:38:14] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 4 ms to minimize.
[2024-06-01 07:38:14] [INFO ] Deduced a trap composed of 52 places in 235 ms of which 3 ms to minimize.
[2024-06-01 07:38:15] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 4 ms to minimize.
[2024-06-01 07:38:15] [INFO ] Deduced a trap composed of 51 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:38:15] [INFO ] Deduced a trap composed of 64 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:38:16] [INFO ] Deduced a trap composed of 51 places in 274 ms of which 4 ms to minimize.
[2024-06-01 07:38:16] [INFO ] Deduced a trap composed of 34 places in 279 ms of which 3 ms to minimize.
[2024-06-01 07:38:16] [INFO ] Deduced a trap composed of 45 places in 280 ms of which 3 ms to minimize.
[2024-06-01 07:38:16] [INFO ] Deduced a trap composed of 52 places in 256 ms of which 4 ms to minimize.
[2024-06-01 07:38:17] [INFO ] Deduced a trap composed of 52 places in 262 ms of which 3 ms to minimize.
[2024-06-01 07:38:17] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:38:17] [INFO ] Deduced a trap composed of 46 places in 285 ms of which 4 ms to minimize.
[2024-06-01 07:38:18] [INFO ] Deduced a trap composed of 53 places in 277 ms of which 4 ms to minimize.
[2024-06-01 07:38:18] [INFO ] Deduced a trap composed of 48 places in 302 ms of which 4 ms to minimize.
[2024-06-01 07:38:18] [INFO ] Deduced a trap composed of 55 places in 281 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:38:21] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:38:22] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:38:22] [INFO ] Deduced a trap composed of 44 places in 260 ms of which 3 ms to minimize.
[2024-06-01 07:38:22] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:38:22] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:38:23] [INFO ] Deduced a trap composed of 45 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:38:23] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:38:24] [INFO ] Deduced a trap composed of 59 places in 237 ms of which 4 ms to minimize.
[2024-06-01 07:38:25] [INFO ] Deduced a trap composed of 49 places in 290 ms of which 4 ms to minimize.
SMT process timed out in 60790ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60808ms
Finished structural reductions in LTL mode , in 1 iterations and 62801 ms. Remains : 236/236 places, 968/968 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-13 finished in 406473 ms.
[2024-06-01 07:38:25] [INFO ] Flatten gal took : 96 ms
[2024-06-01 07:38:25] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2024-06-01 07:38:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 390 places, 1152 transitions and 5400 arcs took 20 ms.
Total runtime 2619373 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-06"
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-06, 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-171636266300172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-06.tgz
mv EisenbergMcGuire-PT-06 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 ;