About the Execution of ITS-Tools for EisenbergMcGuire-PT-07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12135.319 | 3600000.00 | 11573473.00 | 3563.20 | ?TTFFTTFFFFFFFFT | 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.r158-smll-171636266300179.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is EisenbergMcGuire-PT-07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266300179
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:52 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 20K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M 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-07-LTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-07-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716531957978
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-24 06:26:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 06:26:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 06:26:01] [INFO ] Load time of PNML (sax parser for PT used): 509 ms
[2024-05-24 06:26:01] [INFO ] Transformed 553 places.
[2024-05-24 06:26:01] [INFO ] Transformed 1960 transitions.
[2024-05-24 06:26:01] [INFO ] Found NUPN structural information;
[2024-05-24 06:26:01] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 761 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 513 transition count 1680
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 513 transition count 1680
Applied a total of 80 rules in 209 ms. Remains 513 /553 variables (removed 40) and now considering 1680/1960 (removed 280) transitions.
[2024-05-24 06:26:01] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
// Phase 1: matrix 721 rows 513 cols
[2024-05-24 06:26:01] [INFO ] Computed 22 invariants in 48 ms
[2024-05-24 06:26:03] [INFO ] Implicit Places using invariants in 1408 ms returned []
[2024-05-24 06:26:03] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2024-05-24 06:26:03] [INFO ] Invariant cache hit.
[2024-05-24 06:26:03] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-24 06:26:07] [INFO ] Implicit Places using invariants and state equation in 3846 ms returned []
Implicit Place search using SMT with State Equation took 5312 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2024-05-24 06:26:07] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2024-05-24 06:26:07] [INFO ] Invariant cache hit.
[2024-05-24 06:26:07] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
[2024-05-24 06:26:32] [INFO ] Deduced a trap composed of 29 places in 405 ms of which 48 ms to minimize.
[2024-05-24 06:26:32] [INFO ] Deduced a trap composed of 35 places in 414 ms of which 5 ms to minimize.
[2024-05-24 06:26:33] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 3 ms to minimize.
[2024-05-24 06:26:33] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 3 ms to minimize.
[2024-05-24 06:26:33] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 2 ms to minimize.
[2024-05-24 06:26:33] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 5 ms to minimize.
[2024-05-24 06:26:33] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 3 ms to minimize.
[2024-05-24 06:26:34] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 4 ms to minimize.
[2024-05-24 06:26:34] [INFO ] Deduced a trap composed of 36 places in 342 ms of which 5 ms to minimize.
[2024-05-24 06:26:34] [INFO ] Deduced a trap composed of 42 places in 312 ms of which 4 ms to minimize.
[2024-05-24 06:26:35] [INFO ] Deduced a trap composed of 32 places in 466 ms of which 7 ms to minimize.
[2024-05-24 06:26:35] [INFO ] Deduced a trap composed of 93 places in 457 ms of which 6 ms to minimize.
[2024-05-24 06:26:36] [INFO ] Deduced a trap composed of 67 places in 417 ms of which 7 ms to minimize.
[2024-05-24 06:26:36] [INFO ] Deduced a trap composed of 59 places in 393 ms of which 6 ms to minimize.
[2024-05-24 06:26:36] [INFO ] Deduced a trap composed of 67 places in 274 ms of which 5 ms to minimize.
[2024-05-24 06:26:37] [INFO ] Deduced a trap composed of 40 places in 275 ms of which 4 ms to minimize.
[2024-05-24 06:26:37] [INFO ] Deduced a trap composed of 34 places in 269 ms of which 4 ms to minimize.
[2024-05-24 06:26:37] [INFO ] Deduced a trap composed of 67 places in 378 ms of which 6 ms to minimize.
[2024-05-24 06:26:38] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 513/1234 variables, and 41 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/513 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 1673/1673 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1673 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
[2024-05-24 06:26:41] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 1 ms to minimize.
[2024-05-24 06:26:41] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:26:42] [INFO ] Deduced a trap composed of 88 places in 382 ms of which 7 ms to minimize.
[2024-05-24 06:26:42] [INFO ] Deduced a trap composed of 67 places in 513 ms of which 5 ms to minimize.
[2024-05-24 06:26:43] [INFO ] Deduced a trap composed of 67 places in 350 ms of which 5 ms to minimize.
[2024-05-24 06:26:43] [INFO ] Deduced a trap composed of 67 places in 447 ms of which 6 ms to minimize.
[2024-05-24 06:26:44] [INFO ] Deduced a trap composed of 67 places in 396 ms of which 6 ms to minimize.
[2024-05-24 06:26:44] [INFO ] Deduced a trap composed of 67 places in 360 ms of which 5 ms to minimize.
[2024-05-24 06:26:44] [INFO ] Deduced a trap composed of 103 places in 349 ms of which 5 ms to minimize.
[2024-05-24 06:26:45] [INFO ] Deduced a trap composed of 59 places in 408 ms of which 6 ms to minimize.
[2024-05-24 06:26:45] [INFO ] Deduced a trap composed of 81 places in 438 ms of which 6 ms to minimize.
[2024-05-24 06:26:46] [INFO ] Deduced a trap composed of 69 places in 352 ms of which 6 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 76 places in 545 ms of which 8 ms to minimize.
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 50 places in 530 ms of which 8 ms to minimize.
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 108 places in 429 ms of which 9 ms to minimize.
[2024-05-24 06:26:50] [INFO ] Deduced a trap composed of 97 places in 349 ms of which 6 ms to minimize.
[2024-05-24 06:26:50] [INFO ] Deduced a trap composed of 29 places in 450 ms of which 4 ms to minimize.
[2024-05-24 06:26:51] [INFO ] Deduced a trap composed of 17 places in 430 ms of which 5 ms to minimize.
[2024-05-24 06:26:51] [INFO ] Deduced a trap composed of 91 places in 398 ms of which 5 ms to minimize.
[2024-05-24 06:26:52] [INFO ] Deduced a trap composed of 75 places in 355 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
[2024-05-24 06:26:52] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-05-24 06:26:53] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 3 ms to minimize.
[2024-05-24 06:26:56] [INFO ] Deduced a trap composed of 119 places in 298 ms of which 4 ms to minimize.
[2024-05-24 06:26:56] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 4 ms to minimize.
[2024-05-24 06:26:57] [INFO ] Deduced a trap composed of 107 places in 362 ms of which 6 ms to minimize.
[2024-05-24 06:26:57] [INFO ] Deduced a trap composed of 47 places in 339 ms of which 5 ms to minimize.
[2024-05-24 06:26:57] [INFO ] Deduced a trap composed of 107 places in 267 ms of which 4 ms to minimize.
[2024-05-24 06:26:58] [INFO ] Deduced a trap composed of 114 places in 369 ms of which 6 ms to minimize.
[2024-05-24 06:26:58] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-05-24 06:26:58] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
[2024-05-24 06:26:58] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:27:00] [INFO ] Deduced a trap composed of 64 places in 441 ms of which 7 ms to minimize.
[2024-05-24 06:27:00] [INFO ] Deduced a trap composed of 69 places in 484 ms of which 7 ms to minimize.
[2024-05-24 06:27:01] [INFO ] Deduced a trap composed of 67 places in 419 ms of which 7 ms to minimize.
[2024-05-24 06:27:01] [INFO ] Deduced a trap composed of 117 places in 357 ms of which 4 ms to minimize.
[2024-05-24 06:27:02] [INFO ] Deduced a trap composed of 45 places in 487 ms of which 6 ms to minimize.
[2024-05-24 06:27:02] [INFO ] Deduced a trap composed of 65 places in 358 ms of which 4 ms to minimize.
[2024-05-24 06:27:02] [INFO ] Deduced a trap composed of 65 places in 488 ms of which 7 ms to minimize.
[2024-05-24 06:27:03] [INFO ] Deduced a trap composed of 86 places in 482 ms of which 6 ms to minimize.
[2024-05-24 06:27:03] [INFO ] Deduced a trap composed of 126 places in 466 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
[2024-05-24 06:27:05] [INFO ] Deduced a trap composed of 81 places in 342 ms of which 6 ms to minimize.
[2024-05-24 06:27:05] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 3 ms to minimize.
[2024-05-24 06:27:05] [INFO ] Deduced a trap composed of 72 places in 382 ms of which 4 ms to minimize.
[2024-05-24 06:27:06] [INFO ] Deduced a trap composed of 67 places in 278 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/1234 variables, and 85 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/513 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 0/1673 constraints, Known Traps: 63/63 constraints]
After SMT, in 61852ms problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 61947ms
Starting structural reductions in LTL mode, iteration 1 : 513/553 places, 1680/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67540 ms. Remains : 513/553 places, 1680/1960 transitions.
Support contains 18 out of 513 places after structural reductions.
[2024-05-24 06:27:09] [INFO ] Flatten gal took : 310 ms
[2024-05-24 06:27:10] [INFO ] Flatten gal took : 204 ms
[2024-05-24 06:27:10] [INFO ] Input system was already deterministic with 1680 transitions.
RANDOM walk for 40000 steps (8 resets) in 1782 ms. (22 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
[2024-05-24 06:27:11] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2024-05-24 06:27:11] [INFO ] Invariant cache hit.
[2024-05-24 06:27:11] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 390/398 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/423 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/434 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 620/1054 variables, 434/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1054 variables, 102/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 19/1073 variables, 7/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1073 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1073 variables, 64/626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1073 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 20/1093 variables, 9/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1093 variables, 8/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1093 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 61/1154 variables, 2/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1154 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/1156 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1156 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 78/1234 variables, 63/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1234 variables, 58/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1234 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1234 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1234/1234 variables, and 767 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1386 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 513/513 constraints, ReadFeed: 232/232 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 390/398 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/423 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/434 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 06:27:13] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 3 ms to minimize.
[2024-05-24 06:27:13] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 3 ms to minimize.
[2024-05-24 06:27:13] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 620/1054 variables, 434/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 102/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1054 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1054 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 19/1073 variables, 7/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1073 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1073 variables, 64/630 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1073 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 20/1093 variables, 9/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1093 variables, 8/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1093 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 61/1154 variables, 2/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1154 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/1156 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1156 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 06:27:15] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1156 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1156 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 78/1234 variables, 63/716 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1234 variables, 58/774 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1234 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/1234 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 774 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3238 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 513/513 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 4682ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 567 ms.
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 14 place count 506 transition count 1522
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 316 place count 355 transition count 1522
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 5 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 400 place count 313 transition count 1480
Applied a total of 400 rules in 222 ms. Remains 313 /513 variables (removed 200) and now considering 1480/1680 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 313/513 places, 1480/1680 transitions.
RANDOM walk for 40000 steps (8 resets) in 561 ms. (71 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
[2024-05-24 06:27:17] [INFO ] Flow matrix only has 521 transitions (discarded 959 similar events)
// Phase 1: matrix 521 rows 313 cols
[2024-05-24 06:27:17] [INFO ] Computed 22 invariants in 9 ms
[2024-05-24 06:27:17] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 233/241 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/251 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/263 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 449/712 variables, 263/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/712 variables, 102/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 19/731 variables, 7/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/731 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/731 variables, 64/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/731 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 20/751 variables, 9/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/751 variables, 9/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/751 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 32/783 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/783 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/785 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/785 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 49/834 variables, 34/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/834 variables, 57/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/834 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/834 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 834/834 variables, and 567 constraints, problems are : Problem set: 0 solved, 2 unsolved in 779 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 313/313 constraints, ReadFeed: 232/232 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 233/241 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/251 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/263 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 06:27:18] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-05-24 06:27:18] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-05-24 06:27:18] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:27:18] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 449/712 variables, 263/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 102/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/712 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 19/731 variables, 7/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/731 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/731 variables, 64/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/731 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 20/751 variables, 9/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/751 variables, 9/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/751 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 32/783 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/783 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/785 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/785 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 06:27:19] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/785 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/785 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/834 variables, 34/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/834 variables, 57/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/834 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/834 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 834/834 variables, and 574 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1550 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 313/313 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 2370ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 628 ms.
Support contains 8 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 1480/1480 transitions.
Applied a total of 0 rules in 114 ms. Remains 313 /313 variables (removed 0) and now considering 1480/1480 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 313/313 places, 1480/1480 transitions.
RANDOM walk for 40000 steps (8 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 190696 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 190696 steps, saw 92686 distinct states, run finished after 3022 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-24 06:27:23] [INFO ] Flow matrix only has 521 transitions (discarded 959 similar events)
[2024-05-24 06:27:23] [INFO ] Invariant cache hit.
[2024-05-24 06:27:23] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 233/241 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/251 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/263 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 449/712 variables, 263/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/712 variables, 102/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 19/731 variables, 7/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/731 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/731 variables, 64/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/731 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 20/751 variables, 9/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/751 variables, 9/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/751 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 32/783 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/783 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/785 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/785 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 49/834 variables, 34/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/834 variables, 57/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/834 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/834 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 834/834 variables, and 567 constraints, problems are : Problem set: 0 solved, 2 unsolved in 843 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 313/313 constraints, ReadFeed: 232/232 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 233/241 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/251 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/263 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 06:27:24] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-05-24 06:27:24] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 449/712 variables, 263/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 102/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/712 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 19/731 variables, 7/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/731 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/731 variables, 64/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/731 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 20/751 variables, 9/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/751 variables, 9/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/751 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 32/783 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/783 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/785 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/785 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/785 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/834 variables, 34/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/834 variables, 57/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/834 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/834 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 834/834 variables, and 571 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1342 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 313/313 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2221ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 54 ms.
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 1480/1480 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 313 transition count 1478
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 1478
Applied a total of 4 rules in 91 ms. Remains 311 /313 variables (removed 2) and now considering 1478/1480 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 311/313 places, 1478/1480 transitions.
RANDOM walk for 40000 steps (8 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 506552 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 506552 steps, saw 182985 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-24 06:27:28] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2024-05-24 06:27:28] [INFO ] Computed 22 invariants in 19 ms
[2024-05-24 06:27:28] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 231/363 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 24/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 55/418 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 39/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/498 variables, 36/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 21/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 128/626 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/626 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/634 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/634 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 196/830 variables, 136/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/830 variables, 148/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 06:27:29] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 231/363 variables, 132/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/418 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 39/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/498 variables, 36/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 21/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 128/626 variables, 8/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/626 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/634 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/634 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 06:27:30] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 3 ms to minimize.
[2024-05-24 06:27:30] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-05-24 06:27:30] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-05-24 06:27:30] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/634 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/634 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 196/830 variables, 136/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/830 variables, 148/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/830 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/830 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 571 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1444 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1996ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 126 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 44 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 311/311 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 44 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2024-05-24 06:27:31] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-05-24 06:27:31] [INFO ] Invariant cache hit.
[2024-05-24 06:27:31] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-24 06:27:31] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-05-24 06:27:31] [INFO ] Invariant cache hit.
[2024-05-24 06:27:31] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-24 06:27:33] [INFO ] Implicit Places using invariants and state equation in 1778 ms returned []
Implicit Place search using SMT with State Equation took 2216 ms to find 0 implicit places.
[2024-05-24 06:27:33] [INFO ] Redundant transitions in 146 ms returned []
Running 1471 sub problems to find dead transitions.
[2024-05-24 06:27:33] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-05-24 06:27:33] [INFO ] Invariant cache hit.
[2024-05-24 06:27:33] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-05-24 06:27:50] [INFO ] Deduced a trap composed of 3 places in 257 ms of which 3 ms to minimize.
[2024-05-24 06:27:50] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 3 ms to minimize.
[2024-05-24 06:27:51] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2024-05-24 06:27:51] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 2 ms to minimize.
[2024-05-24 06:27:51] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-05-24 06:27:51] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:27:51] [INFO ] Deduced a trap composed of 53 places in 206 ms of which 3 ms to minimize.
[2024-05-24 06:27:51] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 2 ms to minimize.
[2024-05-24 06:27:52] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 5 ms to minimize.
[2024-05-24 06:27:52] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:27:53] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 4 ms to minimize.
[2024-05-24 06:27:53] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 3 ms to minimize.
[2024-05-24 06:27:53] [INFO ] Deduced a trap composed of 44 places in 264 ms of which 4 ms to minimize.
[2024-05-24 06:27:53] [INFO ] Deduced a trap composed of 39 places in 240 ms of which 3 ms to minimize.
[2024-05-24 06:27:54] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 5 ms to minimize.
[2024-05-24 06:27:54] [INFO ] Deduced a trap composed of 61 places in 259 ms of which 5 ms to minimize.
[2024-05-24 06:27:54] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 4 ms to minimize.
[2024-05-24 06:27:55] [INFO ] Deduced a trap composed of 38 places in 254 ms of which 4 ms to minimize.
[2024-05-24 06:27:55] [INFO ] Deduced a trap composed of 47 places in 280 ms of which 3 ms to minimize.
[2024-05-24 06:27:55] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-05-24 06:27:58] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 3 ms to minimize.
[2024-05-24 06:27:59] [INFO ] Deduced a trap composed of 67 places in 219 ms of which 3 ms to minimize.
[2024-05-24 06:28:00] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:28:00] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 3 ms to minimize.
[2024-05-24 06:28:00] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 3 ms to minimize.
[2024-05-24 06:28:00] [INFO ] Deduced a trap composed of 14 places in 218 ms of which 3 ms to minimize.
[2024-05-24 06:28:00] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-24 06:28:01] [INFO ] Deduced a trap composed of 60 places in 241 ms of which 3 ms to minimize.
[2024-05-24 06:28:01] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 3 ms to minimize.
[2024-05-24 06:28:01] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 3 ms to minimize.
[2024-05-24 06:28:02] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 3 ms to minimize.
[2024-05-24 06:28:03] [INFO ] Deduced a trap composed of 62 places in 271 ms of which 3 ms to minimize.
[2024-05-24 06:28:03] [INFO ] Deduced a trap composed of 49 places in 260 ms of which 3 ms to minimize.
[2024-05-24 06:28:04] [INFO ] Deduced a trap composed of 29 places in 306 ms of which 4 ms to minimize.
[2024-05-24 06:28:04] [INFO ] Deduced a trap composed of 73 places in 290 ms of which 3 ms to minimize.
SMT process timed out in 31157ms, After SMT, problems are : Problem set: 0 solved, 1471 unsolved
Search for dead transitions found 0 dead transitions in 31189ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33615 ms. Remains : 311/311 places, 1478/1478 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1338 edges and 311 vertex of which 47 / 311 are part of one of the 7 SCC in 6 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 153 transitions
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 271 transition count 331
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 209 transition count 331
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 125 place count 209 transition count 317
Deduced a syphon composed of 14 places in 3 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 189 transition count 317
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 323 place count 107 transition count 235
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 364 place count 107 transition count 194
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 380 place count 99 transition count 216
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 99 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 404 place count 99 transition count 192
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 441 place count 99 transition count 155
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 478 place count 62 transition count 155
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 62 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 488 place count 62 transition count 155
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 489 place count 62 transition count 154
Applied a total of 489 rules in 92 ms. Remains 62 /311 variables (removed 249) and now considering 154/1478 (removed 1324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 62 cols
[2024-05-24 06:28:04] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 06:28:04] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:28:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-24 06:28:04] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:28:04] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:28:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 06:28:04] [INFO ] After 12ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 06:28:04] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:28:04] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 329 ms.
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)||G(F(p1)))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Applied a total of 0 rules in 32 ms. Remains 513 /513 variables (removed 0) and now considering 1680/1680 (removed 0) transitions.
[2024-05-24 06:28:05] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
// Phase 1: matrix 721 rows 513 cols
[2024-05-24 06:28:05] [INFO ] Computed 22 invariants in 7 ms
[2024-05-24 06:28:05] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-05-24 06:28:05] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2024-05-24 06:28:05] [INFO ] Invariant cache hit.
[2024-05-24 06:28:06] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-24 06:28:08] [INFO ] Implicit Places using invariants and state equation in 2897 ms returned []
Implicit Place search using SMT with State Equation took 3506 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2024-05-24 06:28:08] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2024-05-24 06:28:08] [INFO ] Invariant cache hit.
[2024-05-24 06:28:08] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
[2024-05-24 06:28:31] [INFO ] Deduced a trap composed of 29 places in 306 ms of which 4 ms to minimize.
[2024-05-24 06:28:31] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 2 ms to minimize.
[2024-05-24 06:28:31] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 2 ms to minimize.
[2024-05-24 06:28:31] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 2 ms to minimize.
[2024-05-24 06:28:32] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-05-24 06:28:32] [INFO ] Deduced a trap composed of 20 places in 327 ms of which 6 ms to minimize.
[2024-05-24 06:28:32] [INFO ] Deduced a trap composed of 35 places in 322 ms of which 3 ms to minimize.
[2024-05-24 06:28:32] [INFO ] Deduced a trap composed of 44 places in 203 ms of which 3 ms to minimize.
[2024-05-24 06:28:33] [INFO ] Deduced a trap composed of 36 places in 315 ms of which 5 ms to minimize.
[2024-05-24 06:28:33] [INFO ] Deduced a trap composed of 42 places in 313 ms of which 5 ms to minimize.
[2024-05-24 06:28:33] [INFO ] Deduced a trap composed of 32 places in 337 ms of which 4 ms to minimize.
[2024-05-24 06:28:34] [INFO ] Deduced a trap composed of 93 places in 351 ms of which 6 ms to minimize.
[2024-05-24 06:28:34] [INFO ] Deduced a trap composed of 67 places in 526 ms of which 6 ms to minimize.
[2024-05-24 06:28:35] [INFO ] Deduced a trap composed of 59 places in 463 ms of which 6 ms to minimize.
[2024-05-24 06:28:35] [INFO ] Deduced a trap composed of 67 places in 449 ms of which 7 ms to minimize.
[2024-05-24 06:28:36] [INFO ] Deduced a trap composed of 40 places in 487 ms of which 6 ms to minimize.
[2024-05-24 06:28:37] [INFO ] Deduced a trap composed of 34 places in 479 ms of which 6 ms to minimize.
[2024-05-24 06:28:37] [INFO ] Deduced a trap composed of 67 places in 462 ms of which 6 ms to minimize.
[2024-05-24 06:28:37] [INFO ] Deduced a trap composed of 23 places in 151 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 0.0)
(s5 0.0)
(s6 1.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 1.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 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 513/1234 variables, and 41 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/513 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 1673/1673 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1673 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
[2024-05-24 06:28:42] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2024-05-24 06:28:42] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-24 06:28:43] [INFO ] Deduced a trap composed of 88 places in 428 ms of which 7 ms to minimize.
[2024-05-24 06:28:43] [INFO ] Deduced a trap composed of 67 places in 507 ms of which 4 ms to minimize.
[2024-05-24 06:28:44] [INFO ] Deduced a trap composed of 67 places in 286 ms of which 4 ms to minimize.
[2024-05-24 06:28:44] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 4 ms to minimize.
[2024-05-24 06:28:44] [INFO ] Deduced a trap composed of 67 places in 281 ms of which 4 ms to minimize.
[2024-05-24 06:28:45] [INFO ] Deduced a trap composed of 67 places in 371 ms of which 6 ms to minimize.
[2024-05-24 06:28:45] [INFO ] Deduced a trap composed of 103 places in 304 ms of which 4 ms to minimize.
[2024-05-24 06:28:45] [INFO ] Deduced a trap composed of 59 places in 345 ms of which 6 ms to minimize.
[2024-05-24 06:28:46] [INFO ] Deduced a trap composed of 81 places in 268 ms of which 4 ms to minimize.
[2024-05-24 06:28:46] [INFO ] Deduced a trap composed of 69 places in 278 ms of which 4 ms to minimize.
[2024-05-24 06:28:48] [INFO ] Deduced a trap composed of 76 places in 596 ms of which 12 ms to minimize.
[2024-05-24 06:28:49] [INFO ] Deduced a trap composed of 50 places in 537 ms of which 5 ms to minimize.
[2024-05-24 06:28:50] [INFO ] Deduced a trap composed of 108 places in 468 ms of which 6 ms to minimize.
[2024-05-24 06:28:50] [INFO ] Deduced a trap composed of 97 places in 466 ms of which 6 ms to minimize.
[2024-05-24 06:28:51] [INFO ] Deduced a trap composed of 29 places in 497 ms of which 6 ms to minimize.
[2024-05-24 06:28:51] [INFO ] Deduced a trap composed of 17 places in 606 ms of which 7 ms to minimize.
[2024-05-24 06:28:52] [INFO ] Deduced a trap composed of 91 places in 483 ms of which 6 ms to minimize.
[2024-05-24 06:28:53] [INFO ] Deduced a trap composed of 75 places in 559 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
[2024-05-24 06:28:54] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-05-24 06:28:54] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 2 ms to minimize.
[2024-05-24 06:28:59] [INFO ] Deduced a trap composed of 119 places in 489 ms of which 6 ms to minimize.
[2024-05-24 06:28:59] [INFO ] Deduced a trap composed of 47 places in 478 ms of which 6 ms to minimize.
[2024-05-24 06:29:00] [INFO ] Deduced a trap composed of 107 places in 449 ms of which 6 ms to minimize.
[2024-05-24 06:29:00] [INFO ] Deduced a trap composed of 47 places in 419 ms of which 5 ms to minimize.
[2024-05-24 06:29:00] [INFO ] Deduced a trap composed of 107 places in 488 ms of which 6 ms to minimize.
[2024-05-24 06:29:01] [INFO ] Deduced a trap composed of 114 places in 478 ms of which 6 ms to minimize.
[2024-05-24 06:29:01] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-05-24 06:29:01] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-24 06:29:01] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-24 06:29:04] [INFO ] Deduced a trap composed of 64 places in 630 ms of which 7 ms to minimize.
[2024-05-24 06:29:05] [INFO ] Deduced a trap composed of 69 places in 637 ms of which 7 ms to minimize.
[2024-05-24 06:29:05] [INFO ] Deduced a trap composed of 67 places in 653 ms of which 7 ms to minimize.
[2024-05-24 06:29:06] [INFO ] Deduced a trap composed of 117 places in 636 ms of which 7 ms to minimize.
[2024-05-24 06:29:07] [INFO ] Deduced a trap composed of 45 places in 555 ms of which 7 ms to minimize.
[2024-05-24 06:29:07] [INFO ] Deduced a trap composed of 65 places in 654 ms of which 7 ms to minimize.
[2024-05-24 06:29:08] [INFO ] Deduced a trap composed of 65 places in 638 ms of which 7 ms to minimize.
[2024-05-24 06:29:09] [INFO ] Deduced a trap composed of 86 places in 626 ms of which 7 ms to minimize.
[2024-05-24 06:29:09] [INFO ] Deduced a trap composed of 126 places in 651 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/1234 variables, and 81 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/513 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 0/1673 constraints, Known Traps: 59/59 constraints]
After SMT, in 61194ms problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 61229ms
Finished structural reductions in LTL mode , in 1 iterations and 64774 ms. Remains : 513/513 places, 1680/1680 transitions.
Stuttering acceptance computed with spot in 459 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 602 ms.
Product exploration explored 100000 steps with 0 reset in 513 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 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 879 ms. (45 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
[2024-05-24 06:29:12] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2024-05-24 06:29:12] [INFO ] Invariant cache hit.
[2024-05-24 06:29:12] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 275/281 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/282 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/290 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 418/708 variables, 290/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/708 variables, 44/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/708 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 43/751 variables, 7/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/751 variables, 48/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/751 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 60/811 variables, 27/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/811 variables, 16/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/811 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 182/993 variables, 5/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/993 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/995 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/995 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 5/1000 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1000 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 234/1234 variables, 189/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1234 variables, 124/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1234 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1234 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1234/1234 variables, and 767 constraints, problems are : Problem set: 0 solved, 2 unsolved in 865 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 513/513 constraints, ReadFeed: 232/232 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 275/281 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/282 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/290 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 418/708 variables, 290/302 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/708 variables, 44/346 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/708 variables, 0/346 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/751 variables, 7/353 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 1/354 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/751 variables, 48/402 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/751 variables, 0/402 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 60/811 variables, 27/429 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/811 variables, 16/445 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/811 variables, 0/445 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 182/993 variables, 5/450 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/993 variables, 0/450 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/995 variables, 1/451 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/995 variables, 0/451 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/1000 variables, 3/454 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1000 variables, 1/455 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 06:29:14] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 3 ms to minimize.
[2024-05-24 06:29:14] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 3 ms to minimize.
[2024-05-24 06:29:14] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 3 ms to minimize.
[2024-05-24 06:29:14] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1000 variables, 4/459 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1000 variables, 0/459 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 234/1234 variables, 189/648 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1234 variables, 124/772 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1234 variables, 0/772 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1234 variables, 0/772 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 772 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1984 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 513/513 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 2880ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 14 place count 506 transition count 1520
Deduced a syphon composed of 153 places in 2 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 320 place count 353 transition count 1520
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 404 place count 311 transition count 1478
Applied a total of 404 rules in 151 ms. Remains 311 /513 variables (removed 202) and now considering 1478/1680 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 311/513 places, 1478/1680 transitions.
RANDOM walk for 40000 steps (8 resets) in 363 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 410024 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 410024 steps, saw 166561 distinct states, run finished after 3008 ms. (steps per millisecond=136 ) properties seen :0
[2024-05-24 06:29:18] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2024-05-24 06:29:18] [INFO ] Computed 22 invariants in 4 ms
[2024-05-24 06:29:18] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 231/363 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 24/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 55/418 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 39/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/498 variables, 36/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 21/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 128/626 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/626 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/634 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/634 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 196/830 variables, 136/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/830 variables, 148/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 06:29:19] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 231/363 variables, 132/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/418 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 39/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/498 variables, 36/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 21/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 128/626 variables, 8/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/626 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/634 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/634 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 06:29:19] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-05-24 06:29:19] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2024-05-24 06:29:19] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 3 ms to minimize.
[2024-05-24 06:29:20] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 2 ms to minimize.
[2024-05-24 06:29:20] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 3 ms to minimize.
[2024-05-24 06:29:20] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/634 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/634 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 196/830 variables, 136/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/830 variables, 148/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/830 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/830 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 573 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1768 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2276ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 113 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 80 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 311/311 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 69 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2024-05-24 06:29:21] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-05-24 06:29:21] [INFO ] Invariant cache hit.
[2024-05-24 06:29:21] [INFO ] Implicit Places using invariants in 700 ms returned []
[2024-05-24 06:29:21] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-05-24 06:29:21] [INFO ] Invariant cache hit.
[2024-05-24 06:29:22] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-24 06:29:23] [INFO ] Implicit Places using invariants and state equation in 1697 ms returned []
Implicit Place search using SMT with State Equation took 2404 ms to find 0 implicit places.
[2024-05-24 06:29:23] [INFO ] Redundant transitions in 122 ms returned []
Running 1471 sub problems to find dead transitions.
[2024-05-24 06:29:23] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-05-24 06:29:23] [INFO ] Invariant cache hit.
[2024-05-24 06:29:23] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-05-24 06:29:36] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 3 ms to minimize.
[2024-05-24 06:29:36] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-24 06:29:36] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-24 06:29:37] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:29:37] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:29:37] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 2 ms to minimize.
[2024-05-24 06:29:37] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 2 ms to minimize.
[2024-05-24 06:29:38] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 2 ms to minimize.
[2024-05-24 06:29:38] [INFO ] Deduced a trap composed of 59 places in 231 ms of which 2 ms to minimize.
[2024-05-24 06:29:39] [INFO ] Deduced a trap composed of 62 places in 204 ms of which 2 ms to minimize.
[2024-05-24 06:29:39] [INFO ] Deduced a trap composed of 52 places in 234 ms of which 3 ms to minimize.
[2024-05-24 06:29:39] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 3 ms to minimize.
[2024-05-24 06:29:39] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 2 ms to minimize.
[2024-05-24 06:29:39] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
[2024-05-24 06:29:39] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:29:40] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 4 ms to minimize.
[2024-05-24 06:29:40] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:29:40] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 2 ms to minimize.
[2024-05-24 06:29:40] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 3 ms to minimize.
[2024-05-24 06:29:40] [INFO ] Deduced a trap composed of 58 places in 186 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-05-24 06:29:41] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:29:43] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 3 ms to minimize.
[2024-05-24 06:29:44] [INFO ] Deduced a trap composed of 63 places in 176 ms of which 3 ms to minimize.
[2024-05-24 06:29:44] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 3 ms to minimize.
[2024-05-24 06:29:45] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 2 ms to minimize.
[2024-05-24 06:29:45] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 3 ms to minimize.
[2024-05-24 06:29:45] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:29:45] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 4 ms to minimize.
[2024-05-24 06:29:46] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 2 ms to minimize.
[2024-05-24 06:29:46] [INFO ] Deduced a trap composed of 44 places in 293 ms of which 5 ms to minimize.
[2024-05-24 06:29:46] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 3 ms to minimize.
[2024-05-24 06:29:47] [INFO ] Deduced a trap composed of 45 places in 257 ms of which 3 ms to minimize.
[2024-05-24 06:29:47] [INFO ] Deduced a trap composed of 38 places in 259 ms of which 3 ms to minimize.
[2024-05-24 06:29:47] [INFO ] Deduced a trap composed of 63 places in 223 ms of which 3 ms to minimize.
[2024-05-24 06:29:48] [INFO ] Deduced a trap composed of 70 places in 259 ms of which 5 ms to minimize.
[2024-05-24 06:29:48] [INFO ] Deduced a trap composed of 51 places in 256 ms of which 3 ms to minimize.
[2024-05-24 06:29:48] [INFO ] Deduced a trap composed of 53 places in 333 ms of which 3 ms to minimize.
[2024-05-24 06:29:48] [INFO ] Deduced a trap composed of 37 places in 300 ms of which 3 ms to minimize.
[2024-05-24 06:29:49] [INFO ] Deduced a trap composed of 71 places in 333 ms of which 4 ms to minimize.
[2024-05-24 06:29:49] [INFO ] Deduced a trap composed of 68 places in 336 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/830 variables, and 62 constraints, problems are : Problem set: 0 solved, 1471 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/311 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 1471/1471 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-05-24 06:29:59] [INFO ] Deduced a trap composed of 44 places in 285 ms of which 4 ms to minimize.
[2024-05-24 06:30:00] [INFO ] Deduced a trap composed of 40 places in 303 ms of which 4 ms to minimize.
[2024-05-24 06:30:01] [INFO ] Deduced a trap composed of 68 places in 273 ms of which 4 ms to minimize.
[2024-05-24 06:30:01] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 4 ms to minimize.
[2024-05-24 06:30:02] [INFO ] Deduced a trap composed of 58 places in 286 ms of which 4 ms to minimize.
[2024-05-24 06:30:02] [INFO ] Deduced a trap composed of 56 places in 311 ms of which 5 ms to minimize.
[2024-05-24 06:30:03] [INFO ] Deduced a trap composed of 59 places in 305 ms of which 4 ms to minimize.
[2024-05-24 06:30:03] [INFO ] Deduced a trap composed of 38 places in 335 ms of which 4 ms to minimize.
[2024-05-24 06:30:04] [INFO ] Deduced a trap composed of 15 places in 371 ms of which 5 ms to minimize.
[2024-05-24 06:30:04] [INFO ] Deduced a trap composed of 46 places in 259 ms of which 3 ms to minimize.
[2024-05-24 06:30:04] [INFO ] Deduced a trap composed of 53 places in 214 ms of which 3 ms to minimize.
[2024-05-24 06:30:05] [INFO ] Deduced a trap composed of 55 places in 223 ms of which 3 ms to minimize.
[2024-05-24 06:30:05] [INFO ] Deduced a trap composed of 60 places in 370 ms of which 6 ms to minimize.
[2024-05-24 06:30:06] [INFO ] Deduced a trap composed of 43 places in 357 ms of which 4 ms to minimize.
[2024-05-24 06:30:06] [INFO ] Deduced a trap composed of 53 places in 328 ms of which 5 ms to minimize.
[2024-05-24 06:30:06] [INFO ] Deduced a trap composed of 51 places in 335 ms of which 4 ms to minimize.
[2024-05-24 06:30:07] [INFO ] Deduced a trap composed of 42 places in 337 ms of which 5 ms to minimize.
[2024-05-24 06:30:07] [INFO ] Deduced a trap composed of 61 places in 346 ms of which 4 ms to minimize.
[2024-05-24 06:30:08] [INFO ] Deduced a trap composed of 42 places in 381 ms of which 4 ms to minimize.
[2024-05-24 06:30:08] [INFO ] Deduced a trap composed of 48 places in 409 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-05-24 06:30:13] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 4 ms to minimize.
[2024-05-24 06:30:15] [INFO ] Deduced a trap composed of 14 places in 330 ms of which 4 ms to minimize.
[2024-05-24 06:30:18] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2024-05-24 06:30:21] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-24 06:30:24] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/830 variables, and 87 constraints, problems are : Problem set: 0 solved, 1471 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/311 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 0/1471 constraints, Known Traps: 65/65 constraints]
After SMT, in 61171ms problems are : Problem set: 0 solved, 1471 unsolved
Search for dead transitions found 0 dead transitions in 61196ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63802 ms. Remains : 311/311 places, 1478/1478 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1338 edges and 311 vertex of which 47 / 311 are part of one of the 7 SCC in 3 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 153 transitions
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 271 transition count 331
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 209 transition count 331
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 125 place count 209 transition count 317
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 189 transition count 317
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 323 place count 107 transition count 235
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 364 place count 107 transition count 194
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 380 place count 99 transition count 216
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 99 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 404 place count 99 transition count 192
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 441 place count 99 transition count 155
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 478 place count 62 transition count 155
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 62 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 488 place count 62 transition count 155
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 489 place count 62 transition count 154
Applied a total of 489 rules in 61 ms. Remains 62 /311 variables (removed 249) and now considering 154/1478 (removed 1324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 62 cols
[2024-05-24 06:30:24] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 06:30:24] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:30:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-24 06:30:24] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:30:25] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:30:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 06:30:25] [INFO ] After 16ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 06:30:25] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:30:25] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 347 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 202 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 14 place count 506 transition count 1522
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 316 place count 355 transition count 1522
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 398 place count 314 transition count 1481
Applied a total of 398 rules in 151 ms. Remains 314 /513 variables (removed 199) and now considering 1481/1680 (removed 199) transitions.
[2024-05-24 06:30:25] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2024-05-24 06:30:25] [INFO ] Computed 22 invariants in 4 ms
[2024-05-24 06:30:26] [INFO ] Implicit Places using invariants in 489 ms returned []
[2024-05-24 06:30:26] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-05-24 06:30:26] [INFO ] Invariant cache hit.
[2024-05-24 06:30:26] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-24 06:30:28] [INFO ] Implicit Places using invariants and state equation in 1821 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
[2024-05-24 06:30:28] [INFO ] Redundant transitions in 73 ms returned []
Running 1474 sub problems to find dead transitions.
[2024-05-24 06:30:28] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-05-24 06:30:28] [INFO ] Invariant cache hit.
[2024-05-24 06:30:28] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-05-24 06:30:47] [INFO ] Deduced a trap composed of 3 places in 458 ms of which 5 ms to minimize.
[2024-05-24 06:30:47] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 3 ms to minimize.
[2024-05-24 06:30:47] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 3 ms to minimize.
[2024-05-24 06:30:47] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 2 ms to minimize.
[2024-05-24 06:30:47] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2024-05-24 06:30:47] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 3 ms to minimize.
[2024-05-24 06:30:48] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 9 ms to minimize.
[2024-05-24 06:30:50] [INFO ] Deduced a trap composed of 40 places in 342 ms of which 4 ms to minimize.
[2024-05-24 06:30:50] [INFO ] Deduced a trap composed of 44 places in 318 ms of which 4 ms to minimize.
[2024-05-24 06:30:51] [INFO ] Deduced a trap composed of 43 places in 282 ms of which 4 ms to minimize.
[2024-05-24 06:30:51] [INFO ] Deduced a trap composed of 43 places in 321 ms of which 4 ms to minimize.
[2024-05-24 06:30:51] [INFO ] Deduced a trap composed of 39 places in 323 ms of which 4 ms to minimize.
[2024-05-24 06:30:52] [INFO ] Deduced a trap composed of 74 places in 307 ms of which 4 ms to minimize.
[2024-05-24 06:30:52] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 2 ms to minimize.
[2024-05-24 06:30:52] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-05-24 06:30:53] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 2 ms to minimize.
[2024-05-24 06:30:53] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 2 ms to minimize.
[2024-05-24 06:30:54] [INFO ] Deduced a trap composed of 13 places in 337 ms of which 5 ms to minimize.
[2024-05-24 06:30:54] [INFO ] Deduced a trap composed of 20 places in 358 ms of which 4 ms to minimize.
[2024-05-24 06:30:55] [INFO ] Deduced a trap composed of 3 places in 306 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/836 variables, and 42 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 1474/1474 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-05-24 06:31:07] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 2 ms to minimize.
[2024-05-24 06:31:08] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:31:09] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 2 ms to minimize.
[2024-05-24 06:31:10] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-24 06:31:12] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-24 06:31:14] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 3 ms to minimize.
[2024-05-24 06:31:15] [INFO ] Deduced a trap composed of 21 places in 268 ms of which 3 ms to minimize.
[2024-05-24 06:31:15] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 3 ms to minimize.
[2024-05-24 06:31:15] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 2 ms to minimize.
[2024-05-24 06:31:15] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 3 ms to minimize.
[2024-05-24 06:31:16] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-24 06:31:16] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:31:16] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2024-05-24 06:31:16] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-24 06:31:16] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-05-24 06:31:16] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-05-24 06:31:17] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:31:17] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:31:17] [INFO ] Deduced a trap composed of 69 places in 245 ms of which 3 ms to minimize.
[2024-05-24 06:31:17] [INFO ] Deduced a trap composed of 57 places in 273 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-05-24 06:31:20] [INFO ] Deduced a trap composed of 70 places in 161 ms of which 2 ms to minimize.
[2024-05-24 06:31:21] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 3 ms to minimize.
[2024-05-24 06:31:21] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 2 ms to minimize.
[2024-05-24 06:31:21] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 2 ms to minimize.
[2024-05-24 06:31:21] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 3 ms to minimize.
[2024-05-24 06:31:22] [INFO ] Deduced a trap composed of 52 places in 212 ms of which 3 ms to minimize.
[2024-05-24 06:31:22] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
[2024-05-24 06:31:22] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 3 ms to minimize.
[2024-05-24 06:31:23] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 2 ms to minimize.
[2024-05-24 06:31:25] [INFO ] Deduced a trap composed of 71 places in 200 ms of which 3 ms to minimize.
[2024-05-24 06:31:25] [INFO ] Deduced a trap composed of 58 places in 221 ms of which 3 ms to minimize.
[2024-05-24 06:31:26] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 2 ms to minimize.
[2024-05-24 06:31:26] [INFO ] Deduced a trap composed of 82 places in 206 ms of which 3 ms to minimize.
[2024-05-24 06:31:26] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 3 ms to minimize.
[2024-05-24 06:31:26] [INFO ] Deduced a trap composed of 69 places in 180 ms of which 3 ms to minimize.
[2024-05-24 06:31:27] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 2 ms to minimize.
[2024-05-24 06:31:27] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 2 ms to minimize.
[2024-05-24 06:31:27] [INFO ] Deduced a trap composed of 78 places in 221 ms of which 3 ms to minimize.
[2024-05-24 06:31:27] [INFO ] Deduced a trap composed of 51 places in 240 ms of which 2 ms to minimize.
[2024-05-24 06:31:28] [INFO ] Deduced a trap composed of 92 places in 241 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/836 variables, and 82 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 0/1474 constraints, Known Traps: 60/60 constraints]
After SMT, in 60867ms problems are : Problem set: 0 solved, 1474 unsolved
Search for dead transitions found 0 dead transitions in 60888ms
Starting structural reductions in SI_LTL mode, iteration 1 : 314/513 places, 1481/1680 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63438 ms. Remains : 314/513 places, 1481/1680 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 415 ms. (96 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
[2024-05-24 06:31:29] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-05-24 06:31:29] [INFO ] Invariant cache hit.
[2024-05-24 06:31:29] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 163/169 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/178 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 306/484 variables, 178/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 44/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 43/527 variables, 7/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 48/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 60/587 variables, 27/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 18/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 96/683 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/683 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/689 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/689 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 147/836 variables, 102/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/836 variables, 122/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/836 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/836 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 756 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 314/314 constraints, ReadFeed: 232/232 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 163/169 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/178 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 06:31:30] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 3 ms to minimize.
[2024-05-24 06:31:30] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 3 ms to minimize.
[2024-05-24 06:31:31] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 3 ms to minimize.
[2024-05-24 06:31:31] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 4/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 306/484 variables, 178/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 44/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 43/527 variables, 7/245 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 1/246 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 48/294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/527 variables, 0/294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 60/587 variables, 27/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 18/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/587 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 96/683 variables, 6/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/683 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/689 variables, 3/348 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/689 variables, 1/349 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 06:31:31] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 2 ms to minimize.
[2024-05-24 06:31:32] [INFO ] Deduced a trap composed of 33 places in 366 ms of which 4 ms to minimize.
[2024-05-24 06:31:32] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-24 06:31:32] [INFO ] Deduced a trap composed of 44 places in 426 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/689 variables, 4/353 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/689 variables, 0/353 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 147/836 variables, 102/455 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/836 variables, 122/577 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 06:31:33] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/836 variables, 1/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/836 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/836 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 836/836 variables, and 578 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2867 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 314/314 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 3645ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 4 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 1481/1481 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 314 transition count 1479
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 312 transition count 1479
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 311 transition count 1478
Applied a total of 6 rules in 90 ms. Remains 311 /314 variables (removed 3) and now considering 1478/1481 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 311/314 places, 1478/1481 transitions.
RANDOM walk for 40000 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 462040 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 462040 steps, saw 170374 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
[2024-05-24 06:31:36] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2024-05-24 06:31:36] [INFO ] Computed 22 invariants in 9 ms
[2024-05-24 06:31:36] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 231/363 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 24/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 55/418 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 39/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/498 variables, 36/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 21/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 128/626 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/626 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/634 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/634 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 196/830 variables, 136/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/830 variables, 148/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 06:31:37] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 231/363 variables, 132/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/418 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 39/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/498 variables, 36/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 21/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 128/626 variables, 8/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/626 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/634 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/634 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 06:31:37] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 4 ms to minimize.
[2024-05-24 06:31:37] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 3 ms to minimize.
[2024-05-24 06:31:38] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 3 ms to minimize.
[2024-05-24 06:31:38] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 3 ms to minimize.
[2024-05-24 06:31:38] [INFO ] Deduced a trap composed of 27 places in 340 ms of which 4 ms to minimize.
[2024-05-24 06:31:39] [INFO ] Deduced a trap composed of 17 places in 338 ms of which 4 ms to minimize.
[2024-05-24 06:31:39] [INFO ] Deduced a trap composed of 74 places in 327 ms of which 4 ms to minimize.
[2024-05-24 06:31:39] [INFO ] Deduced a trap composed of 66 places in 307 ms of which 4 ms to minimize.
[2024-05-24 06:31:39] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/634 variables, 9/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/634 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 196/830 variables, 136/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/830 variables, 148/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/830 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/830 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3043 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 3509ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 38 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 311/311 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 37 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2024-05-24 06:31:40] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-05-24 06:31:40] [INFO ] Invariant cache hit.
[2024-05-24 06:31:40] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-05-24 06:31:40] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-05-24 06:31:40] [INFO ] Invariant cache hit.
[2024-05-24 06:31:41] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-24 06:31:42] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2450 ms to find 0 implicit places.
[2024-05-24 06:31:42] [INFO ] Redundant transitions in 27 ms returned []
Running 1471 sub problems to find dead transitions.
[2024-05-24 06:31:42] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-05-24 06:31:42] [INFO ] Invariant cache hit.
[2024-05-24 06:31:42] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-05-24 06:31:56] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 2 ms to minimize.
[2024-05-24 06:31:56] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
[2024-05-24 06:31:56] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 2 ms to minimize.
[2024-05-24 06:31:56] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:31:56] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:31:57] [INFO ] Deduced a trap composed of 48 places in 242 ms of which 4 ms to minimize.
[2024-05-24 06:31:58] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 4 ms to minimize.
[2024-05-24 06:31:58] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 4 ms to minimize.
[2024-05-24 06:31:58] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 2 ms to minimize.
[2024-05-24 06:31:59] [INFO ] Deduced a trap composed of 68 places in 312 ms of which 5 ms to minimize.
[2024-05-24 06:31:59] [INFO ] Deduced a trap composed of 56 places in 262 ms of which 3 ms to minimize.
[2024-05-24 06:31:59] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:31:59] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-05-24 06:31:59] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 4 ms to minimize.
[2024-05-24 06:32:00] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 3 ms to minimize.
[2024-05-24 06:32:00] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 4 ms to minimize.
[2024-05-24 06:32:00] [INFO ] Deduced a trap composed of 10 places in 332 ms of which 4 ms to minimize.
[2024-05-24 06:32:01] [INFO ] Deduced a trap composed of 23 places in 323 ms of which 4 ms to minimize.
[2024-05-24 06:32:01] [INFO ] Deduced a trap composed of 56 places in 335 ms of which 5 ms to minimize.
[2024-05-24 06:32:01] [INFO ] Deduced a trap composed of 40 places in 324 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-05-24 06:32:04] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 4 ms to minimize.
[2024-05-24 06:32:05] [INFO ] Deduced a trap composed of 60 places in 320 ms of which 4 ms to minimize.
[2024-05-24 06:32:06] [INFO ] Deduced a trap composed of 56 places in 335 ms of which 4 ms to minimize.
[2024-05-24 06:32:06] [INFO ] Deduced a trap composed of 50 places in 371 ms of which 5 ms to minimize.
[2024-05-24 06:32:07] [INFO ] Deduced a trap composed of 51 places in 404 ms of which 5 ms to minimize.
[2024-05-24 06:32:07] [INFO ] Deduced a trap composed of 41 places in 352 ms of which 4 ms to minimize.
[2024-05-24 06:32:07] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 2 ms to minimize.
[2024-05-24 06:32:07] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 3 ms to minimize.
[2024-05-24 06:32:08] [INFO ] Deduced a trap composed of 43 places in 385 ms of which 5 ms to minimize.
[2024-05-24 06:32:08] [INFO ] Deduced a trap composed of 45 places in 362 ms of which 4 ms to minimize.
[2024-05-24 06:32:09] [INFO ] Deduced a trap composed of 60 places in 346 ms of which 4 ms to minimize.
[2024-05-24 06:32:09] [INFO ] Deduced a trap composed of 40 places in 381 ms of which 5 ms to minimize.
[2024-05-24 06:32:09] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-24 06:32:10] [INFO ] Deduced a trap composed of 66 places in 369 ms of which 5 ms to minimize.
[2024-05-24 06:32:10] [INFO ] Deduced a trap composed of 65 places in 364 ms of which 4 ms to minimize.
[2024-05-24 06:32:10] [INFO ] Deduced a trap composed of 64 places in 309 ms of which 4 ms to minimize.
[2024-05-24 06:32:11] [INFO ] Deduced a trap composed of 11 places in 347 ms of which 4 ms to minimize.
[2024-05-24 06:32:11] [INFO ] Deduced a trap composed of 54 places in 338 ms of which 4 ms to minimize.
[2024-05-24 06:32:11] [INFO ] Deduced a trap composed of 56 places in 306 ms of which 4 ms to minimize.
[2024-05-24 06:32:12] [INFO ] Deduced a trap composed of 55 places in 275 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/830 variables, and 62 constraints, problems are : Problem set: 0 solved, 1471 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/311 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 1471/1471 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-05-24 06:32:20] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 2 ms to minimize.
[2024-05-24 06:32:22] [INFO ] Deduced a trap composed of 53 places in 323 ms of which 4 ms to minimize.
[2024-05-24 06:32:22] [INFO ] Deduced a trap composed of 69 places in 312 ms of which 4 ms to minimize.
[2024-05-24 06:32:23] [INFO ] Deduced a trap composed of 61 places in 271 ms of which 3 ms to minimize.
[2024-05-24 06:32:23] [INFO ] Deduced a trap composed of 44 places in 318 ms of which 5 ms to minimize.
[2024-05-24 06:32:23] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-24 06:32:24] [INFO ] Deduced a trap composed of 43 places in 323 ms of which 3 ms to minimize.
[2024-05-24 06:32:24] [INFO ] Deduced a trap composed of 62 places in 299 ms of which 3 ms to minimize.
[2024-05-24 06:32:24] [INFO ] Deduced a trap composed of 62 places in 350 ms of which 5 ms to minimize.
[2024-05-24 06:32:25] [INFO ] Deduced a trap composed of 49 places in 392 ms of which 5 ms to minimize.
[2024-05-24 06:32:25] [INFO ] Deduced a trap composed of 86 places in 428 ms of which 5 ms to minimize.
[2024-05-24 06:32:26] [INFO ] Deduced a trap composed of 65 places in 328 ms of which 5 ms to minimize.
[2024-05-24 06:32:26] [INFO ] Deduced a trap composed of 57 places in 361 ms of which 4 ms to minimize.
[2024-05-24 06:32:26] [INFO ] Deduced a trap composed of 55 places in 304 ms of which 4 ms to minimize.
[2024-05-24 06:32:27] [INFO ] Deduced a trap composed of 66 places in 459 ms of which 5 ms to minimize.
[2024-05-24 06:32:27] [INFO ] Deduced a trap composed of 69 places in 469 ms of which 5 ms to minimize.
[2024-05-24 06:32:28] [INFO ] Deduced a trap composed of 31 places in 413 ms of which 5 ms to minimize.
[2024-05-24 06:32:28] [INFO ] Deduced a trap composed of 20 places in 399 ms of which 5 ms to minimize.
[2024-05-24 06:32:29] [INFO ] Deduced a trap composed of 106 places in 368 ms of which 5 ms to minimize.
[2024-05-24 06:32:29] [INFO ] Deduced a trap composed of 76 places in 410 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-05-24 06:32:33] [INFO ] Deduced a trap composed of 61 places in 253 ms of which 4 ms to minimize.
[2024-05-24 06:32:34] [INFO ] Deduced a trap composed of 84 places in 291 ms of which 4 ms to minimize.
[2024-05-24 06:32:35] [INFO ] Deduced a trap composed of 45 places in 271 ms of which 4 ms to minimize.
[2024-05-24 06:32:35] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 3 ms to minimize.
[2024-05-24 06:32:35] [INFO ] Deduced a trap composed of 69 places in 214 ms of which 3 ms to minimize.
[2024-05-24 06:32:36] [INFO ] Deduced a trap composed of 66 places in 214 ms of which 2 ms to minimize.
[2024-05-24 06:32:36] [INFO ] Deduced a trap composed of 54 places in 236 ms of which 3 ms to minimize.
[2024-05-24 06:32:36] [INFO ] Deduced a trap composed of 62 places in 230 ms of which 3 ms to minimize.
[2024-05-24 06:32:36] [INFO ] Deduced a trap composed of 57 places in 235 ms of which 3 ms to minimize.
[2024-05-24 06:32:36] [INFO ] Deduced a trap composed of 57 places in 238 ms of which 3 ms to minimize.
[2024-05-24 06:32:37] [INFO ] Deduced a trap composed of 52 places in 306 ms of which 3 ms to minimize.
[2024-05-24 06:32:37] [INFO ] Deduced a trap composed of 102 places in 280 ms of which 3 ms to minimize.
[2024-05-24 06:32:37] [INFO ] Deduced a trap composed of 73 places in 301 ms of which 3 ms to minimize.
[2024-05-24 06:32:38] [INFO ] Deduced a trap composed of 73 places in 334 ms of which 3 ms to minimize.
[2024-05-24 06:32:38] [INFO ] Deduced a trap composed of 68 places in 347 ms of which 5 ms to minimize.
[2024-05-24 06:32:39] [INFO ] Deduced a trap composed of 70 places in 351 ms of which 4 ms to minimize.
[2024-05-24 06:32:39] [INFO ] Deduced a trap composed of 59 places in 382 ms of which 3 ms to minimize.
[2024-05-24 06:32:39] [INFO ] Deduced a trap composed of 48 places in 382 ms of which 3 ms to minimize.
[2024-05-24 06:32:40] [INFO ] Deduced a trap composed of 67 places in 288 ms of which 4 ms to minimize.
[2024-05-24 06:32:40] [INFO ] Deduced a trap composed of 78 places in 304 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/830 variables, and 102 constraints, problems are : Problem set: 0 solved, 1471 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/311 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 0/1471 constraints, Known Traps: 80/80 constraints]
After SMT, in 60861ms problems are : Problem set: 0 solved, 1471 unsolved
Search for dead transitions found 0 dead transitions in 60879ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63402 ms. Remains : 311/311 places, 1478/1478 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1338 edges and 311 vertex of which 47 / 311 are part of one of the 7 SCC in 1 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 153 transitions
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 271 transition count 331
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 209 transition count 331
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 125 place count 209 transition count 317
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 189 transition count 317
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 323 place count 107 transition count 235
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 364 place count 107 transition count 194
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 380 place count 99 transition count 216
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 99 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 404 place count 99 transition count 192
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 441 place count 99 transition count 155
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 478 place count 62 transition count 155
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 62 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 488 place count 62 transition count 155
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 489 place count 62 transition count 154
Applied a total of 489 rules in 35 ms. Remains 62 /311 variables (removed 249) and now considering 154/1478 (removed 1324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 62 cols
[2024-05-24 06:32:43] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 06:32:43] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:32:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-24 06:32:43] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:32:43] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:32:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 06:32:43] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 06:32:43] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:32:43] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 220 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 149 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 297 ms.
Product exploration explored 100000 steps with 0 reset in 332 ms.
Built C files in :
/tmp/ltsmin14940050151003193421
[2024-05-24 06:32:45] [INFO ] Computing symmetric may disable matrix : 1481 transitions.
[2024-05-24 06:32:45] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:32:45] [INFO ] Computing symmetric may enable matrix : 1481 transitions.
[2024-05-24 06:32:45] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:32:45] [INFO ] Computing Do-Not-Accords matrix : 1481 transitions.
[2024-05-24 06:32:45] [INFO ] Computation of Completed DNA matrix. took 86 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:32:45] [INFO ] Built C files in 479ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14940050151003193421
Running compilation step : cd /tmp/ltsmin14940050151003193421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14940050151003193421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14940050151003193421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 1481/1481 transitions.
Applied a total of 0 rules in 43 ms. Remains 314 /314 variables (removed 0) and now considering 1481/1481 (removed 0) transitions.
[2024-05-24 06:32:48] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2024-05-24 06:32:48] [INFO ] Computed 22 invariants in 2 ms
[2024-05-24 06:32:49] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-24 06:32:49] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-05-24 06:32:49] [INFO ] Invariant cache hit.
[2024-05-24 06:32:49] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-24 06:32:50] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 2036 ms to find 0 implicit places.
[2024-05-24 06:32:50] [INFO ] Redundant transitions in 26 ms returned []
Running 1474 sub problems to find dead transitions.
[2024-05-24 06:32:50] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-05-24 06:32:50] [INFO ] Invariant cache hit.
[2024-05-24 06:32:50] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-05-24 06:33:03] [INFO ] Deduced a trap composed of 3 places in 368 ms of which 4 ms to minimize.
[2024-05-24 06:33:03] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 2 ms to minimize.
[2024-05-24 06:33:03] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 2 ms to minimize.
[2024-05-24 06:33:03] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-05-24 06:33:03] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-05-24 06:33:03] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:33:04] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 4 ms to minimize.
[2024-05-24 06:33:05] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 3 ms to minimize.
[2024-05-24 06:33:05] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 3 ms to minimize.
[2024-05-24 06:33:06] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 2 ms to minimize.
[2024-05-24 06:33:06] [INFO ] Deduced a trap composed of 43 places in 257 ms of which 4 ms to minimize.
[2024-05-24 06:33:06] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 3 ms to minimize.
[2024-05-24 06:33:07] [INFO ] Deduced a trap composed of 74 places in 247 ms of which 3 ms to minimize.
[2024-05-24 06:33:07] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 2 ms to minimize.
[2024-05-24 06:33:07] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-24 06:33:08] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 3 ms to minimize.
[2024-05-24 06:33:08] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 2 ms to minimize.
[2024-05-24 06:33:08] [INFO ] Deduced a trap composed of 13 places in 360 ms of which 4 ms to minimize.
[2024-05-24 06:33:09] [INFO ] Deduced a trap composed of 20 places in 360 ms of which 4 ms to minimize.
[2024-05-24 06:33:10] [INFO ] Deduced a trap composed of 3 places in 314 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-05-24 06:33:18] [INFO ] Deduced a trap composed of 15 places in 311 ms of which 4 ms to minimize.
[2024-05-24 06:33:20] [INFO ] Deduced a trap composed of 15 places in 411 ms of which 4 ms to minimize.
[2024-05-24 06:33:21] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/836 variables, and 45 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 1474/1474 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-05-24 06:33:35] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-24 06:33:37] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 2 ms to minimize.
[2024-05-24 06:33:41] [INFO ] Deduced a trap composed of 17 places in 483 ms of which 6 ms to minimize.
[2024-05-24 06:33:41] [INFO ] Deduced a trap composed of 21 places in 453 ms of which 4 ms to minimize.
[2024-05-24 06:33:42] [INFO ] Deduced a trap composed of 17 places in 441 ms of which 4 ms to minimize.
[2024-05-24 06:33:42] [INFO ] Deduced a trap composed of 25 places in 433 ms of which 5 ms to minimize.
[2024-05-24 06:33:43] [INFO ] Deduced a trap composed of 19 places in 404 ms of which 5 ms to minimize.
[2024-05-24 06:33:43] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 2 ms to minimize.
[2024-05-24 06:33:43] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2024-05-24 06:33:44] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 2 ms to minimize.
[2024-05-24 06:33:44] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-05-24 06:33:44] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2024-05-24 06:33:45] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 1 ms to minimize.
[2024-05-24 06:33:45] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-05-24 06:33:45] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-05-24 06:33:46] [INFO ] Deduced a trap composed of 53 places in 433 ms of which 4 ms to minimize.
[2024-05-24 06:33:46] [INFO ] Deduced a trap composed of 61 places in 439 ms of which 5 ms to minimize.
[2024-05-24 06:33:47] [INFO ] Deduced a trap composed of 55 places in 442 ms of which 5 ms to minimize.
[2024-05-24 06:33:47] [INFO ] Deduced a trap composed of 23 places in 472 ms of which 5 ms to minimize.
[2024-05-24 06:33:48] [INFO ] Deduced a trap composed of 60 places in 455 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/836 variables, and 65 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 0/1474 constraints, Known Traps: 43/43 constraints]
After SMT, in 60890ms problems are : Problem set: 0 solved, 1474 unsolved
Search for dead transitions found 0 dead transitions in 60907ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63022 ms. Remains : 314/314 places, 1481/1481 transitions.
Built C files in :
/tmp/ltsmin14463344992330829443
[2024-05-24 06:33:51] [INFO ] Computing symmetric may disable matrix : 1481 transitions.
[2024-05-24 06:33:51] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:33:51] [INFO ] Computing symmetric may enable matrix : 1481 transitions.
[2024-05-24 06:33:51] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:33:52] [INFO ] Computing Do-Not-Accords matrix : 1481 transitions.
[2024-05-24 06:33:52] [INFO ] Computation of Completed DNA matrix. took 69 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:33:52] [INFO ] Built C files in 696ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14463344992330829443
Running compilation step : cd /tmp/ltsmin14463344992330829443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14463344992330829443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14463344992330829443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 06:33:55] [INFO ] Flatten gal took : 119 ms
[2024-05-24 06:33:55] [INFO ] Flatten gal took : 117 ms
[2024-05-24 06:33:55] [INFO ] Time to serialize gal into /tmp/LTL17698259781318943562.gal : 29 ms
[2024-05-24 06:33:55] [INFO ] Time to serialize properties into /tmp/LTL10080976139023242153.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17698259781318943562.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11722187394384605630.hoa' '-atoms' '/tmp/LTL10080976139023242153.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10080976139023242153.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11722187394384605630.hoa
Detected timeout of ITS tools.
[2024-05-24 06:34:10] [INFO ] Flatten gal took : 64 ms
[2024-05-24 06:34:11] [INFO ] Flatten gal took : 64 ms
[2024-05-24 06:34:11] [INFO ] Time to serialize gal into /tmp/LTL4373342046019139122.gal : 23 ms
[2024-05-24 06:34:11] [INFO ] Time to serialize properties into /tmp/LTL6107067283212246784.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4373342046019139122.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6107067283212246784.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("((p18_5_3==0)||(p08_4_0==1))"))||(G(F("(((p34_1_5==0)||(p10_5_3==1))||((p10_5_4==0)||(p27_2==1)))"))))))
Formula 0 simplified : X(F!"((p18_5_3==0)||(p08_4_0==1))" & FG!"(((p34_1_5==0)||(p10_5_3==1))||((p10_5_4==0)||(p27_2==1)))")
Detected timeout of ITS tools.
[2024-05-24 06:34:26] [INFO ] Flatten gal took : 50 ms
[2024-05-24 06:34:26] [INFO ] Applying decomposition
[2024-05-24 06:34:26] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1422571465369034782.txt' '-o' '/tmp/graph1422571465369034782.bin' '-w' '/tmp/graph1422571465369034782.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1422571465369034782.bin' '-l' '-1' '-v' '-w' '/tmp/graph1422571465369034782.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:34:26] [INFO ] Decomposing Gal with order
[2024-05-24 06:34:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:34:26] [INFO ] Removed a total of 2853 redundant transitions.
[2024-05-24 06:34:26] [INFO ] Flatten gal took : 406 ms
[2024-05-24 06:34:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 528 labels/synchronizations in 120 ms.
[2024-05-24 06:34:27] [INFO ] Time to serialize gal into /tmp/LTL16772728855517400496.gal : 23 ms
[2024-05-24 06:34:27] [INFO ] Time to serialize properties into /tmp/LTL10556299985533396437.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16772728855517400496.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10556299985533396437.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((G("((i11.i1.u41.p18_5_3==0)||(i10.u10.p08_4_0==1))"))||(G(F("(((i0.u19.p34_1_5==0)||(u11.p10_5_3==1))||((u11.p10_5_4==0)||(i13.u...176
Formula 0 simplified : X(F!"((i11.i1.u41.p18_5_3==0)||(i10.u10.p08_4_0==1))" & FG!"(((i0.u19.p34_1_5==0)||(u11.p10_5_3==1))||((u11.p10_5_4==0)||(i13.u78.p2...166
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-00 finished in 397144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((G(p2)||p1)))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 14 place count 506 transition count 1521
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 318 place count 354 transition count 1521
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 320 place count 352 transition count 1507
Iterating global reduction 2 with 2 rules applied. Total rules applied 322 place count 352 transition count 1507
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 406 place count 310 transition count 1465
Applied a total of 406 rules in 87 ms. Remains 310 /513 variables (removed 203) and now considering 1465/1680 (removed 215) transitions.
[2024-05-24 06:34:42] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
// Phase 1: matrix 506 rows 310 cols
[2024-05-24 06:34:42] [INFO ] Computed 22 invariants in 2 ms
[2024-05-24 06:34:42] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-05-24 06:34:42] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
[2024-05-24 06:34:42] [INFO ] Invariant cache hit.
[2024-05-24 06:34:43] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-24 06:34:44] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 2099 ms to find 0 implicit places.
[2024-05-24 06:34:44] [INFO ] Redundant transitions in 45 ms returned []
Running 1458 sub problems to find dead transitions.
[2024-05-24 06:34:44] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
[2024-05-24 06:34:44] [INFO ] Invariant cache hit.
[2024-05-24 06:34:44] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-24 06:35:02] [INFO ] Deduced a trap composed of 3 places in 327 ms of which 4 ms to minimize.
[2024-05-24 06:35:02] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 3 ms to minimize.
[2024-05-24 06:35:02] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 2 ms to minimize.
[2024-05-24 06:35:03] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-05-24 06:35:03] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:35:03] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 2 ms to minimize.
[2024-05-24 06:35:04] [INFO ] Deduced a trap composed of 48 places in 293 ms of which 4 ms to minimize.
[2024-05-24 06:35:05] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 4 ms to minimize.
[2024-05-24 06:35:05] [INFO ] Deduced a trap composed of 38 places in 278 ms of which 4 ms to minimize.
[2024-05-24 06:35:05] [INFO ] Deduced a trap composed of 42 places in 232 ms of which 3 ms to minimize.
[2024-05-24 06:35:06] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-05-24 06:35:06] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 2 ms to minimize.
[2024-05-24 06:35:07] [INFO ] Deduced a trap composed of 56 places in 322 ms of which 4 ms to minimize.
[2024-05-24 06:35:07] [INFO ] Deduced a trap composed of 56 places in 216 ms of which 2 ms to minimize.
[2024-05-24 06:35:07] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 3 ms to minimize.
[2024-05-24 06:35:07] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 3 ms to minimize.
[2024-05-24 06:35:08] [INFO ] Deduced a trap composed of 62 places in 352 ms of which 4 ms to minimize.
[2024-05-24 06:35:08] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 4 ms to minimize.
[2024-05-24 06:35:08] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 2 ms to minimize.
[2024-05-24 06:35:09] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-24 06:35:09] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:35:14] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 3 ms to minimize.
[2024-05-24 06:35:15] [INFO ] Deduced a trap composed of 15 places in 270 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/816 variables, and 45 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/310 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-24 06:35:25] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-24 06:35:27] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-05-24 06:35:30] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 2 ms to minimize.
[2024-05-24 06:35:33] [INFO ] Deduced a trap composed of 30 places in 457 ms of which 5 ms to minimize.
[2024-05-24 06:35:34] [INFO ] Deduced a trap composed of 17 places in 470 ms of which 5 ms to minimize.
[2024-05-24 06:35:34] [INFO ] Deduced a trap composed of 16 places in 368 ms of which 5 ms to minimize.
[2024-05-24 06:35:35] [INFO ] Deduced a trap composed of 19 places in 414 ms of which 5 ms to minimize.
[2024-05-24 06:35:35] [INFO ] Deduced a trap composed of 22 places in 321 ms of which 3 ms to minimize.
[2024-05-24 06:35:35] [INFO ] Deduced a trap composed of 17 places in 399 ms of which 4 ms to minimize.
[2024-05-24 06:35:36] [INFO ] Deduced a trap composed of 25 places in 397 ms of which 5 ms to minimize.
[2024-05-24 06:35:36] [INFO ] Deduced a trap composed of 23 places in 392 ms of which 5 ms to minimize.
[2024-05-24 06:35:37] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 3 ms to minimize.
[2024-05-24 06:35:37] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
[2024-05-24 06:35:37] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-24 06:35:37] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-24 06:35:38] [INFO ] Deduced a trap composed of 27 places in 379 ms of which 4 ms to minimize.
[2024-05-24 06:35:38] [INFO ] Deduced a trap composed of 20 places in 384 ms of which 5 ms to minimize.
[2024-05-24 06:35:38] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-24 06:35:38] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-05-24 06:35:39] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/816 variables, and 65 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/310 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 43/43 constraints]
After SMT, in 61155ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 61182ms
Starting structural reductions in SI_LTL mode, iteration 1 : 310/513 places, 1465/1680 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63430 ms. Remains : 310/513 places, 1465/1680 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 338 ms.
Stack based approach found an accepted trace after 250 steps with 0 reset with depth 251 and stack size 210 in 1 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-03 finished in 63997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 14 place count 506 transition count 1521
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 318 place count 354 transition count 1521
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 320 place count 352 transition count 1507
Iterating global reduction 2 with 2 rules applied. Total rules applied 322 place count 352 transition count 1507
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 406 place count 310 transition count 1465
Applied a total of 406 rules in 91 ms. Remains 310 /513 variables (removed 203) and now considering 1465/1680 (removed 215) transitions.
[2024-05-24 06:35:46] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
// Phase 1: matrix 506 rows 310 cols
[2024-05-24 06:35:46] [INFO ] Computed 22 invariants in 5 ms
[2024-05-24 06:35:46] [INFO ] Implicit Places using invariants in 587 ms returned []
[2024-05-24 06:35:46] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
[2024-05-24 06:35:46] [INFO ] Invariant cache hit.
[2024-05-24 06:35:47] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-24 06:35:49] [INFO ] Implicit Places using invariants and state equation in 2196 ms returned []
Implicit Place search using SMT with State Equation took 2786 ms to find 0 implicit places.
[2024-05-24 06:35:49] [INFO ] Redundant transitions in 28 ms returned []
Running 1458 sub problems to find dead transitions.
[2024-05-24 06:35:49] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
[2024-05-24 06:35:49] [INFO ] Invariant cache hit.
[2024-05-24 06:35:49] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-24 06:36:04] [INFO ] Deduced a trap composed of 3 places in 429 ms of which 6 ms to minimize.
[2024-05-24 06:36:05] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 2 ms to minimize.
[2024-05-24 06:36:05] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2024-05-24 06:36:05] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-05-24 06:36:05] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:36:05] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 3 ms to minimize.
[2024-05-24 06:36:06] [INFO ] Deduced a trap composed of 41 places in 274 ms of which 4 ms to minimize.
[2024-05-24 06:36:06] [INFO ] Deduced a trap composed of 46 places in 244 ms of which 3 ms to minimize.
[2024-05-24 06:36:07] [INFO ] Deduced a trap composed of 39 places in 259 ms of which 4 ms to minimize.
[2024-05-24 06:36:07] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 4 ms to minimize.
[2024-05-24 06:36:08] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 3 ms to minimize.
[2024-05-24 06:36:08] [INFO ] Deduced a trap composed of 38 places in 260 ms of which 4 ms to minimize.
[2024-05-24 06:36:08] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 4 ms to minimize.
[2024-05-24 06:36:09] [INFO ] Deduced a trap composed of 54 places in 243 ms of which 3 ms to minimize.
[2024-05-24 06:36:09] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 4 ms to minimize.
[2024-05-24 06:36:09] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-05-24 06:36:09] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-24 06:36:10] [INFO ] Deduced a trap composed of 64 places in 293 ms of which 4 ms to minimize.
[2024-05-24 06:36:10] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-24 06:36:11] [INFO ] Deduced a trap composed of 41 places in 304 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-24 06:36:12] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:36:14] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:36:15] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 4 ms to minimize.
[2024-05-24 06:36:17] [INFO ] Deduced a trap composed of 54 places in 240 ms of which 4 ms to minimize.
[2024-05-24 06:36:17] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-24 06:36:18] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/816 variables, and 48 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/310 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 26/48 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-24 06:36:26] [INFO ] Deduced a trap composed of 54 places in 255 ms of which 4 ms to minimize.
[2024-05-24 06:36:26] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 3 ms to minimize.
[2024-05-24 06:36:27] [INFO ] Deduced a trap composed of 67 places in 333 ms of which 4 ms to minimize.
[2024-05-24 06:36:28] [INFO ] Deduced a trap composed of 3 places in 435 ms of which 4 ms to minimize.
[2024-05-24 06:36:28] [INFO ] Deduced a trap composed of 58 places in 293 ms of which 5 ms to minimize.
[2024-05-24 06:36:28] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-24 06:36:29] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 4 ms to minimize.
[2024-05-24 06:36:29] [INFO ] Deduced a trap composed of 62 places in 315 ms of which 4 ms to minimize.
[2024-05-24 06:36:29] [INFO ] Deduced a trap composed of 57 places in 338 ms of which 3 ms to minimize.
[2024-05-24 06:36:30] [INFO ] Deduced a trap composed of 48 places in 354 ms of which 5 ms to minimize.
[2024-05-24 06:36:31] [INFO ] Deduced a trap composed of 65 places in 440 ms of which 5 ms to minimize.
[2024-05-24 06:36:31] [INFO ] Deduced a trap composed of 74 places in 397 ms of which 5 ms to minimize.
[2024-05-24 06:36:32] [INFO ] Deduced a trap composed of 71 places in 360 ms of which 4 ms to minimize.
[2024-05-24 06:36:32] [INFO ] Deduced a trap composed of 77 places in 360 ms of which 4 ms to minimize.
[2024-05-24 06:36:33] [INFO ] Deduced a trap composed of 67 places in 441 ms of which 5 ms to minimize.
[2024-05-24 06:36:33] [INFO ] Deduced a trap composed of 74 places in 396 ms of which 4 ms to minimize.
[2024-05-24 06:36:34] [INFO ] Deduced a trap composed of 80 places in 445 ms of which 5 ms to minimize.
[2024-05-24 06:36:34] [INFO ] Deduced a trap composed of 51 places in 437 ms of which 4 ms to minimize.
[2024-05-24 06:36:35] [INFO ] Deduced a trap composed of 74 places in 443 ms of which 5 ms to minimize.
[2024-05-24 06:36:35] [INFO ] Deduced a trap composed of 72 places in 425 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-24 06:36:37] [INFO ] Deduced a trap composed of 53 places in 248 ms of which 3 ms to minimize.
[2024-05-24 06:36:38] [INFO ] Deduced a trap composed of 38 places in 307 ms of which 5 ms to minimize.
[2024-05-24 06:36:38] [INFO ] Deduced a trap composed of 44 places in 281 ms of which 4 ms to minimize.
[2024-05-24 06:36:39] [INFO ] Deduced a trap composed of 43 places in 323 ms of which 4 ms to minimize.
[2024-05-24 06:36:39] [INFO ] Deduced a trap composed of 43 places in 286 ms of which 4 ms to minimize.
[2024-05-24 06:36:40] [INFO ] Deduced a trap composed of 17 places in 355 ms of which 4 ms to minimize.
[2024-05-24 06:36:41] [INFO ] Deduced a trap composed of 62 places in 363 ms of which 4 ms to minimize.
[2024-05-24 06:36:41] [INFO ] Deduced a trap composed of 54 places in 313 ms of which 4 ms to minimize.
[2024-05-24 06:36:44] [INFO ] Deduced a trap composed of 67 places in 338 ms of which 5 ms to minimize.
[2024-05-24 06:36:44] [INFO ] Deduced a trap composed of 60 places in 281 ms of which 4 ms to minimize.
[2024-05-24 06:36:44] [INFO ] Deduced a trap composed of 63 places in 385 ms of which 4 ms to minimize.
[2024-05-24 06:36:45] [INFO ] Deduced a trap composed of 63 places in 346 ms of which 4 ms to minimize.
[2024-05-24 06:36:45] [INFO ] Deduced a trap composed of 56 places in 348 ms of which 5 ms to minimize.
[2024-05-24 06:36:45] [INFO ] Deduced a trap composed of 20 places in 382 ms of which 5 ms to minimize.
[2024-05-24 06:36:46] [INFO ] Deduced a trap composed of 60 places in 331 ms of which 4 ms to minimize.
[2024-05-24 06:36:46] [INFO ] Deduced a trap composed of 49 places in 345 ms of which 4 ms to minimize.
[2024-05-24 06:36:47] [INFO ] Deduced a trap composed of 58 places in 337 ms of which 5 ms to minimize.
[2024-05-24 06:36:47] [INFO ] Deduced a trap composed of 45 places in 286 ms of which 4 ms to minimize.
[2024-05-24 06:36:47] [INFO ] Deduced a trap composed of 52 places in 317 ms of which 4 ms to minimize.
[2024-05-24 06:36:48] [INFO ] Deduced a trap composed of 73 places in 285 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
(s265 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 1)
(s31 0)
(s32 1)
(s33 1)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/816 variables, and 88 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/310 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 66/66 constraints]
After SMT, in 60928ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 60944ms
Starting structural reductions in SI_LTL mode, iteration 1 : 310/513 places, 1465/1680 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63860 ms. Remains : 310/513 places, 1465/1680 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 360 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 1 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-09 finished in 64302 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((F(p1)&&(!p2 U (p3||G(!p2))))))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 14 place count 506 transition count 1523
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 314 place count 356 transition count 1523
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 316 place count 354 transition count 1509
Iterating global reduction 2 with 2 rules applied. Total rules applied 318 place count 354 transition count 1509
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 402 place count 312 transition count 1467
Applied a total of 402 rules in 123 ms. Remains 312 /513 variables (removed 201) and now considering 1467/1680 (removed 213) transitions.
[2024-05-24 06:36:50] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
// Phase 1: matrix 508 rows 312 cols
[2024-05-24 06:36:50] [INFO ] Computed 22 invariants in 4 ms
[2024-05-24 06:36:51] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-24 06:36:51] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
[2024-05-24 06:36:51] [INFO ] Invariant cache hit.
[2024-05-24 06:36:51] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-24 06:36:53] [INFO ] Implicit Places using invariants and state equation in 1727 ms returned []
Implicit Place search using SMT with State Equation took 2392 ms to find 0 implicit places.
[2024-05-24 06:36:53] [INFO ] Redundant transitions in 43 ms returned []
Running 1460 sub problems to find dead transitions.
[2024-05-24 06:36:53] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
[2024-05-24 06:36:53] [INFO ] Invariant cache hit.
[2024-05-24 06:36:53] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-24 06:37:11] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 3 ms to minimize.
[2024-05-24 06:37:11] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-05-24 06:37:11] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2024-05-24 06:37:11] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2024-05-24 06:37:11] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-24 06:37:12] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:37:12] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 3 ms to minimize.
[2024-05-24 06:37:13] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-05-24 06:37:14] [INFO ] Deduced a trap composed of 52 places in 353 ms of which 5 ms to minimize.
[2024-05-24 06:37:14] [INFO ] Deduced a trap composed of 57 places in 343 ms of which 4 ms to minimize.
[2024-05-24 06:37:14] [INFO ] Deduced a trap composed of 72 places in 336 ms of which 5 ms to minimize.
[2024-05-24 06:37:15] [INFO ] Deduced a trap composed of 67 places in 321 ms of which 4 ms to minimize.
[2024-05-24 06:37:15] [INFO ] Deduced a trap composed of 80 places in 359 ms of which 5 ms to minimize.
[2024-05-24 06:37:16] [INFO ] Deduced a trap composed of 21 places in 351 ms of which 4 ms to minimize.
[2024-05-24 06:37:16] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 4 ms to minimize.
[2024-05-24 06:37:16] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 3 ms to minimize.
[2024-05-24 06:37:17] [INFO ] Deduced a trap composed of 37 places in 378 ms of which 4 ms to minimize.
[2024-05-24 06:37:17] [INFO ] Deduced a trap composed of 13 places in 373 ms of which 5 ms to minimize.
[2024-05-24 06:37:18] [INFO ] Deduced a trap composed of 65 places in 377 ms of which 4 ms to minimize.
[2024-05-24 06:37:18] [INFO ] Deduced a trap composed of 55 places in 383 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-24 06:37:21] [INFO ] Deduced a trap composed of 61 places in 254 ms of which 4 ms to minimize.
[2024-05-24 06:37:21] [INFO ] Deduced a trap composed of 39 places in 305 ms of which 4 ms to minimize.
[2024-05-24 06:37:22] [INFO ] Deduced a trap composed of 43 places in 308 ms of which 4 ms to minimize.
[2024-05-24 06:37:23] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-05-24 06:37:24] [INFO ] Deduced a trap composed of 60 places in 324 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/820 variables, and 47 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/312 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1460/1460 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2024-05-24 06:37:30] [INFO ] Deduced a trap composed of 53 places in 366 ms of which 4 ms to minimize.
[2024-05-24 06:37:31] [INFO ] Deduced a trap composed of 3 places in 313 ms of which 4 ms to minimize.
[2024-05-24 06:37:31] [INFO ] Deduced a trap composed of 54 places in 314 ms of which 4 ms to minimize.
[2024-05-24 06:37:32] [INFO ] Deduced a trap composed of 64 places in 306 ms of which 4 ms to minimize.
[2024-05-24 06:37:32] [INFO ] Deduced a trap composed of 16 places in 309 ms of which 4 ms to minimize.
[2024-05-24 06:37:33] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
[2024-05-24 06:37:34] [INFO ] Deduced a trap composed of 55 places in 304 ms of which 4 ms to minimize.
[2024-05-24 06:37:36] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-24 06:37:37] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2024-05-24 06:37:39] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
[2024-05-24 06:37:40] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-24 06:37:41] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-05-24 06:37:43] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 2 ms to minimize.
[2024-05-24 06:37:46] [INFO ] Deduced a trap composed of 26 places in 384 ms of which 4 ms to minimize.
[2024-05-24 06:37:47] [INFO ] Deduced a trap composed of 24 places in 402 ms of which 4 ms to minimize.
[2024-05-24 06:37:47] [INFO ] Deduced a trap composed of 19 places in 384 ms of which 4 ms to minimize.
[2024-05-24 06:37:47] [INFO ] Deduced a trap composed of 21 places in 404 ms of which 5 ms to minimize.
[2024-05-24 06:37:48] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 3 ms to minimize.
[2024-05-24 06:37:48] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
[2024-05-24 06:37:48] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/820 variables, and 67 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/312 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1460 constraints, Known Traps: 45/45 constraints]
After SMT, in 61368ms problems are : Problem set: 0 solved, 1460 unsolved
Search for dead transitions found 0 dead transitions in 61395ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/513 places, 1467/1680 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63972 ms. Remains : 312/513 places, 1467/1680 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 623 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-11 finished in 64857 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)||G(F(p1)))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-07-LTLCardinality-00
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 513/513 places, 1680/1680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 1673
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 506 transition count 1673
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 14 place count 506 transition count 1522
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 316 place count 355 transition count 1522
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 398 place count 314 transition count 1481
Applied a total of 398 rules in 84 ms. Remains 314 /513 variables (removed 199) and now considering 1481/1680 (removed 199) transitions.
[2024-05-24 06:37:55] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2024-05-24 06:37:55] [INFO ] Computed 22 invariants in 3 ms
[2024-05-24 06:37:56] [INFO ] Implicit Places using invariants in 785 ms returned []
[2024-05-24 06:37:56] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-05-24 06:37:56] [INFO ] Invariant cache hit.
[2024-05-24 06:37:57] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-24 06:37:58] [INFO ] Implicit Places using invariants and state equation in 2150 ms returned []
Implicit Place search using SMT with State Equation took 2936 ms to find 0 implicit places.
Running 1474 sub problems to find dead transitions.
[2024-05-24 06:37:58] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-05-24 06:37:58] [INFO ] Invariant cache hit.
[2024-05-24 06:37:58] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-05-24 06:38:15] [INFO ] Deduced a trap composed of 3 places in 386 ms of which 4 ms to minimize.
[2024-05-24 06:38:15] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 2 ms to minimize.
[2024-05-24 06:38:15] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 2 ms to minimize.
[2024-05-24 06:38:15] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 3 ms to minimize.
[2024-05-24 06:38:15] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2024-05-24 06:38:16] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:38:16] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 3 ms to minimize.
[2024-05-24 06:38:18] [INFO ] Deduced a trap composed of 40 places in 316 ms of which 5 ms to minimize.
[2024-05-24 06:38:18] [INFO ] Deduced a trap composed of 44 places in 310 ms of which 4 ms to minimize.
[2024-05-24 06:38:18] [INFO ] Deduced a trap composed of 43 places in 278 ms of which 4 ms to minimize.
[2024-05-24 06:38:19] [INFO ] Deduced a trap composed of 43 places in 317 ms of which 4 ms to minimize.
[2024-05-24 06:38:19] [INFO ] Deduced a trap composed of 39 places in 318 ms of which 5 ms to minimize.
[2024-05-24 06:38:19] [INFO ] Deduced a trap composed of 74 places in 309 ms of which 4 ms to minimize.
[2024-05-24 06:38:20] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 2 ms to minimize.
[2024-05-24 06:38:20] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-05-24 06:38:21] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 2 ms to minimize.
[2024-05-24 06:38:21] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 3 ms to minimize.
[2024-05-24 06:38:21] [INFO ] Deduced a trap composed of 13 places in 326 ms of which 4 ms to minimize.
[2024-05-24 06:38:22] [INFO ] Deduced a trap composed of 20 places in 362 ms of which 5 ms to minimize.
[2024-05-24 06:38:23] [INFO ] Deduced a trap composed of 3 places in 260 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-05-24 06:38:29] [INFO ] Deduced a trap composed of 15 places in 322 ms of which 4 ms to minimize.
SMT process timed out in 30889ms, After SMT, problems are : Problem set: 0 solved, 1474 unsolved
Search for dead transitions found 0 dead transitions in 30906ms
Starting structural reductions in LI_LTL mode, iteration 1 : 314/513 places, 1481/1680 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 33936 ms. Remains : 314/513 places, 1481/1680 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 338 ms.
Product exploration explored 100000 steps with 0 reset in 417 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 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 130 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 280 ms. (142 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
[2024-05-24 06:38:31] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-05-24 06:38:31] [INFO ] Invariant cache hit.
[2024-05-24 06:38:31] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 163/169 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/178 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 306/484 variables, 178/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 44/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 43/527 variables, 7/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 48/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 60/587 variables, 27/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 18/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 96/683 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/683 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/689 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/689 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 147/836 variables, 102/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/836 variables, 122/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/836 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/836 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 612 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 314/314 constraints, ReadFeed: 232/232 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 163/169 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/178 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 06:38:31] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2024-05-24 06:38:32] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-05-24 06:38:32] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 2 ms to minimize.
[2024-05-24 06:38:32] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 4/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 306/484 variables, 178/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 44/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 43/527 variables, 7/245 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 1/246 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 48/294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/527 variables, 0/294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 60/587 variables, 27/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 18/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/587 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 96/683 variables, 6/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/683 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/689 variables, 3/348 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/689 variables, 1/349 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 06:38:32] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-05-24 06:38:33] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 3 ms to minimize.
[2024-05-24 06:38:33] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-24 06:38:33] [INFO ] Deduced a trap composed of 44 places in 277 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/689 variables, 4/353 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/689 variables, 0/353 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 147/836 variables, 102/455 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/836 variables, 122/577 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 06:38:33] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/836 variables, 1/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/836 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/836 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 836/836 variables, and 578 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2369 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 314/314 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 3002ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 4 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 1481/1481 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 314 transition count 1479
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 312 transition count 1479
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 311 transition count 1478
Applied a total of 6 rules in 49 ms. Remains 311 /314 variables (removed 3) and now considering 1478/1481 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 311/314 places, 1478/1481 transitions.
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 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
Interrupted probabilistic random walk after 493632 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 1
Probabilistic random walk after 493632 steps, saw 177509 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
[2024-05-24 06:38:37] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2024-05-24 06:38:37] [INFO ] Computed 22 invariants in 8 ms
[2024-05-24 06:38:37] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 231/363 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 24/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 55/418 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 39/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/498 variables, 36/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 21/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 128/626 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/626 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/634 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/634 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 196/830 variables, 136/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/830 variables, 148/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 06:38:37] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 231/363 variables, 132/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/418 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 39/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/498 variables, 36/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 21/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 128/626 variables, 8/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/626 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/634 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/634 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 06:38:38] [INFO ] Deduced a trap composed of 19 places in 291 ms of which 3 ms to minimize.
[2024-05-24 06:38:38] [INFO ] Deduced a trap composed of 14 places in 349 ms of which 4 ms to minimize.
[2024-05-24 06:38:38] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 2 ms to minimize.
[2024-05-24 06:38:39] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 3 ms to minimize.
[2024-05-24 06:38:39] [INFO ] Deduced a trap composed of 27 places in 419 ms of which 4 ms to minimize.
[2024-05-24 06:38:40] [INFO ] Deduced a trap composed of 17 places in 422 ms of which 5 ms to minimize.
[2024-05-24 06:38:40] [INFO ] Deduced a trap composed of 74 places in 415 ms of which 4 ms to minimize.
[2024-05-24 06:38:40] [INFO ] Deduced a trap composed of 66 places in 415 ms of which 4 ms to minimize.
[2024-05-24 06:38:41] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/634 variables, 9/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/634 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 196/830 variables, 136/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/830 variables, 148/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/830 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/830 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3670 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 4052ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 149 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 66 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 311/311 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 67 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2024-05-24 06:38:41] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-05-24 06:38:41] [INFO ] Invariant cache hit.
[2024-05-24 06:38:42] [INFO ] Implicit Places using invariants in 796 ms returned []
[2024-05-24 06:38:42] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-05-24 06:38:42] [INFO ] Invariant cache hit.
[2024-05-24 06:38:42] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-24 06:38:44] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 2526 ms to find 0 implicit places.
[2024-05-24 06:38:44] [INFO ] Redundant transitions in 42 ms returned []
Running 1471 sub problems to find dead transitions.
[2024-05-24 06:38:44] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-05-24 06:38:44] [INFO ] Invariant cache hit.
[2024-05-24 06:38:44] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-05-24 06:39:02] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 2 ms to minimize.
[2024-05-24 06:39:02] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-05-24 06:39:02] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2024-05-24 06:39:02] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:39:02] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:39:04] [INFO ] Deduced a trap composed of 48 places in 312 ms of which 4 ms to minimize.
[2024-05-24 06:39:04] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 4 ms to minimize.
[2024-05-24 06:39:05] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 2 ms to minimize.
[2024-05-24 06:39:05] [INFO ] Deduced a trap composed of 61 places in 260 ms of which 4 ms to minimize.
[2024-05-24 06:39:05] [INFO ] Deduced a trap composed of 68 places in 266 ms of which 4 ms to minimize.
[2024-05-24 06:39:06] [INFO ] Deduced a trap composed of 56 places in 224 ms of which 4 ms to minimize.
[2024-05-24 06:39:06] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-24 06:39:06] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-05-24 06:39:06] [INFO ] Deduced a trap composed of 65 places in 337 ms of which 4 ms to minimize.
[2024-05-24 06:39:07] [INFO ] Deduced a trap composed of 40 places in 336 ms of which 4 ms to minimize.
[2024-05-24 06:39:07] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 3 ms to minimize.
[2024-05-24 06:39:07] [INFO ] Deduced a trap composed of 10 places in 367 ms of which 5 ms to minimize.
[2024-05-24 06:39:08] [INFO ] Deduced a trap composed of 23 places in 311 ms of which 4 ms to minimize.
[2024-05-24 06:39:08] [INFO ] Deduced a trap composed of 56 places in 355 ms of which 5 ms to minimize.
[2024-05-24 06:39:08] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-05-24 06:39:11] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 2 ms to minimize.
[2024-05-24 06:39:12] [INFO ] Deduced a trap composed of 60 places in 260 ms of which 4 ms to minimize.
[2024-05-24 06:39:13] [INFO ] Deduced a trap composed of 56 places in 304 ms of which 4 ms to minimize.
[2024-05-24 06:39:13] [INFO ] Deduced a trap composed of 50 places in 250 ms of which 3 ms to minimize.
[2024-05-24 06:39:13] [INFO ] Deduced a trap composed of 51 places in 388 ms of which 4 ms to minimize.
[2024-05-24 06:39:13] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 3 ms to minimize.
[2024-05-24 06:39:14] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-05-24 06:39:14] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 2 ms to minimize.
[2024-05-24 06:39:14] [INFO ] Deduced a trap composed of 43 places in 391 ms of which 5 ms to minimize.
[2024-05-24 06:39:15] [INFO ] Deduced a trap composed of 45 places in 287 ms of which 4 ms to minimize.
SMT process timed out in 31008ms, After SMT, problems are : Problem set: 0 solved, 1471 unsolved
Search for dead transitions found 0 dead transitions in 31044ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33696 ms. Remains : 311/311 places, 1478/1478 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1338 edges and 311 vertex of which 47 / 311 are part of one of the 7 SCC in 1 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 153 transitions
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 271 transition count 331
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 209 transition count 331
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 125 place count 209 transition count 317
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 189 transition count 317
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 323 place count 107 transition count 235
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 364 place count 107 transition count 194
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 380 place count 99 transition count 216
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 99 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 404 place count 99 transition count 192
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 441 place count 99 transition count 155
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 478 place count 62 transition count 155
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 62 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 488 place count 62 transition count 155
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 489 place count 62 transition count 154
Applied a total of 489 rules in 40 ms. Remains 62 /311 variables (removed 249) and now considering 154/1478 (removed 1324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 62 cols
[2024-05-24 06:39:15] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 06:39:15] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:39:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-24 06:39:15] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:39:15] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:39:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 06:39:15] [INFO ] After 15ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 06:39:15] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:39:15] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 275 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 188 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 6 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 1481/1481 transitions.
Applied a total of 0 rules in 36 ms. Remains 314 /314 variables (removed 0) and now considering 1481/1481 (removed 0) transitions.
[2024-05-24 06:39:16] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2024-05-24 06:39:16] [INFO ] Computed 22 invariants in 3 ms
[2024-05-24 06:39:16] [INFO ] Implicit Places using invariants in 669 ms returned []
[2024-05-24 06:39:16] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-05-24 06:39:16] [INFO ] Invariant cache hit.
[2024-05-24 06:39:17] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-24 06:39:18] [INFO ] Implicit Places using invariants and state equation in 1966 ms returned []
Implicit Place search using SMT with State Equation took 2638 ms to find 0 implicit places.
[2024-05-24 06:39:18] [INFO ] Redundant transitions in 25 ms returned []
Running 1474 sub problems to find dead transitions.
[2024-05-24 06:39:18] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-05-24 06:39:18] [INFO ] Invariant cache hit.
[2024-05-24 06:39:18] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-05-24 06:39:34] [INFO ] Deduced a trap composed of 3 places in 465 ms of which 5 ms to minimize.
[2024-05-24 06:39:35] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 3 ms to minimize.
[2024-05-24 06:39:35] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 2 ms to minimize.
[2024-05-24 06:39:35] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 2 ms to minimize.
[2024-05-24 06:39:35] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-05-24 06:39:35] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:39:36] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 4 ms to minimize.
[2024-05-24 06:39:37] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 4 ms to minimize.
[2024-05-24 06:39:37] [INFO ] Deduced a trap composed of 44 places in 265 ms of which 4 ms to minimize.
[2024-05-24 06:39:38] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 2 ms to minimize.
[2024-05-24 06:39:38] [INFO ] Deduced a trap composed of 43 places in 260 ms of which 4 ms to minimize.
[2024-05-24 06:39:38] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 4 ms to minimize.
[2024-05-24 06:39:39] [INFO ] Deduced a trap composed of 74 places in 231 ms of which 2 ms to minimize.
[2024-05-24 06:39:39] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 2 ms to minimize.
[2024-05-24 06:39:39] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-05-24 06:39:40] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-24 06:39:40] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 3 ms to minimize.
[2024-05-24 06:39:40] [INFO ] Deduced a trap composed of 13 places in 363 ms of which 4 ms to minimize.
[2024-05-24 06:39:41] [INFO ] Deduced a trap composed of 20 places in 317 ms of which 5 ms to minimize.
[2024-05-24 06:39:42] [INFO ] Deduced a trap composed of 3 places in 337 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-05-24 06:39:49] [INFO ] Deduced a trap composed of 15 places in 333 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/836 variables, and 43 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 1474/1474 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-05-24 06:40:01] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-05-24 06:40:01] [INFO ] Deduced a trap composed of 15 places in 338 ms of which 4 ms to minimize.
[2024-05-24 06:40:04] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 2 ms to minimize.
[2024-05-24 06:40:07] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 3 ms to minimize.
[2024-05-24 06:40:10] [INFO ] Deduced a trap composed of 17 places in 449 ms of which 5 ms to minimize.
[2024-05-24 06:40:10] [INFO ] Deduced a trap composed of 21 places in 367 ms of which 4 ms to minimize.
[2024-05-24 06:40:11] [INFO ] Deduced a trap composed of 25 places in 332 ms of which 5 ms to minimize.
[2024-05-24 06:40:11] [INFO ] Deduced a trap composed of 21 places in 321 ms of which 5 ms to minimize.
[2024-05-24 06:40:12] [INFO ] Deduced a trap composed of 17 places in 333 ms of which 5 ms to minimize.
[2024-05-24 06:40:12] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 2 ms to minimize.
[2024-05-24 06:40:12] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2024-05-24 06:40:12] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 2 ms to minimize.
[2024-05-24 06:40:12] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-24 06:40:13] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 2 ms to minimize.
[2024-05-24 06:40:13] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 2 ms to minimize.
[2024-05-24 06:40:13] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-24 06:40:14] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2024-05-24 06:40:15] [INFO ] Deduced a trap composed of 53 places in 407 ms of which 5 ms to minimize.
[2024-05-24 06:40:15] [INFO ] Deduced a trap composed of 53 places in 369 ms of which 4 ms to minimize.
[2024-05-24 06:40:15] [INFO ] Deduced a trap composed of 63 places in 419 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/836 variables, and 63 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/314 constraints, ReadFeed: 0/232 constraints, PredecessorRefiner: 0/1474 constraints, Known Traps: 41/41 constraints]
After SMT, in 60901ms problems are : Problem set: 0 solved, 1474 unsolved
Search for dead transitions found 0 dead transitions in 60918ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63627 ms. Remains : 314/314 places, 1481/1481 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 139 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 787 ms. (50 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
[2024-05-24 06:40:20] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-05-24 06:40:20] [INFO ] Invariant cache hit.
[2024-05-24 06:40:20] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 163/169 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/178 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 306/484 variables, 178/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 44/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 43/527 variables, 7/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 48/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 60/587 variables, 27/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 18/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 96/683 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/683 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/689 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/689 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 147/836 variables, 102/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/836 variables, 122/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/836 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/836 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 314/314 constraints, ReadFeed: 232/232 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 163/169 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/178 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 06:40:21] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 2 ms to minimize.
[2024-05-24 06:40:21] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
[2024-05-24 06:40:21] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 2 ms to minimize.
[2024-05-24 06:40:21] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 4/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 306/484 variables, 178/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 44/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 43/527 variables, 7/245 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 1/246 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 48/294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/527 variables, 0/294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 60/587 variables, 27/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 18/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/587 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 96/683 variables, 6/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/683 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/689 variables, 3/348 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/689 variables, 1/349 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 06:40:22] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 2 ms to minimize.
[2024-05-24 06:40:22] [INFO ] Deduced a trap composed of 33 places in 341 ms of which 3 ms to minimize.
[2024-05-24 06:40:22] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-24 06:40:23] [INFO ] Deduced a trap composed of 44 places in 318 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/689 variables, 4/353 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/689 variables, 0/353 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 147/836 variables, 102/455 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/836 variables, 122/577 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 06:40:23] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/836 variables, 1/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/836 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/836 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 836/836 variables, and 578 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2607 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 314/314 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 3233ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 121 ms.
Support contains 4 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 1481/1481 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 314 transition count 1479
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 312 transition count 1479
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 311 transition count 1478
Applied a total of 6 rules in 76 ms. Remains 311 /314 variables (removed 3) and now considering 1478/1481 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 311/314 places, 1478/1481 transitions.
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 477208 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 1
Probabilistic random walk after 477208 steps, saw 173451 distinct states, run finished after 3005 ms. (steps per millisecond=158 ) properties seen :0
[2024-05-24 06:40:26] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
// Phase 1: matrix 519 rows 311 cols
[2024-05-24 06:40:26] [INFO ] Computed 22 invariants in 2 ms
[2024-05-24 06:40:26] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 231/363 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 24/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 55/418 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 39/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/498 variables, 36/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 21/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 128/626 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/626 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/634 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/634 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 196/830 variables, 136/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/830 variables, 148/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/132 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 06:40:27] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 231/363 variables, 132/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 24/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/418 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 39/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/498 variables, 36/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 21/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 128/626 variables, 8/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/626 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/634 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/634 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 06:40:27] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 2 ms to minimize.
[2024-05-24 06:40:28] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 3 ms to minimize.
[2024-05-24 06:40:28] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2024-05-24 06:40:28] [INFO ] Deduced a trap composed of 18 places in 282 ms of which 4 ms to minimize.
[2024-05-24 06:40:29] [INFO ] Deduced a trap composed of 27 places in 425 ms of which 4 ms to minimize.
[2024-05-24 06:40:29] [INFO ] Deduced a trap composed of 17 places in 418 ms of which 5 ms to minimize.
[2024-05-24 06:40:29] [INFO ] Deduced a trap composed of 74 places in 418 ms of which 5 ms to minimize.
[2024-05-24 06:40:30] [INFO ] Deduced a trap composed of 66 places in 349 ms of which 5 ms to minimize.
[2024-05-24 06:40:30] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/634 variables, 9/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/634 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 196/830 variables, 136/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/830 variables, 148/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/830 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/830 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3420 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 3792ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 132 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 60 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 311/311 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1478/1478 transitions.
Applied a total of 0 rules in 59 ms. Remains 311 /311 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2024-05-24 06:40:30] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-05-24 06:40:30] [INFO ] Invariant cache hit.
[2024-05-24 06:40:31] [INFO ] Implicit Places using invariants in 622 ms returned []
[2024-05-24 06:40:31] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-05-24 06:40:31] [INFO ] Invariant cache hit.
[2024-05-24 06:40:31] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-24 06:40:33] [INFO ] Implicit Places using invariants and state equation in 2200 ms returned []
Implicit Place search using SMT with State Equation took 2824 ms to find 0 implicit places.
[2024-05-24 06:40:33] [INFO ] Redundant transitions in 40 ms returned []
Running 1471 sub problems to find dead transitions.
[2024-05-24 06:40:33] [INFO ] Flow matrix only has 519 transitions (discarded 959 similar events)
[2024-05-24 06:40:33] [INFO ] Invariant cache hit.
[2024-05-24 06:40:33] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-05-24 06:40:52] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 2 ms to minimize.
[2024-05-24 06:40:52] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 2 ms to minimize.
[2024-05-24 06:40:52] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 3 ms to minimize.
[2024-05-24 06:40:52] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-24 06:40:52] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:40:54] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 4 ms to minimize.
[2024-05-24 06:40:54] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 3 ms to minimize.
[2024-05-24 06:40:55] [INFO ] Deduced a trap composed of 37 places in 304 ms of which 4 ms to minimize.
[2024-05-24 06:40:55] [INFO ] Deduced a trap composed of 61 places in 317 ms of which 4 ms to minimize.
[2024-05-24 06:40:56] [INFO ] Deduced a trap composed of 68 places in 329 ms of which 5 ms to minimize.
[2024-05-24 06:40:56] [INFO ] Deduced a trap composed of 56 places in 264 ms of which 3 ms to minimize.
[2024-05-24 06:40:56] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-05-24 06:40:56] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2024-05-24 06:40:57] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 3 ms to minimize.
[2024-05-24 06:40:57] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 4 ms to minimize.
[2024-05-24 06:40:57] [INFO ] Deduced a trap composed of 26 places in 360 ms of which 4 ms to minimize.
[2024-05-24 06:40:58] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 4 ms to minimize.
[2024-05-24 06:40:58] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 3 ms to minimize.
[2024-05-24 06:40:58] [INFO ] Deduced a trap composed of 56 places in 237 ms of which 3 ms to minimize.
[2024-05-24 06:40:58] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1471 unsolved
[2024-05-24 06:41:01] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 3 ms to minimize.
[2024-05-24 06:41:03] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 3 ms to minimize.
[2024-05-24 06:41:03] [INFO ] Deduced a trap composed of 56 places in 221 ms of which 3 ms to minimize.
[2024-05-24 06:41:03] [INFO ] Deduced a trap composed of 50 places in 295 ms of which 4 ms to minimize.
[2024-05-24 06:41:04] [INFO ] Deduced a trap composed of 51 places in 322 ms of which 4 ms to minimize.
[2024-05-24 06:41:04] [INFO ] Deduced a trap composed of 41 places in 292 ms of which 4 ms to minimize.
[2024-05-24 06:41:04] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
[2024-05-24 06:41:04] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 2 ms to minimize.
[2024-05-24 06:41:05] [INFO ] Deduced a trap composed of 43 places in 316 ms of which 4 ms to minimize.
SMT process timed out in 31429ms, After SMT, problems are : Problem set: 0 solved, 1471 unsolved
Search for dead transitions found 0 dead transitions in 31455ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34389 ms. Remains : 311/311 places, 1478/1478 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1338 edges and 311 vertex of which 47 / 311 are part of one of the 7 SCC in 0 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 153 transitions
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 271 transition count 331
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 209 transition count 331
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 125 place count 209 transition count 317
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 159 place count 189 transition count 317
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 323 place count 107 transition count 235
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 364 place count 107 transition count 194
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 380 place count 99 transition count 216
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 99 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 404 place count 99 transition count 192
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 441 place count 99 transition count 155
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 478 place count 62 transition count 155
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 62 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 488 place count 62 transition count 155
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 489 place count 62 transition count 154
Applied a total of 489 rules in 34 ms. Remains 62 /311 variables (removed 249) and now considering 154/1478 (removed 1324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 62 cols
[2024-05-24 06:41:05] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 06:41:05] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:41:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-24 06:41:05] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:41:05] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:41:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 06:41:05] [INFO ] After 16ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 06:41:05] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:41:05] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 266 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 136 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 318 ms.
Product exploration explored 100000 steps with 0 reset in 379 ms.
Built C files in :
/tmp/ltsmin2773387349904492844
[2024-05-24 06:41:06] [INFO ] Computing symmetric may disable matrix : 1481 transitions.
[2024-05-24 06:41:06] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:41:06] [INFO ] Computing symmetric may enable matrix : 1481 transitions.
[2024-05-24 06:41:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:41:07] [INFO ] Computing Do-Not-Accords matrix : 1481 transitions.
[2024-05-24 06:41:07] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:41:07] [INFO ] Built C files in 386ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2773387349904492844
Running compilation step : cd /tmp/ltsmin2773387349904492844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2773387349904492844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2773387349904492844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 1481/1481 transitions.
Applied a total of 0 rules in 51 ms. Remains 314 /314 variables (removed 0) and now considering 1481/1481 (removed 0) transitions.
[2024-05-24 06:41:10] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
// Phase 1: matrix 522 rows 314 cols
[2024-05-24 06:41:10] [INFO ] Computed 22 invariants in 6 ms
[2024-05-24 06:41:10] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-24 06:41:10] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-05-24 06:41:10] [INFO ] Invariant cache hit.
[2024-05-24 06:41:11] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-24 06:41:12] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 2234 ms to find 0 implicit places.
[2024-05-24 06:41:12] [INFO ] Redundant transitions in 41 ms returned []
Running 1474 sub problems to find dead transitions.
[2024-05-24 06:41:12] [INFO ] Flow matrix only has 522 transitions (discarded 959 similar events)
[2024-05-24 06:41:12] [INFO ] Invariant cache hit.
[2024-05-24 06:41:12] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-05-24 06:41:29] [INFO ] Deduced a trap composed of 3 places in 356 ms of which 5 ms to minimize.
[2024-05-24 06:41:29] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 3 ms to minimize.
[2024-05-24 06:41:29] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 2 ms to minimize.
[2024-05-24 06:41:29] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 3 ms to minimize.
[2024-05-24 06:41:29] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-05-24 06:41:30] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:41:30] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 3 ms to minimize.
[2024-05-24 06:41:32] [INFO ] Deduced a trap composed of 40 places in 270 ms of which 4 ms to minimize.
[2024-05-24 06:41:32] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 4 ms to minimize.
[2024-05-24 06:41:32] [INFO ] Deduced a trap composed of 43 places in 236 ms of which 4 ms to minimize.
[2024-05-24 06:41:33] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 4 ms to minimize.
[2024-05-24 06:41:33] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 4 ms to minimize.
[2024-05-24 06:41:33] [INFO ] Deduced a trap composed of 74 places in 250 ms of which 4 ms to minimize.
[2024-05-24 06:41:34] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 2 ms to minimize.
[2024-05-24 06:41:34] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-05-24 06:41:34] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-24 06:41:34] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-05-24 06:41:35] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 4 ms to minimize.
[2024-05-24 06:41:35] [INFO ] Deduced a trap composed of 20 places in 292 ms of which 4 ms to minimize.
[2024-05-24 06:41:36] [INFO ] Deduced a trap composed of 3 places in 295 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
[2024-05-24 06:41:42] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 4 ms to minimize.
[2024-05-24 06:41:43] [INFO ] Deduced a trap composed of 15 places in 304 ms of which 4 ms to minimize.
SMT process timed out in 31244ms, After SMT, problems are : Problem set: 0 solved, 1474 unsolved
Search for dead transitions found 0 dead transitions in 31271ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33610 ms. Remains : 314/314 places, 1481/1481 transitions.
Built C files in :
/tmp/ltsmin8082585407491173964
[2024-05-24 06:41:43] [INFO ] Computing symmetric may disable matrix : 1481 transitions.
[2024-05-24 06:41:43] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:41:43] [INFO ] Computing symmetric may enable matrix : 1481 transitions.
[2024-05-24 06:41:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:41:44] [INFO ] Computing Do-Not-Accords matrix : 1481 transitions.
[2024-05-24 06:41:44] [INFO ] Computation of Completed DNA matrix. took 66 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 06:41:44] [INFO ] Built C files in 647ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8082585407491173964
Running compilation step : cd /tmp/ltsmin8082585407491173964;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8082585407491173964;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8082585407491173964;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 06:41:47] [INFO ] Flatten gal took : 47 ms
[2024-05-24 06:41:47] [INFO ] Flatten gal took : 49 ms
[2024-05-24 06:41:47] [INFO ] Time to serialize gal into /tmp/LTL4938836958973218397.gal : 13 ms
[2024-05-24 06:41:47] [INFO ] Time to serialize properties into /tmp/LTL10070965552693884161.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4938836958973218397.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8309209096828771534.hoa' '-atoms' '/tmp/LTL10070965552693884161.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10070965552693884161.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8309209096828771534.hoa
Detected timeout of ITS tools.
[2024-05-24 06:42:02] [INFO ] Flatten gal took : 48 ms
[2024-05-24 06:42:02] [INFO ] Flatten gal took : 49 ms
[2024-05-24 06:42:02] [INFO ] Time to serialize gal into /tmp/LTL17051006617725051850.gal : 7 ms
[2024-05-24 06:42:02] [INFO ] Time to serialize properties into /tmp/LTL16649720532877568694.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17051006617725051850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16649720532877568694.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G("((p18_5_3==0)||(p08_4_0==1))"))||(G(F("(((p34_1_5==0)||(p10_5_3==1))||((p10_5_4==0)||(p27_2==1)))"))))))
Formula 0 simplified : X(F!"((p18_5_3==0)||(p08_4_0==1))" & FG!"(((p34_1_5==0)||(p10_5_3==1))||((p10_5_4==0)||(p27_2==1)))")
Detected timeout of ITS tools.
[2024-05-24 06:42:17] [INFO ] Flatten gal took : 46 ms
[2024-05-24 06:42:17] [INFO ] Applying decomposition
[2024-05-24 06:42:18] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10992326098444348042.txt' '-o' '/tmp/graph10992326098444348042.bin' '-w' '/tmp/graph10992326098444348042.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10992326098444348042.bin' '-l' '-1' '-v' '-w' '/tmp/graph10992326098444348042.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:42:18] [INFO ] Decomposing Gal with order
[2024-05-24 06:42:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:42:18] [INFO ] Removed a total of 2948 redundant transitions.
[2024-05-24 06:42:18] [INFO ] Flatten gal took : 134 ms
[2024-05-24 06:42:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 401 labels/synchronizations in 62 ms.
[2024-05-24 06:42:18] [INFO ] Time to serialize gal into /tmp/LTL4282939182717324258.gal : 15 ms
[2024-05-24 06:42:18] [INFO ] Time to serialize properties into /tmp/LTL13644441074190215077.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4282939182717324258.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13644441074190215077.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G("((i8.u41.p18_5_3==0)||(i7.u12.p08_4_0==1))"))||(G(F("(((i6.i3.u57.p34_1_5==0)||(u13.p10_5_3==1))||((u13.p10_5_4==0)||(i9.u44....173
Formula 0 simplified : X(F!"((i8.u41.p18_5_3==0)||(i7.u12.p08_4_0==1))" & FG!"(((i6.i3.u57.p34_1_5==0)||(u13.p10_5_3==1))||((u13.p10_5_4==0)||(i9.u44.p27_2...163
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-07-LTLCardinality-00 finished in 278100 ms.
[2024-05-24 06:42:33] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16580193501827675305
[2024-05-24 06:42:33] [INFO ] Too many transitions (1680) to apply POR reductions. Disabling POR matrices.
[2024-05-24 06:42:33] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16580193501827675305
[2024-05-24 06:42:33] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin16580193501827675305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 06:42:33] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4279920396108543471.txt' '-o' '/tmp/graph4279920396108543471.bin' '-w' '/tmp/graph4279920396108543471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4279920396108543471.bin' '-l' '-1' '-v' '-w' '/tmp/graph4279920396108543471.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:42:33] [INFO ] Decomposing Gal with order
[2024-05-24 06:42:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:42:33] [INFO ] Removed a total of 3059 redundant transitions.
[2024-05-24 06:42:33] [INFO ] Flatten gal took : 128 ms
[2024-05-24 06:42:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 395 labels/synchronizations in 46 ms.
[2024-05-24 06:42:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality6233128037289396983.gal : 43 ms
[2024-05-24 06:42:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality7738815229519381734.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6233128037289396983.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7738815229519381734.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("((i15.u114.p18_5_3==0)||(i8.u44.p08_4_0==1))"))||(G(F("(((i1.u51.p34_1_5==0)||(i5.u23.p10_5_3==1))||((i5.u31.p10_5_4==0)||(i0...177
Formula 0 simplified : X(F!"((i15.u114.p18_5_3==0)||(i8.u44.p08_4_0==1))" & FG!"(((i1.u51.p34_1_5==0)||(i5.u23.p10_5_3==1))||((i5.u31.p10_5_4==0)||(i0.u3.p...167
Compilation finished in 6960 ms.
Running link step : cd /tmp/ltsmin16580193501827675305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin16580193501827675305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 07:08:06] [INFO ] Applying decomposition
[2024-05-24 07:08:06] [INFO ] Flatten gal took : 177 ms
[2024-05-24 07:08:06] [INFO ] Decomposing Gal with order
[2024-05-24 07:08:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 07:08:07] [INFO ] Removed a total of 3372 redundant transitions.
[2024-05-24 07:08:07] [INFO ] Flatten gal took : 522 ms
[2024-05-24 07:08:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 51 ms.
[2024-05-24 07:08:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality1706759154029198745.gal : 27 ms
[2024-05-24 07:08:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality14480597078784027454.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1706759154029198745.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14480597078784027454.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G("((u8.p18_5_3==0)||(u7.p08_4_0==1))"))||(G(F("(((u1.p34_1_5==0)||(u8.p10_5_3==1))||((u8.p10_5_4==0)||(u1.p27_2==1)))"))))))
Formula 0 simplified : X(F!"((u8.p18_5_3==0)||(u7.p08_4_0==1))" & FG!"(((u1.p34_1_5==0)||(u8.p10_5_3==1))||((u8.p10_5_4==0)||(u1.p27_2==1)))")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-07"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-07, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-smll-171636266300179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-07.tgz
mv EisenbergMcGuire-PT-07 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;