About the Execution of LTSMin+red for EisenbergMcGuire-PT-07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2210.680 | 3561709.00 | 7987668.00 | 7454.50 | FFFF???FFFFFFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r492-smll-171636266300180.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is EisenbergMcGuire-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300180
=====================================================================
--------------------
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-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717227224927
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:33:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:33:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:33:48] [INFO ] Load time of PNML (sax parser for PT used): 481 ms
[2024-06-01 07:33:48] [INFO ] Transformed 553 places.
[2024-06-01 07:33:48] [INFO ] Transformed 1960 transitions.
[2024-06-01 07:33:48] [INFO ] Found NUPN structural information;
[2024-06-01 07:33:48] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 757 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 517 transition count 1708
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 517 transition count 1708
Applied a total of 72 rules in 195 ms. Remains 517 /553 variables (removed 36) and now considering 1708/1960 (removed 252) transitions.
[2024-06-01 07:33:48] [INFO ] Flow matrix only has 749 transitions (discarded 959 similar events)
// Phase 1: matrix 749 rows 517 cols
[2024-06-01 07:33:49] [INFO ] Computed 22 invariants in 47 ms
[2024-06-01 07:33:50] [INFO ] Implicit Places using invariants in 1096 ms returned []
[2024-06-01 07:33:50] [INFO ] Flow matrix only has 749 transitions (discarded 959 similar events)
[2024-06-01 07:33:50] [INFO ] Invariant cache hit.
[2024-06-01 07:33:50] [INFO ] State equation strengthened by 256 read => feed constraints.
[2024-06-01 07:33:53] [INFO ] Implicit Places using invariants and state equation in 2981 ms returned []
Implicit Place search using SMT with State Equation took 4138 ms to find 0 implicit places.
Running 1701 sub problems to find dead transitions.
[2024-06-01 07:33:53] [INFO ] Flow matrix only has 749 transitions (discarded 959 similar events)
[2024-06-01 07:33:53] [INFO ] Invariant cache hit.
[2024-06-01 07:33:53] [INFO ] State equation strengthened by 256 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/517 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1701 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/517 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1701 unsolved
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 29 places in 309 ms of which 35 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 63 places in 577 ms of which 6 ms to minimize.
[2024-06-01 07:34:24] [INFO ] Deduced a trap composed of 41 places in 454 ms of which 6 ms to minimize.
[2024-06-01 07:34:24] [INFO ] Deduced a trap composed of 63 places in 329 ms of which 5 ms to minimize.
SMT process timed out in 31621ms, After SMT, problems are : Problem set: 0 solved, 1701 unsolved
Search for dead transitions found 0 dead transitions in 31682ms
Starting structural reductions in LTL mode, iteration 1 : 517/553 places, 1708/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36079 ms. Remains : 517/553 places, 1708/1960 transitions.
Support contains 56 out of 517 places after structural reductions.
[2024-06-01 07:34:25] [INFO ] Flatten gal took : 236 ms
[2024-06-01 07:34:25] [INFO ] Flatten gal took : 138 ms
[2024-06-01 07:34:25] [INFO ] Input system was already deterministic with 1708 transitions.
Support contains 53 out of 517 places (down from 56) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 38 to 37
RANDOM walk for 40000 steps (8 resets) in 4096 ms. (9 steps per ms) remains 33/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 33/33 properties
[2024-06-01 07:34:27] [INFO ] Flow matrix only has 749 transitions (discarded 959 similar events)
[2024-06-01 07:34:27] [INFO ] Invariant cache hit.
[2024-06-01 07:34:27] [INFO ] State equation strengthened by 256 read => feed constraints.
Problem AtomicPropp21 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 32 unsolved
Problem AtomicPropp36 is UNSAT
At refinement iteration 2 (OVERLAPS) 463/512 variables, 14/15 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 2/17 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 5/517 variables, 5/22 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 749/1266 variables, 517/539 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1266 variables, 256/795 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1266 variables, 0/795 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/1266 variables, 0/795 constraints. Problems are: Problem set: 2 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1266/1266 variables, and 795 constraints, problems are : Problem set: 2 solved, 31 unsolved in 4546 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 517/517 constraints, ReadFeed: 256/256 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 31 unsolved
Problem AtomicPropp37 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 464/512 variables, 14/15 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 2/17 constraints. Problems are: Problem set: 3 solved, 30 unsolved
[2024-06-01 07:34:32] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:34:33] [INFO ] Deduced a trap composed of 3 places in 315 ms of which 4 ms to minimize.
[2024-06-01 07:34:33] [INFO ] Deduced a trap composed of 114 places in 321 ms of which 5 ms to minimize.
[2024-06-01 07:34:33] [INFO ] Deduced a trap composed of 132 places in 326 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 4/21 constraints. Problems are: Problem set: 3 solved, 30 unsolved
[2024-06-01 07:34:34] [INFO ] Deduced a trap composed of 128 places in 312 ms of which 5 ms to minimize.
[2024-06-01 07:34:35] [INFO ] Deduced a trap composed of 132 places in 315 ms of which 5 ms to minimize.
[2024-06-01 07:34:35] [INFO ] Deduced a trap composed of 103 places in 312 ms of which 5 ms to minimize.
[2024-06-01 07:34:35] [INFO ] Deduced a trap composed of 95 places in 344 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 4/25 constraints. Problems are: Problem set: 3 solved, 30 unsolved
[2024-06-01 07:34:37] [INFO ] Deduced a trap composed of 107 places in 628 ms of which 7 ms to minimize.
[2024-06-01 07:34:37] [INFO ] Deduced a trap composed of 129 places in 647 ms of which 8 ms to minimize.
SMT process timed out in 10241ms, After SMT, problems are : Problem set: 3 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 1708/1708 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 517 transition count 1703
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 512 transition count 1703
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 10 place count 512 transition count 1551
Deduced a syphon composed of 152 places in 3 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 314 place count 360 transition count 1551
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 316 place count 358 transition count 1537
Iterating global reduction 2 with 2 rules applied. Total rules applied 318 place count 358 transition count 1537
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 402 place count 316 transition count 1495
Applied a total of 402 rules in 370 ms. Remains 316 /517 variables (removed 201) and now considering 1495/1708 (removed 213) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 316/517 places, 1495/1708 transitions.
RANDOM walk for 40000 steps (8 resets) in 763 ms. (52 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 100616 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :10 out of 30
Probabilistic random walk after 100616 steps, saw 60142 distinct states, run finished after 3007 ms. (steps per millisecond=33 ) properties seen :10
[2024-06-01 07:34:41] [INFO ] Flow matrix only has 536 transitions (discarded 959 similar events)
// Phase 1: matrix 536 rows 316 cols
[2024-06-01 07:34:41] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 07:34:41] [INFO ] State equation strengthened by 244 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 275/307 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 2/309 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 7/316 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:34:42] [INFO ] Deduced a trap composed of 34 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:34:43] [INFO ] Deduced a trap composed of 38 places in 336 ms of which 6 ms to minimize.
[2024-06-01 07:34:43] [INFO ] Deduced a trap composed of 58 places in 388 ms of which 3 ms to minimize.
[2024-06-01 07:34:43] [INFO ] Deduced a trap composed of 21 places in 272 ms of which 3 ms to minimize.
[2024-06-01 07:34:43] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 536/852 variables, 316/343 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/852 variables, 244/587 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/852 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 0/852 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/852 variables, and 587 constraints, problems are : Problem set: 0 solved, 20 unsolved in 3882 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 316/316 constraints, ReadFeed: 244/244 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 275/307 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:34:46] [INFO ] Deduced a trap composed of 3 places in 452 ms of which 5 ms to minimize.
[2024-06-01 07:34:46] [INFO ] Deduced a trap composed of 83 places in 437 ms of which 5 ms to minimize.
[2024-06-01 07:34:47] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:34:47] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 2/309 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:34:47] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:34:48] [INFO ] Deduced a trap composed of 71 places in 443 ms of which 5 ms to minimize.
[2024-06-01 07:34:49] [INFO ] Deduced a trap composed of 83 places in 425 ms of which 5 ms to minimize.
[2024-06-01 07:34:49] [INFO ] Deduced a trap composed of 88 places in 462 ms of which 5 ms to minimize.
[2024-06-01 07:34:50] [INFO ] Deduced a trap composed of 99 places in 456 ms of which 5 ms to minimize.
[2024-06-01 07:34:50] [INFO ] Deduced a trap composed of 75 places in 483 ms of which 8 ms to minimize.
[2024-06-01 07:34:51] [INFO ] Deduced a trap composed of 77 places in 483 ms of which 5 ms to minimize.
[2024-06-01 07:34:51] [INFO ] Deduced a trap composed of 92 places in 446 ms of which 5 ms to minimize.
[2024-06-01 07:34:51] [INFO ] Deduced a trap composed of 75 places in 450 ms of which 5 ms to minimize.
[2024-06-01 07:34:52] [INFO ] Deduced a trap composed of 83 places in 447 ms of which 5 ms to minimize.
[2024-06-01 07:34:52] [INFO ] Deduced a trap composed of 88 places in 474 ms of which 5 ms to minimize.
[2024-06-01 07:34:53] [INFO ] Deduced a trap composed of 75 places in 465 ms of which 5 ms to minimize.
[2024-06-01 07:34:53] [INFO ] Deduced a trap composed of 91 places in 460 ms of which 5 ms to minimize.
[2024-06-01 07:34:54] [INFO ] Deduced a trap composed of 92 places in 465 ms of which 5 ms to minimize.
[2024-06-01 07:34:54] [INFO ] Deduced a trap composed of 77 places in 484 ms of which 5 ms to minimize.
[2024-06-01 07:34:55] [INFO ] Deduced a trap composed of 70 places in 485 ms of which 5 ms to minimize.
[2024-06-01 07:34:55] [INFO ] Deduced a trap composed of 69 places in 451 ms of which 6 ms to minimize.
[2024-06-01 07:34:56] [INFO ] Deduced a trap composed of 115 places in 468 ms of which 5 ms to minimize.
[2024-06-01 07:34:56] [INFO ] Deduced a trap composed of 9 places in 465 ms of which 5 ms to minimize.
[2024-06-01 07:34:57] [INFO ] Deduced a trap composed of 85 places in 476 ms of which 5 ms to minimize.
[2024-06-01 07:34:57] [INFO ] Deduced a trap composed of 140 places in 469 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:34:58] [INFO ] Deduced a trap composed of 61 places in 388 ms of which 5 ms to minimize.
[2024-06-01 07:34:58] [INFO ] Deduced a trap composed of 61 places in 397 ms of which 4 ms to minimize.
[2024-06-01 07:34:59] [INFO ] Deduced a trap composed of 100 places in 430 ms of which 5 ms to minimize.
[2024-06-01 07:34:59] [INFO ] Deduced a trap composed of 68 places in 450 ms of which 4 ms to minimize.
[2024-06-01 07:35:00] [INFO ] Deduced a trap composed of 58 places in 433 ms of which 5 ms to minimize.
[2024-06-01 07:35:00] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:35:00] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:35:00] [INFO ] Deduced a trap composed of 88 places in 430 ms of which 5 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 64 places in 369 ms of which 6 ms to minimize.
[2024-06-01 07:35:01] [INFO ] Deduced a trap composed of 99 places in 442 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 73 places in 457 ms of which 5 ms to minimize.
[2024-06-01 07:35:02] [INFO ] Deduced a trap composed of 77 places in 400 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:35:03] [INFO ] Deduced a trap composed of 49 places in 381 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 7/316 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:35:04] [INFO ] Deduced a trap composed of 3 places in 304 ms of which 5 ms to minimize.
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 4 ms to minimize.
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 4 ms to minimize.
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 3 places in 292 ms of which 4 ms to minimize.
[2024-06-01 07:35:05] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 4 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 3 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 22 places in 298 ms of which 4 ms to minimize.
[2024-06-01 07:35:06] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 4 ms to minimize.
[2024-06-01 07:35:07] [INFO ] Deduced a trap composed of 25 places in 242 ms of which 4 ms to minimize.
[2024-06-01 07:35:07] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 3 ms to minimize.
[2024-06-01 07:35:07] [INFO ] Deduced a trap composed of 62 places in 395 ms of which 5 ms to minimize.
[2024-06-01 07:35:08] [INFO ] Deduced a trap composed of 59 places in 269 ms of which 2 ms to minimize.
[2024-06-01 07:35:08] [INFO ] Deduced a trap composed of 59 places in 278 ms of which 5 ms to minimize.
[2024-06-01 07:35:08] [INFO ] Deduced a trap composed of 64 places in 349 ms of which 4 ms to minimize.
[2024-06-01 07:35:09] [INFO ] Deduced a trap composed of 62 places in 342 ms of which 4 ms to minimize.
[2024-06-01 07:35:09] [INFO ] Deduced a trap composed of 28 places in 376 ms of which 5 ms to minimize.
[2024-06-01 07:35:09] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:35:09] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:35:10] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:35:10] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/316 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:35:10] [INFO ] Deduced a trap composed of 69 places in 421 ms of which 5 ms to minimize.
[2024-06-01 07:35:11] [INFO ] Deduced a trap composed of 54 places in 401 ms of which 5 ms to minimize.
[2024-06-01 07:35:11] [INFO ] Deduced a trap composed of 72 places in 493 ms of which 5 ms to minimize.
[2024-06-01 07:35:12] [INFO ] Deduced a trap composed of 58 places in 469 ms of which 5 ms to minimize.
[2024-06-01 07:35:12] [INFO ] Deduced a trap composed of 73 places in 463 ms of which 6 ms to minimize.
[2024-06-01 07:35:13] [INFO ] Deduced a trap composed of 60 places in 468 ms of which 5 ms to minimize.
[2024-06-01 07:35:13] [INFO ] Deduced a trap composed of 64 places in 468 ms of which 6 ms to minimize.
[2024-06-01 07:35:14] [INFO ] Deduced a trap composed of 66 places in 449 ms of which 5 ms to minimize.
[2024-06-01 07:35:14] [INFO ] Deduced a trap composed of 62 places in 467 ms of which 5 ms to minimize.
[2024-06-01 07:35:15] [INFO ] Deduced a trap composed of 65 places in 406 ms of which 5 ms to minimize.
[2024-06-01 07:35:15] [INFO ] Deduced a trap composed of 48 places in 474 ms of which 5 ms to minimize.
[2024-06-01 07:35:16] [INFO ] Deduced a trap composed of 79 places in 416 ms of which 5 ms to minimize.
[2024-06-01 07:35:16] [INFO ] Deduced a trap composed of 55 places in 487 ms of which 5 ms to minimize.
[2024-06-01 07:35:17] [INFO ] Deduced a trap composed of 76 places in 436 ms of which 5 ms to minimize.
[2024-06-01 07:35:17] [INFO ] Deduced a trap composed of 47 places in 412 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/316 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:35:18] [INFO ] Deduced a trap composed of 61 places in 389 ms of which 4 ms to minimize.
[2024-06-01 07:35:18] [INFO ] Deduced a trap composed of 63 places in 349 ms of which 4 ms to minimize.
[2024-06-01 07:35:19] [INFO ] Deduced a trap composed of 82 places in 426 ms of which 5 ms to minimize.
[2024-06-01 07:35:19] [INFO ] Deduced a trap composed of 31 places in 457 ms of which 5 ms to minimize.
[2024-06-01 07:35:20] [INFO ] Deduced a trap composed of 66 places in 475 ms of which 5 ms to minimize.
[2024-06-01 07:35:20] [INFO ] Deduced a trap composed of 65 places in 477 ms of which 5 ms to minimize.
[2024-06-01 07:35:21] [INFO ] Deduced a trap composed of 17 places in 466 ms of which 5 ms to minimize.
[2024-06-01 07:35:21] [INFO ] Deduced a trap composed of 65 places in 450 ms of which 5 ms to minimize.
[2024-06-01 07:35:22] [INFO ] Deduced a trap composed of 40 places in 431 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/316 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:35:22] [INFO ] Deduced a trap composed of 65 places in 450 ms of which 4 ms to minimize.
[2024-06-01 07:35:23] [INFO ] Deduced a trap composed of 51 places in 434 ms of which 5 ms to minimize.
[2024-06-01 07:35:24] [INFO ] Deduced a trap composed of 66 places in 624 ms of which 12 ms to minimize.
[2024-06-01 07:35:24] [INFO ] Deduced a trap composed of 68 places in 497 ms of which 4 ms to minimize.
[2024-06-01 07:35:24] [INFO ] Deduced a trap composed of 66 places in 421 ms of which 5 ms to minimize.
[2024-06-01 07:35:25] [INFO ] Deduced a trap composed of 61 places in 445 ms of which 5 ms to minimize.
[2024-06-01 07:35:25] [INFO ] Deduced a trap composed of 57 places in 459 ms of which 5 ms to minimize.
[2024-06-01 07:35:26] [INFO ] Deduced a trap composed of 72 places in 398 ms of which 5 ms to minimize.
[2024-06-01 07:35:26] [INFO ] Deduced a trap composed of 73 places in 386 ms of which 5 ms to minimize.
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 81 places in 333 ms of which 4 ms to minimize.
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 73 places in 379 ms of which 5 ms to minimize.
[2024-06-01 07:35:27] [INFO ] Deduced a trap composed of 72 places in 405 ms of which 5 ms to minimize.
[2024-06-01 07:35:28] [INFO ] Deduced a trap composed of 64 places in 396 ms of which 4 ms to minimize.
[2024-06-01 07:35:28] [INFO ] Deduced a trap composed of 56 places in 419 ms of which 5 ms to minimize.
[2024-06-01 07:35:29] [INFO ] Deduced a trap composed of 51 places in 366 ms of which 5 ms to minimize.
[2024-06-01 07:35:29] [INFO ] Deduced a trap composed of 76 places in 376 ms of which 4 ms to minimize.
[2024-06-01 07:35:30] [INFO ] Deduced a trap composed of 67 places in 376 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/316 variables, 17/126 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:35:30] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:35:30] [INFO ] Deduced a trap composed of 71 places in 338 ms of which 4 ms to minimize.
SMT process timed out in 49190ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 32 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 1495/1495 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 316 transition count 1493
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 314 transition count 1493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 7 place count 311 transition count 1472
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 311 transition count 1472
Applied a total of 10 rules in 149 ms. Remains 311 /316 variables (removed 5) and now considering 1472/1495 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 311/316 places, 1472/1495 transitions.
RANDOM walk for 40000 steps (8 resets) in 921 ms. (43 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 121472 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 20
Probabilistic random walk after 121472 steps, saw 67945 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 07:35:34] [INFO ] Flow matrix only has 513 transitions (discarded 959 similar events)
// Phase 1: matrix 513 rows 311 cols
[2024-06-01 07:35:34] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 07:35:34] [INFO ] State equation strengthened by 226 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 271/303 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 8/311 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:35:35] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:35:35] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 513/824 variables, 311/335 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 226/561 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/824 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/824 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 824/824 variables, and 561 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2529 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 271/303 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:35:37] [INFO ] Deduced a trap composed of 3 places in 450 ms of which 5 ms to minimize.
[2024-06-01 07:35:38] [INFO ] Deduced a trap composed of 79 places in 346 ms of which 5 ms to minimize.
[2024-06-01 07:35:38] [INFO ] Deduced a trap composed of 84 places in 471 ms of which 5 ms to minimize.
[2024-06-01 07:35:39] [INFO ] Deduced a trap composed of 82 places in 475 ms of which 5 ms to minimize.
[2024-06-01 07:35:39] [INFO ] Deduced a trap composed of 64 places in 446 ms of which 6 ms to minimize.
[2024-06-01 07:35:40] [INFO ] Deduced a trap composed of 60 places in 405 ms of which 5 ms to minimize.
[2024-06-01 07:35:40] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:35:40] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:35:41] [INFO ] Deduced a trap composed of 74 places in 436 ms of which 5 ms to minimize.
[2024-06-01 07:35:41] [INFO ] Deduced a trap composed of 57 places in 425 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 8/311 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:35:42] [INFO ] Deduced a trap composed of 24 places in 472 ms of which 5 ms to minimize.
[2024-06-01 07:35:43] [INFO ] Deduced a trap composed of 31 places in 466 ms of which 5 ms to minimize.
[2024-06-01 07:35:43] [INFO ] Deduced a trap composed of 17 places in 438 ms of which 5 ms to minimize.
[2024-06-01 07:35:44] [INFO ] Deduced a trap composed of 59 places in 381 ms of which 5 ms to minimize.
[2024-06-01 07:35:44] [INFO ] Deduced a trap composed of 59 places in 411 ms of which 5 ms to minimize.
[2024-06-01 07:35:44] [INFO ] Deduced a trap composed of 59 places in 427 ms of which 5 ms to minimize.
[2024-06-01 07:35:45] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 3 ms to minimize.
[2024-06-01 07:35:45] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:35:45] [INFO ] Deduced a trap composed of 51 places in 442 ms of which 5 ms to minimize.
[2024-06-01 07:35:45] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:35:46] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:35:46] [INFO ] Deduced a trap composed of 15 places in 346 ms of which 4 ms to minimize.
[2024-06-01 07:35:46] [INFO ] Deduced a trap composed of 11 places in 466 ms of which 5 ms to minimize.
[2024-06-01 07:35:47] [INFO ] Deduced a trap composed of 40 places in 452 ms of which 7 ms to minimize.
[2024-06-01 07:35:47] [INFO ] Deduced a trap composed of 16 places in 303 ms of which 4 ms to minimize.
[2024-06-01 07:35:48] [INFO ] Deduced a trap composed of 10 places in 334 ms of which 4 ms to minimize.
[2024-06-01 07:35:48] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:35:48] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:35:48] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:35:48] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:35:49] [INFO ] Deduced a trap composed of 51 places in 399 ms of which 4 ms to minimize.
[2024-06-01 07:35:49] [INFO ] Deduced a trap composed of 70 places in 436 ms of which 5 ms to minimize.
[2024-06-01 07:35:50] [INFO ] Deduced a trap composed of 51 places in 439 ms of which 5 ms to minimize.
[2024-06-01 07:35:50] [INFO ] Deduced a trap composed of 60 places in 437 ms of which 5 ms to minimize.
[2024-06-01 07:35:51] [INFO ] Deduced a trap composed of 53 places in 460 ms of which 5 ms to minimize.
[2024-06-01 07:35:51] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:35:51] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:35:52] [INFO ] Deduced a trap composed of 31 places in 471 ms of which 5 ms to minimize.
[2024-06-01 07:35:52] [INFO ] Deduced a trap composed of 84 places in 445 ms of which 5 ms to minimize.
[2024-06-01 07:35:53] [INFO ] Deduced a trap composed of 68 places in 467 ms of which 5 ms to minimize.
[2024-06-01 07:35:53] [INFO ] Deduced a trap composed of 84 places in 474 ms of which 5 ms to minimize.
[2024-06-01 07:35:54] [INFO ] Deduced a trap composed of 65 places in 493 ms of which 5 ms to minimize.
[2024-06-01 07:35:54] [INFO ] Deduced a trap composed of 57 places in 466 ms of which 5 ms to minimize.
[2024-06-01 07:35:55] [INFO ] Deduced a trap composed of 39 places in 467 ms of which 5 ms to minimize.
[2024-06-01 07:35:55] [INFO ] Deduced a trap composed of 84 places in 450 ms of which 5 ms to minimize.
[2024-06-01 07:35:56] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:35:56] [INFO ] Deduced a trap composed of 76 places in 432 ms of which 5 ms to minimize.
[2024-06-01 07:35:57] [INFO ] Deduced a trap composed of 66 places in 378 ms of which 5 ms to minimize.
[2024-06-01 07:35:57] [INFO ] Deduced a trap composed of 72 places in 427 ms of which 5 ms to minimize.
[2024-06-01 07:35:57] [INFO ] Deduced a trap composed of 66 places in 419 ms of which 5 ms to minimize.
[2024-06-01 07:35:58] [INFO ] Deduced a trap composed of 45 places in 423 ms of which 5 ms to minimize.
[2024-06-01 07:35:58] [INFO ] Deduced a trap composed of 56 places in 426 ms of which 5 ms to minimize.
[2024-06-01 07:35:59] [INFO ] Deduced a trap composed of 53 places in 350 ms of which 4 ms to minimize.
[2024-06-01 07:35:59] [INFO ] Deduced a trap composed of 69 places in 392 ms of which 4 ms to minimize.
[2024-06-01 07:35:59] [INFO ] Deduced a trap composed of 63 places in 358 ms of which 5 ms to minimize.
[2024-06-01 07:36:00] [INFO ] Deduced a trap composed of 64 places in 400 ms of which 5 ms to minimize.
[2024-06-01 07:36:00] [INFO ] Deduced a trap composed of 94 places in 435 ms of which 5 ms to minimize.
[2024-06-01 07:36:01] [INFO ] Deduced a trap composed of 54 places in 414 ms of which 5 ms to minimize.
[2024-06-01 07:36:01] [INFO ] Deduced a trap composed of 80 places in 458 ms of which 5 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 54 places in 398 ms of which 5 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 60 places in 358 ms of which 4 ms to minimize.
[2024-06-01 07:36:02] [INFO ] Deduced a trap composed of 55 places in 350 ms of which 4 ms to minimize.
[2024-06-01 07:36:03] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:36:03] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:36:03] [INFO ] Deduced a trap composed of 63 places in 436 ms of which 5 ms to minimize.
[2024-06-01 07:36:04] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:36:04] [INFO ] Deduced a trap composed of 88 places in 332 ms of which 4 ms to minimize.
[2024-06-01 07:36:04] [INFO ] Deduced a trap composed of 65 places in 338 ms of which 4 ms to minimize.
[2024-06-01 07:36:05] [INFO ] Deduced a trap composed of 70 places in 353 ms of which 5 ms to minimize.
[2024-06-01 07:36:05] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:36:06] [INFO ] Deduced a trap composed of 69 places in 432 ms of which 5 ms to minimize.
[2024-06-01 07:36:06] [INFO ] Deduced a trap composed of 57 places in 436 ms of which 5 ms to minimize.
[2024-06-01 07:36:07] [INFO ] Deduced a trap composed of 59 places in 423 ms of which 5 ms to minimize.
[2024-06-01 07:36:07] [INFO ] Deduced a trap composed of 59 places in 423 ms of which 5 ms to minimize.
[2024-06-01 07:36:08] [INFO ] Deduced a trap composed of 57 places in 427 ms of which 5 ms to minimize.
[2024-06-01 07:36:08] [INFO ] Deduced a trap composed of 59 places in 436 ms of which 5 ms to minimize.
[2024-06-01 07:36:09] [INFO ] Deduced a trap composed of 50 places in 404 ms of which 5 ms to minimize.
[2024-06-01 07:36:09] [INFO ] Deduced a trap composed of 44 places in 339 ms of which 5 ms to minimize.
[2024-06-01 07:36:09] [INFO ] Deduced a trap composed of 30 places in 449 ms of which 5 ms to minimize.
[2024-06-01 07:36:10] [INFO ] Deduced a trap composed of 75 places in 460 ms of which 5 ms to minimize.
[2024-06-01 07:36:11] [INFO ] Deduced a trap composed of 56 places in 448 ms of which 4 ms to minimize.
[2024-06-01 07:36:11] [INFO ] Deduced a trap composed of 49 places in 433 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 12/106 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:36:12] [INFO ] Deduced a trap composed of 90 places in 361 ms of which 4 ms to minimize.
[2024-06-01 07:36:12] [INFO ] Deduced a trap composed of 65 places in 391 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/311 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 513/824 variables, 311/419 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/824 variables, 226/645 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/824 variables, 20/665 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:36:15] [INFO ] Deduced a trap composed of 63 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:36:15] [INFO ] Deduced a trap composed of 55 places in 369 ms of which 4 ms to minimize.
[2024-06-01 07:36:15] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:36:15] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:36:16] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:36:16] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:36:16] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/824 variables, 7/672 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/824 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 21 (OVERLAPS) 0/824 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 824/824 variables, and 672 constraints, problems are : Problem set: 0 solved, 20 unsolved in 44664 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 93/93 constraints]
After SMT, in 47239ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 1 properties in 3178 ms.
Support contains 30 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1472/1472 transitions.
Applied a total of 0 rules in 50 ms. Remains 311 /311 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 311/311 places, 1472/1472 transitions.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0&&G((p1 U p2))&&X((!p0 U (!p3||G(!p0))))))))'
Support contains 8 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 1708/1708 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 512 transition count 1673
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 512 transition count 1673
Applied a total of 10 rules in 66 ms. Remains 512 /517 variables (removed 5) and now considering 1673/1708 (removed 35) transitions.
[2024-06-01 07:36:25] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
// Phase 1: matrix 714 rows 512 cols
[2024-06-01 07:36:25] [INFO ] Computed 22 invariants in 8 ms
[2024-06-01 07:36:26] [INFO ] Implicit Places using invariants in 623 ms returned []
[2024-06-01 07:36:26] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2024-06-01 07:36:26] [INFO ] Invariant cache hit.
[2024-06-01 07:36:26] [INFO ] State equation strengthened by 226 read => feed constraints.
[2024-06-01 07:36:29] [INFO ] Implicit Places using invariants and state equation in 3410 ms returned []
Implicit Place search using SMT with State Equation took 4047 ms to find 0 implicit places.
Running 1666 sub problems to find dead transitions.
[2024-06-01 07:36:29] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2024-06-01 07:36:29] [INFO ] Invariant cache hit.
[2024-06-01 07:36:29] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
[2024-06-01 07:37:00] [INFO ] Deduced a trap composed of 63 places in 287 ms of which 5 ms to minimize.
[2024-06-01 07:37:00] [INFO ] Deduced a trap composed of 38 places in 298 ms of which 5 ms to minimize.
[2024-06-01 07:37:00] [INFO ] Deduced a trap composed of 39 places in 319 ms of which 4 ms to minimize.
[2024-06-01 07:37:01] [INFO ] Deduced a trap composed of 29 places in 533 ms of which 7 ms to minimize.
SMT process timed out in 31701ms, After SMT, problems are : Problem set: 0 solved, 1666 unsolved
Search for dead transitions found 0 dead transitions in 31736ms
Starting structural reductions in LTL mode, iteration 1 : 512/517 places, 1673/1708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35862 ms. Remains : 512/517 places, 1673/1708 transitions.
Stuttering acceptance computed with spot in 778 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (NOT p2), (NOT p2), (AND p0 p3)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-00
Product exploration explored 100000 steps with 4 reset in 810 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 2 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-00 finished in 37580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U !p1)))'
Support contains 4 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 1708/1708 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 517 transition count 1701
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 510 transition count 1701
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 510 transition count 1548
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 320 place count 357 transition count 1548
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 325 place count 352 transition count 1513
Iterating global reduction 2 with 5 rules applied. Total rules applied 330 place count 352 transition count 1513
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 414 place count 310 transition count 1471
Applied a total of 414 rules in 154 ms. Remains 310 /517 variables (removed 207) and now considering 1471/1708 (removed 237) transitions.
[2024-06-01 07:37:03] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
// Phase 1: matrix 512 rows 310 cols
[2024-06-01 07:37:03] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 07:37:03] [INFO ] Implicit Places using invariants in 558 ms returned []
[2024-06-01 07:37:03] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
[2024-06-01 07:37:03] [INFO ] Invariant cache hit.
[2024-06-01 07:37:04] [INFO ] State equation strengthened by 226 read => feed constraints.
[2024-06-01 07:37:05] [INFO ] Implicit Places using invariants and state equation in 2290 ms returned []
Implicit Place search using SMT with State Equation took 2853 ms to find 0 implicit places.
[2024-06-01 07:37:06] [INFO ] Redundant transitions in 158 ms returned []
Running 1464 sub problems to find dead transitions.
[2024-06-01 07:37:06] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
[2024-06-01 07:37:06] [INFO ] Invariant cache hit.
[2024-06-01 07:37:06] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
[2024-06-01 07:37:24] [INFO ] Deduced a trap composed of 3 places in 438 ms of which 5 ms to minimize.
[2024-06-01 07:37:24] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:37:24] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:37:25] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:37:25] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:37:25] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:37:25] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:37:25] [INFO ] Deduced a trap composed of 69 places in 291 ms of which 5 ms to minimize.
[2024-06-01 07:37:27] [INFO ] Deduced a trap composed of 53 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:37:27] [INFO ] Deduced a trap composed of 38 places in 296 ms of which 4 ms to minimize.
[2024-06-01 07:37:28] [INFO ] Deduced a trap composed of 38 places in 273 ms of which 4 ms to minimize.
[2024-06-01 07:37:28] [INFO ] Deduced a trap composed of 38 places in 273 ms of which 3 ms to minimize.
[2024-06-01 07:37:29] [INFO ] Deduced a trap composed of 60 places in 331 ms of which 4 ms to minimize.
[2024-06-01 07:37:29] [INFO ] Deduced a trap composed of 39 places in 316 ms of which 4 ms to minimize.
[2024-06-01 07:37:29] [INFO ] Deduced a trap composed of 40 places in 324 ms of which 4 ms to minimize.
[2024-06-01 07:37:30] [INFO ] Deduced a trap composed of 15 places in 342 ms of which 4 ms to minimize.
[2024-06-01 07:37:30] [INFO ] Deduced a trap composed of 39 places in 364 ms of which 4 ms to minimize.
[2024-06-01 07:37:30] [INFO ] Deduced a trap composed of 56 places in 339 ms of which 5 ms to minimize.
[2024-06-01 07:37:31] [INFO ] Deduced a trap composed of 53 places in 352 ms of which 5 ms to minimize.
[2024-06-01 07:37:31] [INFO ] Deduced a trap composed of 44 places in 355 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, 1464 unsolved
[2024-06-01 07:37:32] [INFO ] Deduced a trap composed of 46 places in 291 ms of which 5 ms to minimize.
[2024-06-01 07:37:33] [INFO ] Deduced a trap composed of 26 places in 340 ms of which 4 ms to minimize.
[2024-06-01 07:37:34] [INFO ] Deduced a trap composed of 59 places in 307 ms of which 4 ms to minimize.
[2024-06-01 07:37:35] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:37:35] [INFO ] Deduced a trap composed of 54 places in 296 ms of which 3 ms to minimize.
[2024-06-01 07:37:36] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 2 ms to minimize.
[2024-06-01 07:37:36] [INFO ] Deduced a trap composed of 18 places in 358 ms of which 5 ms to minimize.
[2024-06-01 07:37:36] [INFO ] Deduced a trap composed of 15 places in 345 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/822 variables, and 50 constraints, problems are : Problem set: 0 solved, 1464 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/310 constraints, ReadFeed: 0/226 constraints, PredecessorRefiner: 1464/1464 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 28/50 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
[2024-06-01 07:37:43] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:37:43] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 3 ms to minimize.
[2024-06-01 07:37:46] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 3 ms to minimize.
[2024-06-01 07:37:53] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:37:57] [INFO ] Deduced a trap composed of 17 places in 438 ms of which 6 ms to minimize.
[2024-06-01 07:37:57] [INFO ] Deduced a trap composed of 19 places in 446 ms of which 5 ms to minimize.
[2024-06-01 07:37:58] [INFO ] Deduced a trap composed of 21 places in 435 ms of which 4 ms to minimize.
[2024-06-01 07:37:58] [INFO ] Deduced a trap composed of 21 places in 395 ms of which 5 ms to minimize.
[2024-06-01 07:37:59] [INFO ] Deduced a trap composed of 20 places in 360 ms of which 4 ms to minimize.
[2024-06-01 07:37:59] [INFO ] Deduced a trap composed of 19 places in 399 ms of which 4 ms to minimize.
[2024-06-01 07:37:59] [INFO ] Deduced a trap composed of 67 places in 377 ms of which 5 ms to minimize.
[2024-06-01 07:38:00] [INFO ] Deduced a trap composed of 17 places in 390 ms of which 5 ms to minimize.
[2024-06-01 07:38:00] [INFO ] Deduced a trap composed of 23 places in 429 ms of which 5 ms to minimize.
[2024-06-01 07:38:01] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:38:01] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 2 ms to minimize.
[2024-06-01 07:38:01] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2024-06-01 07:38:01] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:38:01] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:38:01] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:38:02] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/822 variables, and 70 constraints, problems are : Problem set: 0 solved, 1464 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/310 constraints, ReadFeed: 0/226 constraints, PredecessorRefiner: 0/1464 constraints, Known Traps: 48/48 constraints]
After SMT, in 61320ms problems are : Problem set: 0 solved, 1464 unsolved
Search for dead transitions found 0 dead transitions in 61351ms
Starting structural reductions in SI_LTL mode, iteration 1 : 310/517 places, 1471/1708 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64533 ms. Remains : 310/517 places, 1471/1708 transitions.
Stuttering acceptance computed with spot in 136 ms :[p1, true, p1]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-02
Entered a terminal (fully accepting) state of product in 589 steps with 0 reset in 3 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-02 finished in 64693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 6 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 1708/1708 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 511 transition count 1666
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 511 transition count 1666
Applied a total of 12 rules in 29 ms. Remains 511 /517 variables (removed 6) and now considering 1666/1708 (removed 42) transitions.
[2024-06-01 07:38:07] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2024-06-01 07:38:07] [INFO ] Computed 22 invariants in 14 ms
[2024-06-01 07:38:08] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-06-01 07:38:08] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:38:08] [INFO ] Invariant cache hit.
[2024-06-01 07:38:08] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:38:11] [INFO ] Implicit Places using invariants and state equation in 3226 ms returned []
Implicit Place search using SMT with State Equation took 3936 ms to find 0 implicit places.
Running 1659 sub problems to find dead transitions.
[2024-06-01 07:38:11] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:38:11] [INFO ] Invariant cache hit.
[2024-06-01 07:38:11] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:38:35] [INFO ] Deduced a trap composed of 63 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:38:35] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:38:35] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:38:36] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 3 ms to minimize.
[2024-06-01 07:38:36] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 3 ms to minimize.
[2024-06-01 07:38:36] [INFO ] Deduced a trap composed of 23 places in 352 ms of which 4 ms to minimize.
[2024-06-01 07:38:36] [INFO ] Deduced a trap composed of 32 places in 326 ms of which 4 ms to minimize.
[2024-06-01 07:38:37] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:38:37] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:38:37] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:38:37] [INFO ] Deduced a trap composed of 89 places in 234 ms of which 3 ms to minimize.
[2024-06-01 07:38:37] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:38:39] [INFO ] Deduced a trap composed of 52 places in 387 ms of which 4 ms to minimize.
[2024-06-01 07:38:39] [INFO ] Deduced a trap composed of 74 places in 362 ms of which 5 ms to minimize.
[2024-06-01 07:38:40] [INFO ] Deduced a trap composed of 143 places in 384 ms of which 4 ms to minimize.
[2024-06-01 07:38:40] [INFO ] Deduced a trap composed of 122 places in 338 ms of which 5 ms to minimize.
[2024-06-01 07:38:41] [INFO ] Deduced a trap composed of 129 places in 343 ms of which 5 ms to minimize.
[2024-06-01 07:38:41] [INFO ] Deduced a trap composed of 121 places in 346 ms of which 4 ms to minimize.
[2024-06-01 07:38:41] [INFO ] Deduced a trap composed of 116 places in 361 ms of which 4 ms to minimize.
[2024-06-01 07:38:42] [INFO ] Deduced a trap composed of 89 places in 323 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/1218 variables, and 42 constraints, problems are : Problem set: 0 solved, 1659 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/511 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1659/1659 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:38:45] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:38:45] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:38:45] [INFO ] Deduced a trap composed of 67 places in 302 ms of which 4 ms to minimize.
[2024-06-01 07:38:46] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:38:47] [INFO ] Deduced a trap composed of 78 places in 372 ms of which 4 ms to minimize.
[2024-06-01 07:38:48] [INFO ] Deduced a trap composed of 94 places in 363 ms of which 4 ms to minimize.
[2024-06-01 07:38:48] [INFO ] Deduced a trap composed of 79 places in 367 ms of which 5 ms to minimize.
[2024-06-01 07:38:49] [INFO ] Deduced a trap composed of 98 places in 321 ms of which 4 ms to minimize.
[2024-06-01 07:38:49] [INFO ] Deduced a trap composed of 88 places in 313 ms of which 4 ms to minimize.
[2024-06-01 07:38:49] [INFO ] Deduced a trap composed of 90 places in 315 ms of which 4 ms to minimize.
[2024-06-01 07:38:50] [INFO ] Deduced a trap composed of 91 places in 319 ms of which 4 ms to minimize.
[2024-06-01 07:38:50] [INFO ] Deduced a trap composed of 65 places in 312 ms of which 4 ms to minimize.
[2024-06-01 07:38:50] [INFO ] Deduced a trap composed of 78 places in 306 ms of which 4 ms to minimize.
[2024-06-01 07:38:51] [INFO ] Deduced a trap composed of 74 places in 329 ms of which 4 ms to minimize.
[2024-06-01 07:38:51] [INFO ] Deduced a trap composed of 84 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:38:51] [INFO ] Deduced a trap composed of 103 places in 315 ms of which 4 ms to minimize.
[2024-06-01 07:38:52] [INFO ] Deduced a trap composed of 55 places in 305 ms of which 4 ms to minimize.
[2024-06-01 07:38:52] [INFO ] Deduced a trap composed of 63 places in 326 ms of which 4 ms to minimize.
[2024-06-01 07:38:52] [INFO ] Deduced a trap composed of 76 places in 272 ms of which 4 ms to minimize.
[2024-06-01 07:38:53] [INFO ] Deduced a trap composed of 73 places in 313 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:38:53] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:38:53] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:38:54] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:38:54] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:38:56] [INFO ] Deduced a trap composed of 100 places in 425 ms of which 5 ms to minimize.
[2024-06-01 07:38:56] [INFO ] Deduced a trap composed of 130 places in 334 ms of which 4 ms to minimize.
[2024-06-01 07:38:56] [INFO ] Deduced a trap composed of 154 places in 314 ms of which 4 ms to minimize.
[2024-06-01 07:38:57] [INFO ] Deduced a trap composed of 102 places in 331 ms of which 4 ms to minimize.
[2024-06-01 07:38:57] [INFO ] Deduced a trap composed of 110 places in 274 ms of which 3 ms to minimize.
[2024-06-01 07:38:57] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:38:58] [INFO ] Deduced a trap composed of 79 places in 257 ms of which 3 ms to minimize.
[2024-06-01 07:38:58] [INFO ] Deduced a trap composed of 117 places in 251 ms of which 4 ms to minimize.
[2024-06-01 07:38:58] [INFO ] Deduced a trap composed of 115 places in 237 ms of which 3 ms to minimize.
[2024-06-01 07:38:58] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:38:59] [INFO ] Deduced a trap composed of 101 places in 352 ms of which 4 ms to minimize.
[2024-06-01 07:38:59] [INFO ] Deduced a trap composed of 164 places in 358 ms of which 4 ms to minimize.
[2024-06-01 07:38:59] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:38:59] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:39:00] [INFO ] Deduced a trap composed of 133 places in 363 ms of which 4 ms to minimize.
[2024-06-01 07:39:00] [INFO ] Deduced a trap composed of 32 places in 356 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:39:01] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:39:03] [INFO ] Deduced a trap composed of 79 places in 358 ms of which 4 ms to minimize.
[2024-06-01 07:39:03] [INFO ] Deduced a trap composed of 72 places in 337 ms of which 4 ms to minimize.
[2024-06-01 07:39:04] [INFO ] Deduced a trap composed of 120 places in 422 ms of which 4 ms to minimize.
[2024-06-01 07:39:04] [INFO ] Deduced a trap composed of 125 places in 413 ms of which 5 ms to minimize.
[2024-06-01 07:39:05] [INFO ] Deduced a trap composed of 20 places in 411 ms of which 5 ms to minimize.
[2024-06-01 07:39:06] [INFO ] Deduced a trap composed of 20 places in 422 ms of which 5 ms to minimize.
[2024-06-01 07:39:07] [INFO ] Deduced a trap composed of 122 places in 364 ms of which 5 ms to minimize.
[2024-06-01 07:39:07] [INFO ] Deduced a trap composed of 94 places in 358 ms of which 4 ms to minimize.
[2024-06-01 07:39:07] [INFO ] Deduced a trap composed of 31 places in 350 ms of which 5 ms to minimize.
[2024-06-01 07:39:08] [INFO ] Deduced a trap composed of 100 places in 347 ms of which 4 ms to minimize.
[2024-06-01 07:39:08] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:39:09] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:39:09] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:39:10] [INFO ] Deduced a trap composed of 127 places in 450 ms of which 5 ms to minimize.
[2024-06-01 07:39:11] [INFO ] Deduced a trap composed of 176 places in 466 ms of which 5 ms to minimize.
[2024-06-01 07:39:11] [INFO ] Deduced a trap composed of 112 places in 469 ms of which 6 ms to minimize.
[2024-06-01 07:39:12] [INFO ] Deduced a trap composed of 45 places in 446 ms of which 5 ms to minimize.
[2024-06-01 07:39:12] [INFO ] Deduced a trap composed of 68 places in 443 ms of which 5 ms to minimize.
[2024-06-01 07:39:12] [INFO ] Deduced a trap composed of 124 places in 338 ms of which 5 ms to minimize.
SMT process timed out in 61323ms, After SMT, problems are : Problem set: 0 solved, 1659 unsolved
Search for dead transitions found 0 dead transitions in 61353ms
Starting structural reductions in LTL mode, iteration 1 : 511/517 places, 1666/1708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65325 ms. Remains : 511/517 places, 1666/1708 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-03 finished in 65489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||G((X(p2)||p1)))))))'
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 1708/1708 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 511 transition count 1666
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 511 transition count 1666
Applied a total of 12 rules in 18 ms. Remains 511 /517 variables (removed 6) and now considering 1666/1708 (removed 42) transitions.
[2024-06-01 07:39:13] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:39:13] [INFO ] Invariant cache hit.
[2024-06-01 07:39:13] [INFO ] Implicit Places using invariants in 555 ms returned []
[2024-06-01 07:39:13] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:39:13] [INFO ] Invariant cache hit.
[2024-06-01 07:39:14] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:39:15] [INFO ] Implicit Places using invariants and state equation in 2310 ms returned []
Implicit Place search using SMT with State Equation took 2868 ms to find 0 implicit places.
Running 1659 sub problems to find dead transitions.
[2024-06-01 07:39:15] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:39:15] [INFO ] Invariant cache hit.
[2024-06-01 07:39:16] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:39:35] [INFO ] Deduced a trap composed of 63 places in 274 ms of which 3 ms to minimize.
[2024-06-01 07:39:36] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:39:36] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:39:36] [INFO ] Deduced a trap composed of 38 places in 246 ms of which 4 ms to minimize.
[2024-06-01 07:39:36] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 4 ms to minimize.
[2024-06-01 07:39:37] [INFO ] Deduced a trap composed of 23 places in 374 ms of which 4 ms to minimize.
[2024-06-01 07:39:37] [INFO ] Deduced a trap composed of 32 places in 372 ms of which 4 ms to minimize.
[2024-06-01 07:39:37] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:39:37] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:39:38] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:39:38] [INFO ] Deduced a trap composed of 89 places in 259 ms of which 4 ms to minimize.
[2024-06-01 07:39:38] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:39:40] [INFO ] Deduced a trap composed of 52 places in 441 ms of which 5 ms to minimize.
[2024-06-01 07:39:40] [INFO ] Deduced a trap composed of 74 places in 406 ms of which 5 ms to minimize.
[2024-06-01 07:39:41] [INFO ] Deduced a trap composed of 143 places in 430 ms of which 4 ms to minimize.
[2024-06-01 07:39:41] [INFO ] Deduced a trap composed of 122 places in 368 ms of which 4 ms to minimize.
[2024-06-01 07:39:42] [INFO ] Deduced a trap composed of 129 places in 382 ms of which 4 ms to minimize.
[2024-06-01 07:39:42] [INFO ] Deduced a trap composed of 121 places in 385 ms of which 4 ms to minimize.
[2024-06-01 07:39:42] [INFO ] Deduced a trap composed of 116 places in 367 ms of which 4 ms to minimize.
[2024-06-01 07:39:43] [INFO ] Deduced a trap composed of 89 places in 349 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:39:44] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:39:44] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 4 ms to minimize.
[2024-06-01 07:39:44] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:39:44] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:39:45] [INFO ] Deduced a trap composed of 61 places in 277 ms of which 4 ms to minimize.
[2024-06-01 07:39:45] [INFO ] Deduced a trap composed of 67 places in 283 ms of which 6 ms to minimize.
[2024-06-01 07:39:45] [INFO ] Deduced a trap composed of 79 places in 389 ms of which 6 ms to minimize.
[2024-06-01 07:39:46] [INFO ] Deduced a trap composed of 67 places in 297 ms of which 4 ms to minimize.
[2024-06-01 07:39:46] [INFO ] Deduced a trap composed of 59 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:39:46] [INFO ] Deduced a trap composed of 69 places in 292 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/1218 variables, and 52 constraints, problems are : Problem set: 0 solved, 1659 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/511 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1659/1659 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 30/52 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:39:52] [INFO ] Deduced a trap composed of 79 places in 345 ms of which 5 ms to minimize.
[2024-06-01 07:39:53] [INFO ] Deduced a trap composed of 67 places in 321 ms of which 4 ms to minimize.
[2024-06-01 07:39:53] [INFO ] Deduced a trap composed of 74 places in 224 ms of which 4 ms to minimize.
[2024-06-01 07:39:53] [INFO ] Deduced a trap composed of 88 places in 331 ms of which 5 ms to minimize.
[2024-06-01 07:39:54] [INFO ] Deduced a trap composed of 80 places in 323 ms of which 4 ms to minimize.
[2024-06-01 07:39:54] [INFO ] Deduced a trap composed of 86 places in 327 ms of which 4 ms to minimize.
[2024-06-01 07:39:54] [INFO ] Deduced a trap composed of 84 places in 340 ms of which 5 ms to minimize.
[2024-06-01 07:39:55] [INFO ] Deduced a trap composed of 77 places in 327 ms of which 4 ms to minimize.
[2024-06-01 07:39:55] [INFO ] Deduced a trap composed of 74 places in 318 ms of which 4 ms to minimize.
[2024-06-01 07:39:55] [INFO ] Deduced a trap composed of 70 places in 300 ms of which 4 ms to minimize.
[2024-06-01 07:39:56] [INFO ] Deduced a trap composed of 67 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:39:56] [INFO ] Deduced a trap composed of 71 places in 315 ms of which 6 ms to minimize.
[2024-06-01 07:39:56] [INFO ] Deduced a trap composed of 73 places in 437 ms of which 4 ms to minimize.
[2024-06-01 07:39:57] [INFO ] Deduced a trap composed of 59 places in 350 ms of which 4 ms to minimize.
[2024-06-01 07:39:57] [INFO ] Deduced a trap composed of 71 places in 280 ms of which 4 ms to minimize.
[2024-06-01 07:39:57] [INFO ] Deduced a trap composed of 72 places in 279 ms of which 4 ms to minimize.
[2024-06-01 07:39:58] [INFO ] Deduced a trap composed of 62 places in 284 ms of which 4 ms to minimize.
[2024-06-01 07:39:58] [INFO ] Deduced a trap composed of 82 places in 333 ms of which 5 ms to minimize.
[2024-06-01 07:39:58] [INFO ] Deduced a trap composed of 87 places in 337 ms of which 4 ms to minimize.
[2024-06-01 07:39:59] [INFO ] Deduced a trap composed of 59 places in 338 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:40:00] [INFO ] Deduced a trap composed of 90 places in 319 ms of which 5 ms to minimize.
[2024-06-01 07:40:00] [INFO ] Deduced a trap composed of 90 places in 286 ms of which 4 ms to minimize.
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 91 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 91 places in 259 ms of which 4 ms to minimize.
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 82 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 97 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:40:03] [INFO ] Deduced a trap composed of 100 places in 450 ms of which 5 ms to minimize.
[2024-06-01 07:40:04] [INFO ] Deduced a trap composed of 135 places in 387 ms of which 5 ms to minimize.
[2024-06-01 07:40:04] [INFO ] Deduced a trap composed of 127 places in 364 ms of which 4 ms to minimize.
[2024-06-01 07:40:05] [INFO ] Deduced a trap composed of 129 places in 419 ms of which 5 ms to minimize.
[2024-06-01 07:40:05] [INFO ] Deduced a trap composed of 106 places in 362 ms of which 5 ms to minimize.
[2024-06-01 07:40:05] [INFO ] Deduced a trap composed of 86 places in 314 ms of which 4 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 107 places in 329 ms of which 4 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 3 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 121 places in 277 ms of which 4 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 84 places in 337 ms of which 5 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 122 places in 337 ms of which 4 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 113 places in 308 ms of which 4 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 73 places in 267 ms of which 5 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 82 places in 296 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:40:10] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:40:12] [INFO ] Deduced a trap composed of 90 places in 313 ms of which 4 ms to minimize.
[2024-06-01 07:40:12] [INFO ] Deduced a trap composed of 94 places in 323 ms of which 4 ms to minimize.
[2024-06-01 07:40:12] [INFO ] Deduced a trap composed of 92 places in 318 ms of which 5 ms to minimize.
[2024-06-01 07:40:13] [INFO ] Deduced a trap composed of 110 places in 342 ms of which 4 ms to minimize.
[2024-06-01 07:40:13] [INFO ] Deduced a trap composed of 85 places in 323 ms of which 4 ms to minimize.
[2024-06-01 07:40:14] [INFO ] Deduced a trap composed of 91 places in 316 ms of which 4 ms to minimize.
[2024-06-01 07:40:15] [INFO ] Deduced a trap composed of 36 places in 313 ms of which 4 ms to minimize.
[2024-06-01 07:40:15] [INFO ] Deduced a trap composed of 90 places in 296 ms of which 4 ms to minimize.
[2024-06-01 07:40:16] [INFO ] Deduced a trap composed of 49 places in 311 ms of which 4 ms to minimize.
[2024-06-01 07:40:16] [INFO ] Deduced a trap composed of 102 places in 318 ms of which 4 ms to minimize.
SMT process timed out in 60981ms, After SMT, problems are : Problem set: 0 solved, 1659 unsolved
Search for dead transitions found 0 dead transitions in 61001ms
Starting structural reductions in LTL mode, iteration 1 : 511/517 places, 1666/1708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63891 ms. Remains : 511/517 places, 1666/1708 transitions.
Stuttering acceptance computed with spot in 317 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 313 ms.
Product exploration explored 100000 steps with 0 reset in 485 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 522 ms. (76 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 105968 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 15
Probabilistic random walk after 105968 steps, saw 75001 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
[2024-06-01 07:40:22] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:40:22] [INFO ] Invariant cache hit.
[2024-06-01 07:40:22] [INFO ] State equation strengthened by 220 read => feed constraints.
Problem apf7 is UNSAT
Problem apf8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Problem apf6 is UNSAT
Problem apf12 is UNSAT
At refinement iteration 1 (OVERLAPS) 191/196 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 21/217 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 6/223 variables, 3/10 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 351/574 variables, 223/233 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 49/282 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/282 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 80/654 variables, 36/318 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/654 variables, 20/338 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/654 variables, 0/338 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 244/898 variables, 8/346 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/898 variables, 0/346 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 8/906 variables, 4/350 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/906 variables, 0/350 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 312/1218 variables, 252/602 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1218 variables, 151/753 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1218 variables, 0/753 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 0/1218 variables, 0/753 constraints. Problems are: Problem set: 4 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1218/1218 variables, and 753 constraints, problems are : Problem set: 4 solved, 11 unsolved in 1923 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 511/511 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Problem apf3 is UNSAT
Problem apf11 is UNSAT
At refinement iteration 1 (OVERLAPS) 191/196 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 21/217 variables, 1/7 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 6/223 variables, 3/10 constraints. Problems are: Problem set: 6 solved, 9 unsolved
[2024-06-01 07:40:24] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 1/11 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/11 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 351/574 variables, 223/234 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 49/283 constraints. Problems are: Problem set: 6 solved, 9 unsolved
[2024-06-01 07:40:24] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 1/284 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/284 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 80/654 variables, 36/320 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/654 variables, 20/340 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/654 variables, 0/340 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 244/898 variables, 8/348 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/898 variables, 0/348 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 8/906 variables, 4/352 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/906 variables, 9/361 constraints. Problems are: Problem set: 6 solved, 9 unsolved
[2024-06-01 07:40:25] [INFO ] Deduced a trap composed of 3 places in 343 ms of which 4 ms to minimize.
[2024-06-01 07:40:25] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:40:26] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:40:26] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:40:26] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:40:26] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:40:26] [INFO ] Deduced a trap composed of 50 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:40:26] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 6 ms to minimize.
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/906 variables, 12/373 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/906 variables, 0/373 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 312/1218 variables, 252/625 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1218 variables, 151/776 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1218 variables, 0/776 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 0/1218 variables, 0/776 constraints. Problems are: Problem set: 6 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1218/1218 variables, and 776 constraints, problems are : Problem set: 6 solved, 9 unsolved in 4846 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 511/511 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 9/15 constraints, Known Traps: 14/14 constraints]
After SMT, in 6821ms problems are : Problem set: 6 solved, 9 unsolved
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 7 properties in 486 ms.
Support contains 5 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1666/1666 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 511 transition count 1659
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 504 transition count 1659
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 504 transition count 1505
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 350 transition count 1505
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 308 transition count 1463
Applied a total of 406 rules in 93 ms. Remains 308 /511 variables (removed 203) and now considering 1463/1666 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 308/511 places, 1463/1666 transitions.
RANDOM walk for 40000 steps (8 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 243544 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 2
Probabilistic random walk after 243544 steps, saw 117465 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2024-06-01 07:40:32] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 07:40:32] [INFO ] Computed 22 invariants in 7 ms
[2024-06-01 07:40:32] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 117/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/130 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/136 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 264/400 variables, 136/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 49/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 80/480 variables, 36/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 24/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 128/608 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/608 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/616 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/616 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 196/812 variables, 136/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/812 variables, 147/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 2 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 117/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/130 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/136 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:40:33] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 264/400 variables, 136/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 49/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 80/480 variables, 36/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 24/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/480 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 128/608 variables, 8/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/608 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/616 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/616 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:40:33] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:40:33] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 3 ms to minimize.
[2024-06-01 07:40:34] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:40:34] [INFO ] Deduced a trap composed of 45 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:40:34] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:40:34] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:40:34] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:40:35] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:40:35] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:40:35] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:40:35] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:40:35] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/616 variables, 12/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/616 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 196/812 variables, 136/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 147/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 565 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2512 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 2990ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 652 ms.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 42 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 38 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 07:40:36] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:40:36] [INFO ] Invariant cache hit.
[2024-06-01 07:40:36] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-06-01 07:40:36] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:40:36] [INFO ] Invariant cache hit.
[2024-06-01 07:40:37] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:40:38] [INFO ] Implicit Places using invariants and state equation in 1491 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2024-06-01 07:40:38] [INFO ] Redundant transitions in 97 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:40:38] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:40:38] [INFO ] Invariant cache hit.
[2024-06-01 07:40:38] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:40:50] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 3 ms to minimize.
[2024-06-01 07:40:50] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:40:50] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:40:51] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:40:51] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:40:51] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:40:51] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:40:51] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:40:52] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:40:52] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:40:52] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:40:52] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:40:53] [INFO ] Deduced a trap composed of 64 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:40:53] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:40:53] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:40:53] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:40:54] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 2 ms to minimize.
[2024-06-01 07:40:54] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:40:54] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:40:54] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:40:56] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:40:56] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:40:57] [INFO ] Deduced a trap composed of 53 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:40:57] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:40:58] [INFO ] Deduced a trap composed of 47 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:40:58] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:40:58] [INFO ] Deduced a trap composed of 29 places in 232 ms of which 3 ms to minimize.
[2024-06-01 07:40:58] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:40:58] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 2 ms to minimize.
[2024-06-01 07:40:59] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:40:59] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 3 ms to minimize.
[2024-06-01 07:40:59] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:40:59] [INFO ] Deduced a trap composed of 60 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:41:00] [INFO ] Deduced a trap composed of 57 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:41:00] [INFO ] Deduced a trap composed of 55 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:41:00] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:41:00] [INFO ] Deduced a trap composed of 55 places in 238 ms of which 3 ms to minimize.
[2024-06-01 07:41:00] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:41:01] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 3 ms to minimize.
[2024-06-01 07:41:01] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 62 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:41:13] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:41:13] [INFO ] Deduced a trap composed of 51 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:41:13] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:41:14] [INFO ] Deduced a trap composed of 68 places in 192 ms of which 2 ms to minimize.
[2024-06-01 07:41:14] [INFO ] Deduced a trap composed of 82 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:41:14] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:41:15] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:41:15] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:41:15] [INFO ] Deduced a trap composed of 53 places in 210 ms of which 3 ms to minimize.
[2024-06-01 07:41:15] [INFO ] Deduced a trap composed of 54 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:41:16] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:41:16] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:41:16] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:41:16] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 2 ms to minimize.
[2024-06-01 07:41:17] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:41:17] [INFO ] Deduced a trap composed of 85 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:41:17] [INFO ] Deduced a trap composed of 67 places in 211 ms of which 2 ms to minimize.
[2024-06-01 07:41:17] [INFO ] Deduced a trap composed of 90 places in 185 ms of which 2 ms to minimize.
[2024-06-01 07:41:17] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:41:18] [INFO ] Deduced a trap composed of 61 places in 216 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:41:20] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:41:20] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:41:21] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:41:21] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:41:21] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:41:22] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:41:22] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 3 ms to minimize.
[2024-06-01 07:41:22] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 2 ms to minimize.
[2024-06-01 07:41:23] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 2 ms to minimize.
[2024-06-01 07:41:23] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 2 ms to minimize.
[2024-06-01 07:41:23] [INFO ] Deduced a trap composed of 63 places in 190 ms of which 2 ms to minimize.
[2024-06-01 07:41:23] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:41:24] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:41:24] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:41:24] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:41:24] [INFO ] Deduced a trap composed of 54 places in 185 ms of which 2 ms to minimize.
[2024-06-01 07:41:24] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:41:25] [INFO ] Deduced a trap composed of 60 places in 209 ms of which 3 ms to minimize.
[2024-06-01 07:41:25] [INFO ] Deduced a trap composed of 55 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:41:25] [INFO ] Deduced a trap composed of 52 places in 196 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:41:30] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:41:32] [INFO ] Deduced a trap composed of 73 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:41:32] [INFO ] Deduced a trap composed of 53 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:41:33] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:41:33] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:41:33] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:41:34] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:41:35] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 2 ms to minimize.
[2024-06-01 07:41:35] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 3 ms to minimize.
[2024-06-01 07:41:35] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 3 ms to minimize.
[2024-06-01 07:41:35] [INFO ] Deduced a trap composed of 74 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:41:35] [INFO ] Deduced a trap composed of 74 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:41:36] [INFO ] Deduced a trap composed of 53 places in 253 ms of which 3 ms to minimize.
[2024-06-01 07:41:36] [INFO ] Deduced a trap composed of 66 places in 222 ms of which 2 ms to minimize.
[2024-06-01 07:41:36] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:41:37] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:41:37] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:41:38] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:41:38] [INFO ] Deduced a trap composed of 43 places in 277 ms of which 3 ms to minimize.
[2024-06-01 07:41:38] [INFO ] Deduced a trap composed of 49 places in 261 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 122 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 100/100 constraints]
After SMT, in 60985ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 61002ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63142 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1324 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 4 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
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 324 place count 101 transition count 220
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 363 place count 101 transition count 181
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 375 place count 95 transition count 181
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 381 place count 95 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 388 place count 95 transition count 168
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 431 place count 95 transition count 125
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 474 place count 52 transition count 125
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 481 place count 52 transition count 125
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 482 place count 52 transition count 125
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 483 place count 52 transition count 124
Applied a total of 483 rules in 62 ms. Remains 52 /308 variables (removed 256) and now considering 124/1463 (removed 1339) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 124 rows 52 cols
[2024-06-01 07:41:39] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 07:41:39] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 07:41:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-06-01 07:41:39] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 07:41:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:41:39] [INFO ] After 30ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 07:41:39] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:41:39] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:41:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2024-06-01 07:41:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:41:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
TRAPS : Iteration 1
[2024-06-01 07:41:39] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 07:41:39] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 499 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR (NOT p0) p1 (NOT p2))), (G (OR p0 p2)), (G (OR p0 p1 (NOT p2))), (G (OR p1 (NOT p2))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 346 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[true, (NOT p2), false, p2, (AND (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 293 ms :[true, (NOT p2), false, p2, (AND (NOT p1) (NOT p2)), false, false, false, false]
Support contains 5 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 1666/1666 transitions.
Applied a total of 0 rules in 20 ms. Remains 511 /511 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2024-06-01 07:41:40] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2024-06-01 07:41:40] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:41:41] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-06-01 07:41:41] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:41:41] [INFO ] Invariant cache hit.
[2024-06-01 07:41:41] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:41:43] [INFO ] Implicit Places using invariants and state equation in 2413 ms returned []
Implicit Place search using SMT with State Equation took 2939 ms to find 0 implicit places.
Running 1659 sub problems to find dead transitions.
[2024-06-01 07:41:43] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:41:43] [INFO ] Invariant cache hit.
[2024-06-01 07:41:43] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:42:03] [INFO ] Deduced a trap composed of 63 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:42:03] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:42:03] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 3 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 38 places in 262 ms of which 4 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 3 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 23 places in 415 ms of which 5 ms to minimize.
[2024-06-01 07:42:05] [INFO ] Deduced a trap composed of 32 places in 368 ms of which 4 ms to minimize.
[2024-06-01 07:42:05] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:42:05] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:42:05] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 89 places in 260 ms of which 4 ms to minimize.
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:42:07] [INFO ] Deduced a trap composed of 52 places in 449 ms of which 6 ms to minimize.
[2024-06-01 07:42:08] [INFO ] Deduced a trap composed of 74 places in 396 ms of which 4 ms to minimize.
[2024-06-01 07:42:08] [INFO ] Deduced a trap composed of 143 places in 425 ms of which 5 ms to minimize.
[2024-06-01 07:42:09] [INFO ] Deduced a trap composed of 122 places in 374 ms of which 5 ms to minimize.
[2024-06-01 07:42:09] [INFO ] Deduced a trap composed of 129 places in 367 ms of which 4 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 121 places in 368 ms of which 5 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 116 places in 378 ms of which 5 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 89 places in 347 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:42:11] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:42:11] [INFO ] Deduced a trap composed of 67 places in 290 ms of which 4 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 61 places in 274 ms of which 4 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 67 places in 276 ms of which 3 ms to minimize.
[2024-06-01 07:42:13] [INFO ] Deduced a trap composed of 79 places in 245 ms of which 3 ms to minimize.
[2024-06-01 07:42:13] [INFO ] Deduced a trap composed of 67 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:42:13] [INFO ] Deduced a trap composed of 59 places in 280 ms of which 5 ms to minimize.
[2024-06-01 07:42:14] [INFO ] Deduced a trap composed of 69 places in 305 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 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 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/1218 variables, and 52 constraints, problems are : Problem set: 0 solved, 1659 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/511 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1659/1659 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 30/52 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:42:20] [INFO ] Deduced a trap composed of 79 places in 331 ms of which 4 ms to minimize.
[2024-06-01 07:42:20] [INFO ] Deduced a trap composed of 67 places in 333 ms of which 5 ms to minimize.
[2024-06-01 07:42:21] [INFO ] Deduced a trap composed of 74 places in 295 ms of which 4 ms to minimize.
[2024-06-01 07:42:21] [INFO ] Deduced a trap composed of 88 places in 335 ms of which 4 ms to minimize.
[2024-06-01 07:42:21] [INFO ] Deduced a trap composed of 80 places in 332 ms of which 5 ms to minimize.
[2024-06-01 07:42:22] [INFO ] Deduced a trap composed of 86 places in 325 ms of which 4 ms to minimize.
[2024-06-01 07:42:22] [INFO ] Deduced a trap composed of 84 places in 331 ms of which 4 ms to minimize.
[2024-06-01 07:42:22] [INFO ] Deduced a trap composed of 77 places in 342 ms of which 4 ms to minimize.
[2024-06-01 07:42:23] [INFO ] Deduced a trap composed of 74 places in 336 ms of which 4 ms to minimize.
[2024-06-01 07:42:23] [INFO ] Deduced a trap composed of 70 places in 297 ms of which 4 ms to minimize.
[2024-06-01 07:42:23] [INFO ] Deduced a trap composed of 67 places in 300 ms of which 4 ms to minimize.
[2024-06-01 07:42:24] [INFO ] Deduced a trap composed of 71 places in 322 ms of which 4 ms to minimize.
[2024-06-01 07:42:24] [INFO ] Deduced a trap composed of 73 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:42:24] [INFO ] Deduced a trap composed of 59 places in 343 ms of which 5 ms to minimize.
[2024-06-01 07:42:25] [INFO ] Deduced a trap composed of 71 places in 296 ms of which 4 ms to minimize.
[2024-06-01 07:42:25] [INFO ] Deduced a trap composed of 72 places in 290 ms of which 4 ms to minimize.
[2024-06-01 07:42:25] [INFO ] Deduced a trap composed of 62 places in 321 ms of which 4 ms to minimize.
[2024-06-01 07:42:26] [INFO ] Deduced a trap composed of 82 places in 343 ms of which 5 ms to minimize.
[2024-06-01 07:42:26] [INFO ] Deduced a trap composed of 87 places in 345 ms of which 4 ms to minimize.
[2024-06-01 07:42:26] [INFO ] Deduced a trap composed of 59 places in 345 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:42:28] [INFO ] Deduced a trap composed of 90 places in 445 ms of which 4 ms to minimize.
[2024-06-01 07:42:28] [INFO ] Deduced a trap composed of 90 places in 299 ms of which 4 ms to minimize.
[2024-06-01 07:42:28] [INFO ] Deduced a trap composed of 91 places in 275 ms of which 4 ms to minimize.
[2024-06-01 07:42:29] [INFO ] Deduced a trap composed of 91 places in 272 ms of which 4 ms to minimize.
[2024-06-01 07:42:29] [INFO ] Deduced a trap composed of 82 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:42:29] [INFO ] Deduced a trap composed of 97 places in 210 ms of which 3 ms to minimize.
[2024-06-01 07:42:31] [INFO ] Deduced a trap composed of 100 places in 450 ms of which 5 ms to minimize.
[2024-06-01 07:42:32] [INFO ] Deduced a trap composed of 135 places in 422 ms of which 5 ms to minimize.
[2024-06-01 07:42:32] [INFO ] Deduced a trap composed of 127 places in 362 ms of which 4 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 129 places in 372 ms of which 5 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 106 places in 365 ms of which 5 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 86 places in 324 ms of which 4 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 107 places in 258 ms of which 4 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 4 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 121 places in 272 ms of which 4 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 84 places in 251 ms of which 4 ms to minimize.
[2024-06-01 07:42:35] [INFO ] Deduced a trap composed of 122 places in 292 ms of which 4 ms to minimize.
[2024-06-01 07:42:35] [INFO ] Deduced a trap composed of 113 places in 308 ms of which 4 ms to minimize.
[2024-06-01 07:42:35] [INFO ] Deduced a trap composed of 73 places in 342 ms of which 4 ms to minimize.
[2024-06-01 07:42:36] [INFO ] Deduced a trap composed of 82 places in 306 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 90 places in 311 ms of which 4 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 94 places in 323 ms of which 5 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 92 places in 260 ms of which 4 ms to minimize.
[2024-06-01 07:42:41] [INFO ] Deduced a trap composed of 110 places in 355 ms of which 4 ms to minimize.
[2024-06-01 07:42:41] [INFO ] Deduced a trap composed of 85 places in 358 ms of which 5 ms to minimize.
[2024-06-01 07:42:42] [INFO ] Deduced a trap composed of 91 places in 322 ms of which 5 ms to minimize.
[2024-06-01 07:42:43] [INFO ] Deduced a trap composed of 36 places in 322 ms of which 4 ms to minimize.
[2024-06-01 07:42:43] [INFO ] Deduced a trap composed of 90 places in 299 ms of which 4 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 49 places in 325 ms of which 4 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 102 places in 308 ms of which 4 ms to minimize.
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 47 places in 312 ms of which 4 ms to minimize.
SMT process timed out in 61200ms, After SMT, problems are : Problem set: 0 solved, 1659 unsolved
Search for dead transitions found 0 dead transitions in 61221ms
Finished structural reductions in LTL mode , in 1 iterations and 64184 ms. Remains : 511/511 places, 1666/1666 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[true, (NOT p2), false, p2, (AND (NOT p1) (NOT p2)), false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 180200 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 3
Probabilistic random walk after 180200 steps, saw 123724 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-06-01 07:42:48] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:42:48] [INFO ] Invariant cache hit.
[2024-06-01 07:42:48] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 191/196 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/217 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/223 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 351/574 variables, 223/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 49/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 80/654 variables, 36/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/654 variables, 20/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/654 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 244/898 variables, 8/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/898 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/906 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/906 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 312/1218 variables, 252/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1218 variables, 151/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1218 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1218 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1218/1218 variables, and 753 constraints, problems are : Problem set: 0 solved, 3 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 511/511 constraints, ReadFeed: 220/220 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 191/196 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/217 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/223 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:42:49] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:42:49] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:42:49] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:42:50] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:42:50] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:42:50] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 351/574 variables, 223/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 49/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 80/654 variables, 36/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/654 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/654 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 244/898 variables, 8/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/898 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 8/906 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/906 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 78 places in 244 ms of which 4 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 3 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 2 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:42:52] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/906 variables, 6/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/906 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 312/1218 variables, 252/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1218 variables, 151/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1218 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/1218 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1218/1218 variables, and 768 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3193 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 511/511 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 3997ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 280 ms.
Support contains 2 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1666/1666 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 511 transition count 1659
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 504 transition count 1659
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 504 transition count 1505
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 350 transition count 1505
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 308 transition count 1463
Applied a total of 406 rules in 111 ms. Remains 308 /511 variables (removed 203) and now considering 1463/1666 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 308/511 places, 1463/1666 transitions.
RANDOM walk for 40000 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 489616 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 489616 steps, saw 192584 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2024-06-01 07:42:56] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 07:42:56] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 07:42:56] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/194 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 120/314 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 21/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 192/506 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/506 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/518 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 294/812 variables, 204/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/812 variables, 188/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/194 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 120/314 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 21/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 192/506 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/506 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/518 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:42:56] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 2 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:42:58] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:42:58] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:42:58] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:42:58] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:42:58] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 3 ms to minimize.
[2024-06-01 07:42:58] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 2 ms to minimize.
[2024-06-01 07:42:59] [INFO ] Deduced a trap composed of 80 places in 253 ms of which 2 ms to minimize.
[2024-06-01 07:42:59] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:42:59] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:42:59] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:42:59] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:42:59] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:42:59] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:43:00] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2024-06-01 07:43:00] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 3 ms to minimize.
[2024-06-01 07:43:00] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:43:00] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:43:00] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:43:00] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:43:00] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/518 variables, 7/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/518 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 294/812 variables, 204/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/812 variables, 188/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/812 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/812 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 578 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4422 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 27/27 constraints]
After SMT, in 4786ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 43 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 47 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 07:43:01] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:43:01] [INFO ] Invariant cache hit.
[2024-06-01 07:43:01] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-06-01 07:43:01] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:43:01] [INFO ] Invariant cache hit.
[2024-06-01 07:43:01] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:43:03] [INFO ] Implicit Places using invariants and state equation in 1609 ms returned []
Implicit Place search using SMT with State Equation took 2099 ms to find 0 implicit places.
[2024-06-01 07:43:03] [INFO ] Redundant transitions in 42 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:43:03] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:43:03] [INFO ] Invariant cache hit.
[2024-06-01 07:43:03] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 3 places in 283 ms of which 3 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:43:15] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:43:16] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:43:17] [INFO ] Deduced a trap composed of 62 places in 196 ms of which 2 ms to minimize.
[2024-06-01 07:43:17] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:43:17] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:43:17] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 2 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:43:18] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:43:19] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:43:19] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:43:21] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:43:21] [INFO ] Deduced a trap composed of 62 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:43:21] [INFO ] Deduced a trap composed of 53 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:43:21] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:43:22] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:43:22] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 2 ms to minimize.
[2024-06-01 07:43:22] [INFO ] Deduced a trap composed of 29 places in 218 ms of which 2 ms to minimize.
[2024-06-01 07:43:23] [INFO ] Deduced a trap composed of 62 places in 211 ms of which 3 ms to minimize.
[2024-06-01 07:43:23] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 3 ms to minimize.
[2024-06-01 07:43:23] [INFO ] Deduced a trap composed of 39 places in 227 ms of which 2 ms to minimize.
[2024-06-01 07:43:23] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:43:24] [INFO ] Deduced a trap composed of 53 places in 221 ms of which 2 ms to minimize.
[2024-06-01 07:43:24] [INFO ] Deduced a trap composed of 60 places in 216 ms of which 2 ms to minimize.
[2024-06-01 07:43:24] [INFO ] Deduced a trap composed of 57 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:43:24] [INFO ] Deduced a trap composed of 55 places in 237 ms of which 3 ms to minimize.
[2024-06-01 07:43:24] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:43:25] [INFO ] Deduced a trap composed of 55 places in 241 ms of which 4 ms to minimize.
[2024-06-01 07:43:25] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:43:25] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:43:26] [INFO ] Deduced a trap composed of 29 places in 229 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 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 62 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 67 places in 195 ms of which 2 ms to minimize.
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:43:38] [INFO ] Deduced a trap composed of 68 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 82 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:43:39] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 2 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 2 ms to minimize.
[2024-06-01 07:43:40] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 50 places in 201 ms of which 2 ms to minimize.
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:43:41] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 85 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 67 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 90 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:43:42] [INFO ] Deduced a trap composed of 61 places in 205 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 60 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 2 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 63 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 53 places in 206 ms of which 3 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 54 places in 191 ms of which 2 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 60 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 2 ms to minimize.
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 52 places in 196 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 73 places in 226 ms of which 2 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:43:57] [INFO ] Deduced a trap composed of 60 places in 206 ms of which 3 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 3 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 66 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 74 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 74 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 53 places in 242 ms of which 3 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 2 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 43 places in 266 ms of which 3 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 49 places in 254 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 122 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 100/100 constraints]
After SMT, in 60893ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60910ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63108 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1343 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 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 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 369 place count 99 transition count 177
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 383 place count 92 transition count 177
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 390 place count 92 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 397 place count 92 transition count 163
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 439 place count 92 transition count 121
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 481 place count 50 transition count 121
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 488 place count 50 transition count 121
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 489 place count 50 transition count 121
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 490 place count 50 transition count 120
Applied a total of 490 rules in 35 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2024-06-01 07:44:04] [INFO ] Computed 15 invariants in 0 ms
[2024-06-01 07:44:04] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:44:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-06-01 07:44:04] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:44:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 07:44:04] [INFO ] After 9ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:44:04] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:44:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
TRAPS : Iteration 1
[2024-06-01 07:44:04] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:44:04] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 207 ms.
Knowledge obtained : [(AND (NOT p2) p1)]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F p2)]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[true, (NOT p2), false, p2, (AND (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p2), false, p2, (AND (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p2), false, p2, (AND (NOT p1) (NOT p2)), false, false, false, false]
Product exploration explored 100000 steps with 0 reset in 242 ms.
Product exploration explored 100000 steps with 0 reset in 335 ms.
Applying partial POR strategy [true, false, false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 294 ms :[true, (NOT p2), false, p2, (AND (NOT p1) (NOT p2)), false, false, false, false]
Support contains 5 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 1666/1666 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 511 transition count 1666
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 147 Pre rules applied. Total rules applied 7 place count 511 transition count 1904
Deduced a syphon composed of 154 places in 2 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 154 place count 511 transition count 1904
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 203 places in 1 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 203 place count 511 transition count 1904
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 210 place count 504 transition count 1897
Deduced a syphon composed of 196 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 217 place count 504 transition count 1897
Deduced a syphon composed of 196 places in 2 ms
Applied a total of 217 rules in 153 ms. Remains 504 /511 variables (removed 7) and now considering 1897/1666 (removed -231) transitions.
[2024-06-01 07:44:06] [INFO ] Redundant transitions in 56 ms returned []
Running 1890 sub problems to find dead transitions.
[2024-06-01 07:44:06] [INFO ] Flow matrix only has 819 transitions (discarded 1078 similar events)
// Phase 1: matrix 819 rows 504 cols
[2024-06-01 07:44:06] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 07:44:06] [INFO ] State equation strengthened by 359 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1890 unsolved
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 3 places in 343 ms of which 4 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 2 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:44:30] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:44:31] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
[2024-06-01 07:44:31] [INFO ] Deduced a trap composed of 49 places in 273 ms of which 4 ms to minimize.
[2024-06-01 07:44:31] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
[2024-06-01 07:44:32] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
[2024-06-01 07:44:32] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
[2024-06-01 07:44:32] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
[2024-06-01 07:44:32] [INFO ] Deduced a trap composed of 10 places in 279 ms of which 4 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
[2024-06-01 07:44:32] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-06-01 07:44:32] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
[2024-06-01 07:44:32] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
[2024-06-01 07:44:33] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
[2024-06-01 07:44:33] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
[2024-06-01 07:44:33] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
[2024-06-01 07:44:33] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:44:33] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1895 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 20/42 constraints. Problems are: Problem set: 434 solved, 1456 unsolved
[2024-06-01 07:44:34] [INFO ] Deduced a trap composed of 35 places in 445 ms of which 5 ms to minimize.
[2024-06-01 07:44:35] [INFO ] Deduced a trap composed of 65 places in 396 ms of which 5 ms to minimize.
[2024-06-01 07:44:35] [INFO ] Deduced a trap composed of 27 places in 409 ms of which 5 ms to minimize.
[2024-06-01 07:44:36] [INFO ] Deduced a trap composed of 23 places in 424 ms of which 4 ms to minimize.
[2024-06-01 07:44:36] [INFO ] Deduced a trap composed of 47 places in 428 ms of which 5 ms to minimize.
[2024-06-01 07:44:36] [INFO ] Deduced a trap composed of 49 places in 408 ms of which 4 ms to minimize.
[2024-06-01 07:44:37] [INFO ] Deduced a trap composed of 26 places in 360 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/1323 variables, and 49 constraints, problems are : Problem set: 434 solved, 1456 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/504 constraints, ReadFeed: 0/359 constraints, PredecessorRefiner: 1890/1890 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 434 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 1/1 constraints. Problems are: Problem set: 434 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 27/28 constraints. Problems are: Problem set: 434 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/28 constraints. Problems are: Problem set: 434 solved, 1456 unsolved
At refinement iteration 3 (OVERLAPS) 196/504 variables, 14/42 constraints. Problems are: Problem set: 434 solved, 1456 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 7/49 constraints. Problems are: Problem set: 434 solved, 1456 unsolved
[2024-06-01 07:44:52] [INFO ] Deduced a trap composed of 22 places in 416 ms of which 4 ms to minimize.
[2024-06-01 07:44:52] [INFO ] Deduced a trap composed of 21 places in 404 ms of which 5 ms to minimize.
[2024-06-01 07:44:53] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 4 ms to minimize.
[2024-06-01 07:44:54] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:44:54] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:44:54] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:44:54] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:44:55] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:44:55] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:44:55] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:44:56] [INFO ] Deduced a trap composed of 40 places in 388 ms of which 4 ms to minimize.
[2024-06-01 07:44:56] [INFO ] Deduced a trap composed of 11 places in 450 ms of which 5 ms to minimize.
[2024-06-01 07:44:56] [INFO ] Deduced a trap composed of 49 places in 383 ms of which 5 ms to minimize.
[2024-06-01 07:44:57] [INFO ] Deduced a trap composed of 63 places in 403 ms of which 4 ms to minimize.
[2024-06-01 07:44:58] [INFO ] Deduced a trap composed of 29 places in 445 ms of which 5 ms to minimize.
[2024-06-01 07:44:58] [INFO ] Deduced a trap composed of 23 places in 374 ms of which 4 ms to minimize.
[2024-06-01 07:44:58] [INFO ] Deduced a trap composed of 21 places in 359 ms of which 4 ms to minimize.
[2024-06-01 07:44:59] [INFO ] Deduced a trap composed of 30 places in 368 ms of which 4 ms to minimize.
[2024-06-01 07:44:59] [INFO ] Deduced a trap composed of 52 places in 390 ms of which 5 ms to minimize.
[2024-06-01 07:45:00] [INFO ] Deduced a trap composed of 45 places in 381 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 20/69 constraints. Problems are: Problem set: 434 solved, 1456 unsolved
[2024-06-01 07:45:01] [INFO ] Deduced a trap composed of 24 places in 344 ms of which 4 ms to minimize.
[2024-06-01 07:45:04] [INFO ] Deduced a trap composed of 15 places in 427 ms of which 5 ms to minimize.
[2024-06-01 07:45:05] [INFO ] Deduced a trap composed of 18 places in 408 ms of which 5 ms to minimize.
[2024-06-01 07:45:06] [INFO ] Deduced a trap composed of 19 places in 384 ms of which 4 ms to minimize.
[2024-06-01 07:45:06] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:45:07] [INFO ] Deduced a trap composed of 75 places in 464 ms of which 5 ms to minimize.
[2024-06-01 07:45:08] [INFO ] Deduced a trap composed of 103 places in 474 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/1323 variables, and 76 constraints, problems are : Problem set: 434 solved, 1456 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/504 constraints, ReadFeed: 0/359 constraints, PredecessorRefiner: 0/1890 constraints, Known Traps: 54/54 constraints]
After SMT, in 61206ms problems are : Problem set: 434 solved, 1456 unsolved
Search for dead transitions found 434 dead transitions in 61230ms
Found 434 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 434 transitions
Dead transitions reduction (with SMT) removed 434 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 504/511 places, 1463/1666 transitions.
Graph (complete) has 3157 edges and 504 vertex of which 308 are kept as prefixes of interest. Removing 196 places using SCC suffix rule.4 ms
Discarding 196 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 47 ms. Remains 308 /504 variables (removed 196) and now considering 1463/1463 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 308/511 places, 1463/1666 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61532 ms. Remains : 308/511 places, 1463/1666 transitions.
Support contains 5 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 1666/1666 transitions.
Applied a total of 0 rules in 16 ms. Remains 511 /511 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2024-06-01 07:45:08] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2024-06-01 07:45:08] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:45:08] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-06-01 07:45:08] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:45:08] [INFO ] Invariant cache hit.
[2024-06-01 07:45:09] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:45:11] [INFO ] Implicit Places using invariants and state equation in 2417 ms returned []
Implicit Place search using SMT with State Equation took 2946 ms to find 0 implicit places.
Running 1659 sub problems to find dead transitions.
[2024-06-01 07:45:11] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:45:11] [INFO ] Invariant cache hit.
[2024-06-01 07:45:11] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:45:31] [INFO ] Deduced a trap composed of 63 places in 243 ms of which 3 ms to minimize.
[2024-06-01 07:45:31] [INFO ] Deduced a trap composed of 29 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:45:31] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 4 ms to minimize.
[2024-06-01 07:45:31] [INFO ] Deduced a trap composed of 38 places in 254 ms of which 3 ms to minimize.
[2024-06-01 07:45:32] [INFO ] Deduced a trap composed of 32 places in 297 ms of which 4 ms to minimize.
[2024-06-01 07:45:32] [INFO ] Deduced a trap composed of 23 places in 296 ms of which 5 ms to minimize.
[2024-06-01 07:45:32] [INFO ] Deduced a trap composed of 32 places in 376 ms of which 5 ms to minimize.
[2024-06-01 07:45:33] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:45:33] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:45:33] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:45:33] [INFO ] Deduced a trap composed of 89 places in 258 ms of which 4 ms to minimize.
[2024-06-01 07:45:33] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:45:35] [INFO ] Deduced a trap composed of 52 places in 430 ms of which 5 ms to minimize.
[2024-06-01 07:45:36] [INFO ] Deduced a trap composed of 74 places in 414 ms of which 5 ms to minimize.
[2024-06-01 07:45:36] [INFO ] Deduced a trap composed of 143 places in 414 ms of which 5 ms to minimize.
[2024-06-01 07:45:36] [INFO ] Deduced a trap composed of 122 places in 377 ms of which 4 ms to minimize.
[2024-06-01 07:45:37] [INFO ] Deduced a trap composed of 129 places in 382 ms of which 5 ms to minimize.
[2024-06-01 07:45:37] [INFO ] Deduced a trap composed of 121 places in 377 ms of which 4 ms to minimize.
[2024-06-01 07:45:38] [INFO ] Deduced a trap composed of 116 places in 367 ms of which 5 ms to minimize.
[2024-06-01 07:45:38] [INFO ] Deduced a trap composed of 89 places in 358 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:45:39] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:45:39] [INFO ] Deduced a trap composed of 67 places in 283 ms of which 3 ms to minimize.
[2024-06-01 07:45:40] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:45:40] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:45:40] [INFO ] Deduced a trap composed of 61 places in 291 ms of which 4 ms to minimize.
[2024-06-01 07:45:40] [INFO ] Deduced a trap composed of 67 places in 285 ms of which 4 ms to minimize.
[2024-06-01 07:45:41] [INFO ] Deduced a trap composed of 79 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:45:41] [INFO ] Deduced a trap composed of 67 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:45:41] [INFO ] Deduced a trap composed of 59 places in 290 ms of which 4 ms to minimize.
[2024-06-01 07:45:42] [INFO ] Deduced a trap composed of 69 places in 281 ms of which 4 ms to minimize.
SMT process timed out in 30951ms, After SMT, problems are : Problem set: 0 solved, 1659 unsolved
Search for dead transitions found 0 dead transitions in 30970ms
Finished structural reductions in LTL mode , in 1 iterations and 33936 ms. Remains : 511/511 places, 1666/1666 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-04 finished in 389216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(p1)||X(G(p2))))))'
Support contains 8 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 1708/1708 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 512 transition count 1673
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 512 transition count 1673
Applied a total of 10 rules in 24 ms. Remains 512 /517 variables (removed 5) and now considering 1673/1708 (removed 35) transitions.
[2024-06-01 07:45:42] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
// Phase 1: matrix 714 rows 512 cols
[2024-06-01 07:45:42] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:45:42] [INFO ] Implicit Places using invariants in 670 ms returned []
[2024-06-01 07:45:43] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2024-06-01 07:45:43] [INFO ] Invariant cache hit.
[2024-06-01 07:45:43] [INFO ] State equation strengthened by 226 read => feed constraints.
[2024-06-01 07:45:45] [INFO ] Implicit Places using invariants and state equation in 2329 ms returned []
Implicit Place search using SMT with State Equation took 3003 ms to find 0 implicit places.
Running 1666 sub problems to find dead transitions.
[2024-06-01 07:45:45] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2024-06-01 07:45:45] [INFO ] Invariant cache hit.
[2024-06-01 07:45:45] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
[2024-06-01 07:46:04] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:46:05] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 4 ms to minimize.
[2024-06-01 07:46:05] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 2 ms to minimize.
[2024-06-01 07:46:05] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:46:05] [INFO ] Deduced a trap composed of 35 places in 334 ms of which 4 ms to minimize.
[2024-06-01 07:46:06] [INFO ] Deduced a trap composed of 83 places in 327 ms of which 5 ms to minimize.
[2024-06-01 07:46:06] [INFO ] Deduced a trap composed of 67 places in 301 ms of which 4 ms to minimize.
[2024-06-01 07:46:06] [INFO ] Deduced a trap composed of 67 places in 275 ms of which 4 ms to minimize.
[2024-06-01 07:46:07] [INFO ] Deduced a trap composed of 65 places in 340 ms of which 4 ms to minimize.
[2024-06-01 07:46:07] [INFO ] Deduced a trap composed of 33 places in 363 ms of which 4 ms to minimize.
[2024-06-01 07:46:08] [INFO ] Deduced a trap composed of 50 places in 339 ms of which 4 ms to minimize.
[2024-06-01 07:46:08] [INFO ] Deduced a trap composed of 39 places in 348 ms of which 4 ms to minimize.
[2024-06-01 07:46:08] [INFO ] Deduced a trap composed of 36 places in 349 ms of which 5 ms to minimize.
[2024-06-01 07:46:09] [INFO ] Deduced a trap composed of 110 places in 343 ms of which 5 ms to minimize.
[2024-06-01 07:46:09] [INFO ] Deduced a trap composed of 26 places in 409 ms of which 7 ms to minimize.
[2024-06-01 07:46:09] [INFO ] Deduced a trap composed of 29 places in 411 ms of which 4 ms to minimize.
[2024-06-01 07:46:10] [INFO ] Deduced a trap composed of 81 places in 317 ms of which 4 ms to minimize.
[2024-06-01 07:46:10] [INFO ] Deduced a trap composed of 67 places in 274 ms of which 4 ms to minimize.
[2024-06-01 07:46:10] [INFO ] Deduced a trap composed of 25 places in 317 ms of which 5 ms to minimize.
[2024-06-01 07:46:11] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
[2024-06-01 07:46:11] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:46:12] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:46:12] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:46:12] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:46:12] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:46:12] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:46:12] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:46:13] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:46:14] [INFO ] Deduced a trap composed of 52 places in 431 ms of which 5 ms to minimize.
[2024-06-01 07:46:15] [INFO ] Deduced a trap composed of 74 places in 407 ms of which 5 ms to minimize.
[2024-06-01 07:46:15] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:46:15] [INFO ] Deduced a trap composed of 147 places in 428 ms of which 5 ms to minimize.
[2024-06-01 07:46:16] [INFO ] Deduced a trap composed of 122 places in 377 ms of which 5 ms to minimize.
SMT process timed out in 30889ms, After SMT, problems are : Problem set: 0 solved, 1666 unsolved
Search for dead transitions found 0 dead transitions in 30916ms
Starting structural reductions in LTL mode, iteration 1 : 512/517 places, 1673/1708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33947 ms. Remains : 512/517 places, 1673/1708 transitions.
Stuttering acceptance computed with spot in 363 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 250 ms.
Product exploration explored 100000 steps with 0 reset in 330 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 141 ms. Reduced automaton from 11 states, 35 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 438 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 97536 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 6
Probabilistic random walk after 97536 steps, saw 69399 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
[2024-06-01 07:46:21] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2024-06-01 07:46:21] [INFO ] Invariant cache hit.
[2024-06-01 07:46:21] [INFO ] State equation strengthened by 226 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 143/149 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/151 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 101/252 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 44/296 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 447/743 variables, 296/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/743 variables, 84/393 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/743 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 60/803 variables, 27/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/803 variables, 18/438 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/803 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 183/986 variables, 6/444 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/986 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 6/992 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/992 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 234/1226 variables, 189/636 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1226 variables, 124/760 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1226 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/1226 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1226/1226 variables, and 760 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1355 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 512/512 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 143/149 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/151 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 07:46:22] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 101/252 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 07:46:22] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 44/296 variables, 4/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 07:46:23] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:46:23] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:46:23] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 3/18 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/296 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 447/743 variables, 296/314 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/743 variables, 84/398 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/743 variables, 0/398 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 60/803 variables, 27/425 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/803 variables, 18/443 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/803 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 183/986 variables, 6/449 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/986 variables, 0/449 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 6/992 variables, 3/452 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/992 variables, 5/457 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/992 variables, 0/457 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 234/1226 variables, 189/646 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1226 variables, 124/770 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 07:46:24] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1226 variables, 1/771 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1226 variables, 0/771 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/1226 variables, 0/771 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1226/1226 variables, and 771 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2850 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 512/512 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 4225ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 891 ms.
Support contains 6 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1673/1673 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 512 transition count 1666
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 505 transition count 1666
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 505 transition count 1512
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 351 transition count 1512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 323 place count 350 transition count 1505
Iterating global reduction 2 with 1 rules applied. Total rules applied 324 place count 350 transition count 1505
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 408 place count 308 transition count 1463
Applied a total of 408 rules in 83 ms. Remains 308 /512 variables (removed 204) and now considering 1463/1673 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 308/512 places, 1463/1673 transitions.
RANDOM walk for 40000 steps (8 resets) in 534 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 263112 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 2
Probabilistic random walk after 263112 steps, saw 124347 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2024-06-01 07:46:29] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 07:46:29] [INFO ] Computed 22 invariants in 9 ms
[2024-06-01 07:46:29] [INFO ] State equation strengthened by 220 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) 85/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/161 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/179 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 324/503 variables, 179/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 78/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 60/563 variables, 27/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 21/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/563 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 96/659 variables, 6/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/659 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/665 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/665 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 147/812 variables, 102/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/812 variables, 121/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 2 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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
At refinement iteration 1 (OVERLAPS) 85/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/161 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/179 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 324/503 variables, 179/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 78/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 60/563 variables, 27/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/563 variables, 21/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/563 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/659 variables, 6/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/659 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/665 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:46:30] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:46:31] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/665 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 147/812 variables, 102/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 121/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:46:31] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/812 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/812 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 559 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1297 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 1756ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 113 ms.
Support contains 6 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 37 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 44 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 07:46:31] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:46:31] [INFO ] Invariant cache hit.
[2024-06-01 07:46:32] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-06-01 07:46:32] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:46:32] [INFO ] Invariant cache hit.
[2024-06-01 07:46:32] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:46:33] [INFO ] Implicit Places using invariants and state equation in 1463 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2024-06-01 07:46:33] [INFO ] Redundant transitions in 28 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:46:33] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:46:33] [INFO ] Invariant cache hit.
[2024-06-01 07:46:33] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:46:45] [INFO ] Deduced a trap composed of 3 places in 278 ms of which 3 ms to minimize.
[2024-06-01 07:46:45] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:46:46] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:46:46] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:46:46] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:46:46] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:46:47] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 2 ms to minimize.
[2024-06-01 07:46:47] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:46:47] [INFO ] Deduced a trap composed of 61 places in 190 ms of which 2 ms to minimize.
[2024-06-01 07:46:47] [INFO ] Deduced a trap composed of 78 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:46:47] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:46:48] [INFO ] Deduced a trap composed of 54 places in 213 ms of which 3 ms to minimize.
[2024-06-01 07:46:48] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:46:48] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:46:48] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:46:48] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:46:49] [INFO ] Deduced a trap composed of 53 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:46:49] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 2 ms to minimize.
[2024-06-01 07:46:49] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:46:50] [INFO ] Deduced a trap composed of 63 places in 220 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:46:50] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:46:52] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:46:53] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 2 ms to minimize.
[2024-06-01 07:46:54] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 2 ms to minimize.
[2024-06-01 07:46:56] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:46:58] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:47:02] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 3 ms to minimize.
[2024-06-01 07:47:02] [INFO ] Deduced a trap composed of 21 places in 285 ms of which 3 ms to minimize.
[2024-06-01 07:47:02] [INFO ] Deduced a trap composed of 16 places in 288 ms of which 3 ms to minimize.
[2024-06-01 07:47:02] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 3 ms to minimize.
[2024-06-01 07:47:03] [INFO ] Deduced a trap composed of 17 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:47:03] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 3 ms to minimize.
[2024-06-01 07:47:03] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 3 ms to minimize.
[2024-06-01 07:47:04] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 3 ms to minimize.
[2024-06-01 07:47:04] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:47:04] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 3 ms to minimize.
SMT process timed out in 31029ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 31045ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33137 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1313 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 266 transition count 318
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 121 place count 206 transition count 318
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 121 place count 206 transition count 303
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 158 place count 184 transition count 303
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 322 place count 102 transition count 221
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 360 place count 102 transition count 183
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 370 place count 97 transition count 183
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 375 place count 97 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 382 place count 97 transition count 171
Free-agglomeration rule applied 44 times.
Iterating global reduction 4 with 44 rules applied. Total rules applied 426 place count 97 transition count 127
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 4 with 44 rules applied. Total rules applied 470 place count 53 transition count 127
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 477 place count 53 transition count 127
Applied a total of 477 rules in 28 ms. Remains 53 /308 variables (removed 255) and now considering 127/1463 (removed 1336) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 127 rows 53 cols
[2024-06-01 07:47:04] [INFO ] Computed 15 invariants in 0 ms
[2024-06-01 07:47:04] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 07:47:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-01 07:47:04] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 07:47:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:47:04] [INFO ] After 21ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 07:47:04] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:47:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
TRAPS : Iteration 1
[2024-06-01 07:47:04] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 07:47:05] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 315 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (NOT p1)), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 27 factoid took 253 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 512 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 1673/1673 transitions.
Applied a total of 0 rules in 9 ms. Remains 512 /512 variables (removed 0) and now considering 1673/1673 (removed 0) transitions.
[2024-06-01 07:47:05] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
// Phase 1: matrix 714 rows 512 cols
[2024-06-01 07:47:05] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 07:47:06] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-06-01 07:47:06] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2024-06-01 07:47:06] [INFO ] Invariant cache hit.
[2024-06-01 07:47:06] [INFO ] State equation strengthened by 226 read => feed constraints.
[2024-06-01 07:47:08] [INFO ] Implicit Places using invariants and state equation in 2345 ms returned []
Implicit Place search using SMT with State Equation took 2916 ms to find 0 implicit places.
Running 1666 sub problems to find dead transitions.
[2024-06-01 07:47:08] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2024-06-01 07:47:08] [INFO ] Invariant cache hit.
[2024-06-01 07:47:08] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
[2024-06-01 07:47:28] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 3 ms to minimize.
[2024-06-01 07:47:28] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 3 ms to minimize.
[2024-06-01 07:47:29] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:47:29] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:47:29] [INFO ] Deduced a trap composed of 35 places in 338 ms of which 4 ms to minimize.
[2024-06-01 07:47:29] [INFO ] Deduced a trap composed of 83 places in 339 ms of which 4 ms to minimize.
[2024-06-01 07:47:30] [INFO ] Deduced a trap composed of 67 places in 308 ms of which 4 ms to minimize.
[2024-06-01 07:47:30] [INFO ] Deduced a trap composed of 67 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:47:30] [INFO ] Deduced a trap composed of 65 places in 367 ms of which 5 ms to minimize.
[2024-06-01 07:47:31] [INFO ] Deduced a trap composed of 33 places in 373 ms of which 4 ms to minimize.
[2024-06-01 07:47:31] [INFO ] Deduced a trap composed of 50 places in 372 ms of which 4 ms to minimize.
[2024-06-01 07:47:32] [INFO ] Deduced a trap composed of 39 places in 351 ms of which 5 ms to minimize.
[2024-06-01 07:47:32] [INFO ] Deduced a trap composed of 36 places in 349 ms of which 5 ms to minimize.
[2024-06-01 07:47:32] [INFO ] Deduced a trap composed of 110 places in 358 ms of which 4 ms to minimize.
[2024-06-01 07:47:33] [INFO ] Deduced a trap composed of 26 places in 360 ms of which 4 ms to minimize.
[2024-06-01 07:47:33] [INFO ] Deduced a trap composed of 29 places in 322 ms of which 5 ms to minimize.
[2024-06-01 07:47:33] [INFO ] Deduced a trap composed of 81 places in 314 ms of which 4 ms to minimize.
[2024-06-01 07:47:34] [INFO ] Deduced a trap composed of 67 places in 287 ms of which 4 ms to minimize.
[2024-06-01 07:47:34] [INFO ] Deduced a trap composed of 25 places in 304 ms of which 4 ms to minimize.
[2024-06-01 07:47:34] [INFO ] Deduced a trap composed of 34 places in 290 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
[2024-06-01 07:47:35] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:47:35] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:47:35] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:47:36] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:47:36] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:47:36] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:47:36] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:47:37] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:47:38] [INFO ] Deduced a trap composed of 52 places in 438 ms of which 5 ms to minimize.
[2024-06-01 07:47:39] [INFO ] Deduced a trap composed of 74 places in 404 ms of which 4 ms to minimize.
[2024-06-01 07:47:39] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:47:39] [INFO ] Deduced a trap composed of 147 places in 423 ms of which 5 ms to minimize.
SMT process timed out in 30963ms, After SMT, problems are : Problem set: 0 solved, 1666 unsolved
Search for dead transitions found 0 dead transitions in 30982ms
Finished structural reductions in LTL mode , in 1 iterations and 33910 ms. Remains : 512/512 places, 1673/1673 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1), (X (X p2)), (X (X p1)), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 747 ms. (53 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 134768 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 3
Probabilistic random walk after 134768 steps, saw 94721 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-06-01 07:47:43] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2024-06-01 07:47:43] [INFO ] Invariant cache hit.
[2024-06-01 07:47:43] [INFO ] State equation strengthened by 226 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 143/149 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/151 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 101/252 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 44/296 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 447/743 variables, 296/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/743 variables, 84/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/743 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 60/803 variables, 27/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/803 variables, 18/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/803 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 183/986 variables, 6/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/986 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 6/992 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/992 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 234/1226 variables, 189/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1226 variables, 124/760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1226 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1226 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1226/1226 variables, and 760 constraints, problems are : Problem set: 0 solved, 3 unsolved in 831 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 512/512 constraints, ReadFeed: 226/226 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 143/149 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/151 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 101/252 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:47:44] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 44/296 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:47:44] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 447/743 variables, 296/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/743 variables, 84/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:47:44] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/743 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/743 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 60/803 variables, 27/423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/803 variables, 18/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/803 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 183/986 variables, 6/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/986 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 6/992 variables, 3/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/992 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:47:45] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:47:45] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:47:45] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/992 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/992 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 234/1226 variables, 189/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1226 variables, 124/769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1226 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1226 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1226/1226 variables, and 769 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2169 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 512/512 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 3019ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 258 ms.
Support contains 3 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1673/1673 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 512 transition count 1666
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 505 transition count 1666
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 505 transition count 1512
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 351 transition count 1512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 323 place count 350 transition count 1505
Iterating global reduction 2 with 1 rules applied. Total rules applied 324 place count 350 transition count 1505
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 408 place count 308 transition count 1463
Applied a total of 408 rules in 82 ms. Remains 308 /512 variables (removed 204) and now considering 1463/1673 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 308/512 places, 1463/1673 transitions.
RANDOM walk for 40000 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 495712 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 1
Probabilistic random walk after 495712 steps, saw 193587 distinct states, run finished after 3003 ms. (steps per millisecond=165 ) properties seen :0
[2024-06-01 07:47:49] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 07:47:49] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 07:47:49] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/84 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 204/297 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 28/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 100/397 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 22/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 160/557 variables, 10/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/567 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 245/812 variables, 170/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/812 variables, 170/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/84 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:47:50] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/93 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:47:50] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 204/297 variables, 93/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 28/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/297 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 100/397 variables, 45/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 22/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/557 variables, 10/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/557 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/567 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/567 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:47:50] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:47:50] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:47:50] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:47:50] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:47:51] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:47:51] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:47:51] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:47:51] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:47:51] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/567 variables, 9/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/567 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 245/812 variables, 170/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 170/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/812 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 562 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1538 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 1900ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 36 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 36 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 07:47:51] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:47:51] [INFO ] Invariant cache hit.
[2024-06-01 07:47:52] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-06-01 07:47:52] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:47:52] [INFO ] Invariant cache hit.
[2024-06-01 07:47:52] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:47:53] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned []
Implicit Place search using SMT with State Equation took 1948 ms to find 0 implicit places.
[2024-06-01 07:47:53] [INFO ] Redundant transitions in 28 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:47:53] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:47:53] [INFO ] Invariant cache hit.
[2024-06-01 07:47:53] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:48:06] [INFO ] Deduced a trap composed of 3 places in 266 ms of which 3 ms to minimize.
[2024-06-01 07:48:06] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:48:06] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:48:06] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:48:06] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:48:06] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:48:07] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:48:07] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:48:08] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:48:08] [INFO ] Deduced a trap composed of 78 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:48:08] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 3 ms to minimize.
[2024-06-01 07:48:08] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:48:09] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:48:09] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:48:09] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:48:09] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:48:09] [INFO ] Deduced a trap composed of 53 places in 223 ms of which 5 ms to minimize.
[2024-06-01 07:48:10] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:48:10] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 3 ms to minimize.
[2024-06-01 07:48:10] [INFO ] Deduced a trap composed of 63 places in 239 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:48:11] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:48:13] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:48:13] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:48:15] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:48:16] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:48:18] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:48:22] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:48:22] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 3 ms to minimize.
[2024-06-01 07:48:23] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 3 ms to minimize.
[2024-06-01 07:48:23] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 3 ms to minimize.
[2024-06-01 07:48:23] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 3 ms to minimize.
[2024-06-01 07:48:24] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 3 ms to minimize.
[2024-06-01 07:48:24] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 3 ms to minimize.
[2024-06-01 07:48:24] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 2 ms to minimize.
SMT process timed out in 30913ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 30929ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32952 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 366 place count 100 transition count 179
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 378 place count 94 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 384 place count 94 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 391 place count 94 transition count 166
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 434 place count 94 transition count 123
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 477 place count 51 transition count 123
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 484 place count 51 transition count 123
Applied a total of 484 rules in 26 ms. Remains 51 /308 variables (removed 257) and now considering 123/1463 (removed 1340) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 51 cols
[2024-06-01 07:48:24] [INFO ] Computed 15 invariants in 0 ms
[2024-06-01 07:48:24] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:48:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-01 07:48:24] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:48:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:48:24] [INFO ] After 10ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:48:24] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:48:24] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 166 ms.
Knowledge obtained : [(AND p2 p1), (X (X p2)), (X (X p1)), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 233 ms.
Product exploration explored 100000 steps with 0 reset in 318 ms.
Applying partial POR strategy [true, true, false, true, false, false]
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 1673/1673 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 512 transition count 1673
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 147 Pre rules applied. Total rules applied 7 place count 512 transition count 1911
Deduced a syphon composed of 154 places in 2 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 154 place count 512 transition count 1911
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 511 transition count 1904
Deduced a syphon composed of 154 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 511 transition count 1904
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 203 places in 2 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 205 place count 511 transition count 1904
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 212 place count 504 transition count 1897
Deduced a syphon composed of 196 places in 2 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 219 place count 504 transition count 1897
Deduced a syphon composed of 196 places in 2 ms
Applied a total of 219 rules in 106 ms. Remains 504 /512 variables (removed 8) and now considering 1897/1673 (removed -224) transitions.
[2024-06-01 07:48:26] [INFO ] Redundant transitions in 51 ms returned []
Running 1890 sub problems to find dead transitions.
[2024-06-01 07:48:26] [INFO ] Flow matrix only has 819 transitions (discarded 1078 similar events)
// Phase 1: matrix 819 rows 504 cols
[2024-06-01 07:48:26] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 07:48:26] [INFO ] State equation strengthened by 359 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1890 unsolved
[2024-06-01 07:48:48] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 3 ms to minimize.
[2024-06-01 07:48:49] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:48:49] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:48:49] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:48:49] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:48:49] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:48:50] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
[2024-06-01 07:48:51] [INFO ] Deduced a trap composed of 48 places in 285 ms of which 4 ms to minimize.
[2024-06-01 07:48:51] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
[2024-06-01 07:48:51] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
[2024-06-01 07:48:51] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
[2024-06-01 07:48:51] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
[2024-06-01 07:48:51] [INFO ] Deduced a trap composed of 10 places in 273 ms of which 3 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
[2024-06-01 07:48:52] [INFO ] Deduced a trap composed of 84 places in 452 ms of which 5 ms to minimize.
[2024-06-01 07:48:52] [INFO ] Deduced a trap composed of 65 places in 448 ms of which 5 ms to minimize.
[2024-06-01 07:48:53] [INFO ] Deduced a trap composed of 63 places in 360 ms of which 5 ms to minimize.
[2024-06-01 07:48:53] [INFO ] Deduced a trap composed of 59 places in 469 ms of which 5 ms to minimize.
[2024-06-01 07:48:53] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-06-01 07:48:53] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
[2024-06-01 07:48:54] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 20/42 constraints. Problems are: Problem set: 286 solved, 1604 unsolved
[2024-06-01 07:48:55] [INFO ] Deduced a trap composed of 60 places in 509 ms of which 7 ms to minimize.
[2024-06-01 07:48:56] [INFO ] Deduced a trap composed of 15 places in 441 ms of which 5 ms to minimize.
[2024-06-01 07:48:56] [INFO ] Deduced a trap composed of 33 places in 400 ms of which 5 ms to minimize.
[2024-06-01 07:48:56] [INFO ] Deduced a trap composed of 25 places in 419 ms of which 5 ms to minimize.
[2024-06-01 07:48:57] [INFO ] Deduced a trap composed of 19 places in 409 ms of which 4 ms to minimize.
[2024-06-01 07:48:57] [INFO ] Deduced a trap composed of 35 places in 412 ms of which 4 ms to minimize.
[2024-06-01 07:48:58] [INFO ] Deduced a trap composed of 24 places in 410 ms of which 5 ms to minimize.
SMT process timed out in 31473ms, After SMT, problems are : Problem set: 286 solved, 1604 unsolved
Search for dead transitions found 286 dead transitions in 31496ms
Found 286 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 286 transitions
Dead transitions reduction (with SMT) removed 286 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 504/512 places, 1611/1673 transitions.
Graph (complete) has 3405 edges and 504 vertex of which 368 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.2 ms
Discarding 136 places :
Also discarding 0 output transitions
Deduced a syphon composed of 60 places in 1 ms
Applied a total of 1 rules in 44 ms. Remains 368 /504 variables (removed 136) and now considering 1611/1611 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 368/512 places, 1611/1673 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31709 ms. Remains : 368/512 places, 1611/1673 transitions.
Support contains 6 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 1673/1673 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 511 transition count 1666
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 511 transition count 1666
Applied a total of 2 rules in 17 ms. Remains 511 /512 variables (removed 1) and now considering 1666/1673 (removed 7) transitions.
[2024-06-01 07:48:58] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2024-06-01 07:48:58] [INFO ] Computed 22 invariants in 8 ms
[2024-06-01 07:48:58] [INFO ] Implicit Places using invariants in 596 ms returned []
[2024-06-01 07:48:58] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:48:58] [INFO ] Invariant cache hit.
[2024-06-01 07:48:59] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:49:01] [INFO ] Implicit Places using invariants and state equation in 2521 ms returned []
Implicit Place search using SMT with State Equation took 3121 ms to find 0 implicit places.
Running 1659 sub problems to find dead transitions.
[2024-06-01 07:49:01] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:49:01] [INFO ] Invariant cache hit.
[2024-06-01 07:49:01] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:49:21] [INFO ] Deduced a trap composed of 63 places in 257 ms of which 4 ms to minimize.
[2024-06-01 07:49:21] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 3 ms to minimize.
[2024-06-01 07:49:21] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:49:22] [INFO ] Deduced a trap composed of 38 places in 259 ms of which 3 ms to minimize.
[2024-06-01 07:49:22] [INFO ] Deduced a trap composed of 32 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:49:22] [INFO ] Deduced a trap composed of 23 places in 390 ms of which 4 ms to minimize.
[2024-06-01 07:49:23] [INFO ] Deduced a trap composed of 32 places in 363 ms of which 4 ms to minimize.
[2024-06-01 07:49:23] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:49:23] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:49:23] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:49:23] [INFO ] Deduced a trap composed of 89 places in 263 ms of which 3 ms to minimize.
[2024-06-01 07:49:24] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:49:25] [INFO ] Deduced a trap composed of 52 places in 434 ms of which 5 ms to minimize.
[2024-06-01 07:49:26] [INFO ] Deduced a trap composed of 74 places in 414 ms of which 5 ms to minimize.
[2024-06-01 07:49:26] [INFO ] Deduced a trap composed of 143 places in 439 ms of which 4 ms to minimize.
[2024-06-01 07:49:27] [INFO ] Deduced a trap composed of 122 places in 380 ms of which 5 ms to minimize.
[2024-06-01 07:49:27] [INFO ] Deduced a trap composed of 129 places in 390 ms of which 4 ms to minimize.
[2024-06-01 07:49:28] [INFO ] Deduced a trap composed of 121 places in 382 ms of which 5 ms to minimize.
[2024-06-01 07:49:28] [INFO ] Deduced a trap composed of 116 places in 383 ms of which 5 ms to minimize.
[2024-06-01 07:49:28] [INFO ] Deduced a trap composed of 89 places in 348 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:49:29] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:49:30] [INFO ] Deduced a trap composed of 67 places in 281 ms of which 5 ms to minimize.
[2024-06-01 07:49:30] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:49:30] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:49:30] [INFO ] Deduced a trap composed of 61 places in 287 ms of which 4 ms to minimize.
[2024-06-01 07:49:31] [INFO ] Deduced a trap composed of 67 places in 272 ms of which 4 ms to minimize.
[2024-06-01 07:49:31] [INFO ] Deduced a trap composed of 79 places in 257 ms of which 3 ms to minimize.
[2024-06-01 07:49:31] [INFO ] Deduced a trap composed of 67 places in 293 ms of which 4 ms to minimize.
[2024-06-01 07:49:31] [INFO ] Deduced a trap composed of 59 places in 295 ms of which 4 ms to minimize.
[2024-06-01 07:49:32] [INFO ] Deduced a trap composed of 69 places in 222 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/1218 variables, and 52 constraints, problems are : Problem set: 0 solved, 1659 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/511 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1659/1659 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 30/52 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:49:36] [INFO ] Deduced a trap composed of 79 places in 354 ms of which 5 ms to minimize.
[2024-06-01 07:49:37] [INFO ] Deduced a trap composed of 67 places in 341 ms of which 5 ms to minimize.
[2024-06-01 07:49:37] [INFO ] Deduced a trap composed of 74 places in 299 ms of which 4 ms to minimize.
[2024-06-01 07:49:37] [INFO ] Deduced a trap composed of 88 places in 347 ms of which 5 ms to minimize.
[2024-06-01 07:49:38] [INFO ] Deduced a trap composed of 80 places in 340 ms of which 5 ms to minimize.
[2024-06-01 07:49:38] [INFO ] Deduced a trap composed of 86 places in 336 ms of which 4 ms to minimize.
[2024-06-01 07:49:39] [INFO ] Deduced a trap composed of 84 places in 340 ms of which 5 ms to minimize.
[2024-06-01 07:49:39] [INFO ] Deduced a trap composed of 77 places in 339 ms of which 5 ms to minimize.
[2024-06-01 07:49:39] [INFO ] Deduced a trap composed of 74 places in 343 ms of which 4 ms to minimize.
[2024-06-01 07:49:40] [INFO ] Deduced a trap composed of 70 places in 278 ms of which 3 ms to minimize.
[2024-06-01 07:49:40] [INFO ] Deduced a trap composed of 67 places in 295 ms of which 4 ms to minimize.
[2024-06-01 07:49:40] [INFO ] Deduced a trap composed of 71 places in 303 ms of which 4 ms to minimize.
[2024-06-01 07:49:40] [INFO ] Deduced a trap composed of 73 places in 296 ms of which 4 ms to minimize.
[2024-06-01 07:49:41] [INFO ] Deduced a trap composed of 59 places in 356 ms of which 7 ms to minimize.
[2024-06-01 07:49:41] [INFO ] Deduced a trap composed of 71 places in 404 ms of which 5 ms to minimize.
[2024-06-01 07:49:42] [INFO ] Deduced a trap composed of 72 places in 285 ms of which 3 ms to minimize.
[2024-06-01 07:49:42] [INFO ] Deduced a trap composed of 62 places in 289 ms of which 3 ms to minimize.
[2024-06-01 07:49:42] [INFO ] Deduced a trap composed of 82 places in 350 ms of which 4 ms to minimize.
[2024-06-01 07:49:43] [INFO ] Deduced a trap composed of 87 places in 323 ms of which 4 ms to minimize.
[2024-06-01 07:49:43] [INFO ] Deduced a trap composed of 59 places in 335 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:49:44] [INFO ] Deduced a trap composed of 90 places in 241 ms of which 4 ms to minimize.
[2024-06-01 07:49:44] [INFO ] Deduced a trap composed of 90 places in 292 ms of which 4 ms to minimize.
[2024-06-01 07:49:45] [INFO ] Deduced a trap composed of 91 places in 280 ms of which 4 ms to minimize.
[2024-06-01 07:49:45] [INFO ] Deduced a trap composed of 91 places in 260 ms of which 4 ms to minimize.
[2024-06-01 07:49:45] [INFO ] Deduced a trap composed of 82 places in 282 ms of which 4 ms to minimize.
[2024-06-01 07:49:46] [INFO ] Deduced a trap composed of 97 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:49:48] [INFO ] Deduced a trap composed of 100 places in 448 ms of which 5 ms to minimize.
[2024-06-01 07:49:48] [INFO ] Deduced a trap composed of 135 places in 425 ms of which 5 ms to minimize.
[2024-06-01 07:49:48] [INFO ] Deduced a trap composed of 127 places in 369 ms of which 4 ms to minimize.
[2024-06-01 07:49:49] [INFO ] Deduced a trap composed of 129 places in 424 ms of which 5 ms to minimize.
[2024-06-01 07:49:49] [INFO ] Deduced a trap composed of 106 places in 371 ms of which 4 ms to minimize.
[2024-06-01 07:49:50] [INFO ] Deduced a trap composed of 86 places in 320 ms of which 4 ms to minimize.
[2024-06-01 07:49:50] [INFO ] Deduced a trap composed of 107 places in 315 ms of which 4 ms to minimize.
[2024-06-01 07:49:50] [INFO ] Deduced a trap composed of 33 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:49:51] [INFO ] Deduced a trap composed of 121 places in 285 ms of which 4 ms to minimize.
[2024-06-01 07:49:51] [INFO ] Deduced a trap composed of 84 places in 278 ms of which 4 ms to minimize.
[2024-06-01 07:49:51] [INFO ] Deduced a trap composed of 122 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:49:51] [INFO ] Deduced a trap composed of 113 places in 307 ms of which 4 ms to minimize.
[2024-06-01 07:49:52] [INFO ] Deduced a trap composed of 73 places in 369 ms of which 6 ms to minimize.
[2024-06-01 07:49:52] [INFO ] Deduced a trap composed of 82 places in 408 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:49:54] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:49:54] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:49:54] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:49:54] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:49:54] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:49:56] [INFO ] Deduced a trap composed of 90 places in 308 ms of which 5 ms to minimize.
[2024-06-01 07:49:57] [INFO ] Deduced a trap composed of 94 places in 331 ms of which 5 ms to minimize.
[2024-06-01 07:49:57] [INFO ] Deduced a trap composed of 92 places in 328 ms of which 4 ms to minimize.
[2024-06-01 07:49:58] [INFO ] Deduced a trap composed of 110 places in 376 ms of which 5 ms to minimize.
[2024-06-01 07:49:58] [INFO ] Deduced a trap composed of 85 places in 355 ms of which 4 ms to minimize.
[2024-06-01 07:49:59] [INFO ] Deduced a trap composed of 91 places in 322 ms of which 4 ms to minimize.
[2024-06-01 07:49:59] [INFO ] Deduced a trap composed of 36 places in 314 ms of which 5 ms to minimize.
[2024-06-01 07:50:00] [INFO ] Deduced a trap composed of 90 places in 300 ms of which 4 ms to minimize.
[2024-06-01 07:50:01] [INFO ] Deduced a trap composed of 49 places in 318 ms of which 4 ms to minimize.
[2024-06-01 07:50:01] [INFO ] Deduced a trap composed of 102 places in 321 ms of which 4 ms to minimize.
[2024-06-01 07:50:02] [INFO ] Deduced a trap composed of 47 places in 305 ms of which 4 ms to minimize.
[2024-06-01 07:50:02] [INFO ] Deduced a trap composed of 91 places in 304 ms of which 4 ms to minimize.
SMT process timed out in 60970ms, After SMT, problems are : Problem set: 0 solved, 1659 unsolved
Search for dead transitions found 0 dead transitions in 60988ms
Starting structural reductions in LTL mode, iteration 1 : 511/512 places, 1666/1673 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64131 ms. Remains : 511/512 places, 1666/1673 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-05 finished in 260200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((G(p1)||G(F(p2)))))))'
Support contains 7 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 1708/1708 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 517 transition count 1701
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 510 transition count 1701
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 510 transition count 1547
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 356 transition count 1547
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 328 place count 350 transition count 1505
Iterating global reduction 2 with 6 rules applied. Total rules applied 334 place count 350 transition count 1505
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 418 place count 308 transition count 1463
Applied a total of 418 rules in 76 ms. Remains 308 /517 variables (removed 209) and now considering 1463/1708 (removed 245) transitions.
[2024-06-01 07:50:02] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 07:50:02] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 07:50:03] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-06-01 07:50:03] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:50:03] [INFO ] Invariant cache hit.
[2024-06-01 07:50:03] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:50:04] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1978 ms to find 0 implicit places.
[2024-06-01 07:50:04] [INFO ] Redundant transitions in 29 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:50:04] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:50:04] [INFO ] Invariant cache hit.
[2024-06-01 07:50:04] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:50:16] [INFO ] Deduced a trap composed of 3 places in 329 ms of which 3 ms to minimize.
[2024-06-01 07:50:17] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2024-06-01 07:50:17] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:50:17] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:50:17] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:50:17] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:50:18] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:50:18] [INFO ] Deduced a trap composed of 59 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:50:18] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:50:18] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:50:19] [INFO ] Deduced a trap composed of 60 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:50:19] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:50:19] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:50:19] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:50:19] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:50:20] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:50:20] [INFO ] Deduced a trap composed of 58 places in 213 ms of which 3 ms to minimize.
[2024-06-01 07:50:20] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:50:21] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 3 ms to minimize.
[2024-06-01 07:50:21] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:50:21] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:50:24] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:50:25] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:50:26] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 2 ms to minimize.
[2024-06-01 07:50:27] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:50:29] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:50:31] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:50:33] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 4 ms to minimize.
[2024-06-01 07:50:34] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 3 ms to minimize.
[2024-06-01 07:50:34] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 3 ms to minimize.
[2024-06-01 07:50:34] [INFO ] Deduced a trap composed of 16 places in 276 ms of which 3 ms to minimize.
[2024-06-01 07:50:34] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 3 ms to minimize.
[2024-06-01 07:50:35] [INFO ] Deduced a trap composed of 28 places in 275 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 55 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 33/55 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:50:43] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:50:43] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 2 ms to minimize.
[2024-06-01 07:50:44] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 3 ms to minimize.
[2024-06-01 07:50:44] [INFO ] Deduced a trap composed of 48 places in 232 ms of which 3 ms to minimize.
[2024-06-01 07:50:44] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:50:44] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 2 ms to minimize.
[2024-06-01 07:50:45] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:50:45] [INFO ] Deduced a trap composed of 61 places in 195 ms of which 2 ms to minimize.
[2024-06-01 07:50:46] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:50:46] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:50:46] [INFO ] Deduced a trap composed of 58 places in 218 ms of which 2 ms to minimize.
[2024-06-01 07:50:47] [INFO ] Deduced a trap composed of 94 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:50:47] [INFO ] Deduced a trap composed of 95 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:50:47] [INFO ] Deduced a trap composed of 61 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:50:47] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:50:47] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:50:48] [INFO ] Deduced a trap composed of 45 places in 250 ms of which 3 ms to minimize.
[2024-06-01 07:50:48] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:50:48] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 3 ms to minimize.
[2024-06-01 07:50:49] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:50:51] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:50:56] [INFO ] Deduced a trap composed of 62 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:50:56] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 2 ms to minimize.
[2024-06-01 07:50:56] [INFO ] Deduced a trap composed of 54 places in 242 ms of which 3 ms to minimize.
[2024-06-01 07:50:57] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 2 ms to minimize.
[2024-06-01 07:50:57] [INFO ] Deduced a trap composed of 61 places in 227 ms of which 2 ms to minimize.
[2024-06-01 07:50:58] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 3 ms to minimize.
[2024-06-01 07:50:59] [INFO ] Deduced a trap composed of 61 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:50:59] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:50:59] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:51:00] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:51:00] [INFO ] Deduced a trap composed of 64 places in 216 ms of which 2 ms to minimize.
[2024-06-01 07:51:00] [INFO ] Deduced a trap composed of 56 places in 219 ms of which 3 ms to minimize.
[2024-06-01 07:51:00] [INFO ] Deduced a trap composed of 61 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:51:01] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:51:01] [INFO ] Deduced a trap composed of 55 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:51:01] [INFO ] Deduced a trap composed of 76 places in 249 ms of which 3 ms to minimize.
[2024-06-01 07:51:01] [INFO ] Deduced a trap composed of 54 places in 248 ms of which 2 ms to minimize.
[2024-06-01 07:51:02] [INFO ] Deduced a trap composed of 66 places in 224 ms of which 2 ms to minimize.
[2024-06-01 07:51:02] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:51:05] [INFO ] Deduced a trap composed of 55 places in 172 ms of which 3 ms to minimize.
SMT process timed out in 60964ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60981ms
Starting structural reductions in SI_LTL mode, iteration 1 : 308/517 places, 1463/1708 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63075 ms. Remains : 308/517 places, 1463/1708 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 243 ms.
Product exploration explored 100000 steps with 0 reset in 292 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 (NOT p2)), (X (NOT p2)), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 147 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (8 resets) in 329 ms. (121 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 6/9 properties
[2024-06-01 07:51:07] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:51:07] [INFO ] Invariant cache hit.
[2024-06-01 07:51:07] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 125/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 38/170 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 9/179 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 324/503 variables, 179/192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 78/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 60/563 variables, 27/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 21/318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/563 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 96/659 variables, 6/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/659 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 6/665 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/665 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 147/812 variables, 102/429 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/812 variables, 121/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 6 unsolved in 897 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 125/132 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 38/170 variables, 4/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-01 07:51:08] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:51:08] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:51:08] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:51:08] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 4/15 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 9/179 variables, 2/17 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-01 07:51:08] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 1/18 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/503 variables, 179/197 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 78/275 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 0/275 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 60/563 variables, 27/302 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/563 variables, 21/323 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/563 variables, 1/324 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/563 variables, 0/324 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 96/659 variables, 6/330 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/659 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 6/665 variables, 3/333 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 3/336 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-01 07:51:09] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 1/337 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/665 variables, 0/337 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 147/812 variables, 102/439 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 121/560 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/560 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/560 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 560 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1527 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 2442ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 799 ms.
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 35 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 308/308 places, 1463/1463 transitions.
RANDOM walk for 40000 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 482576 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 1
Probabilistic random walk after 482576 steps, saw 191640 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2024-06-01 07:51:13] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:51:13] [INFO ] Invariant cache hit.
[2024-06-01 07:51:13] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/84 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:51:13] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:51:13] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 204/297 variables, 93/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 28/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 100/397 variables, 45/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 22/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 160/557 variables, 10/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/567 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:51:14] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/567 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/567 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 245/812 variables, 170/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/812 variables, 170/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/812 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/84 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/93 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 204/297 variables, 93/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 28/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/297 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 100/397 variables, 45/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 22/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/557 variables, 10/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/557 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/567 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/567 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/567 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:51:14] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:51:14] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:51:14] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:51:15] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:51:15] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/567 variables, 5/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/567 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 245/812 variables, 170/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 170/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 559 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1763ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 35 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 36 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 07:51:15] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:51:15] [INFO ] Invariant cache hit.
[2024-06-01 07:51:16] [INFO ] Implicit Places using invariants in 543 ms returned []
[2024-06-01 07:51:16] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:51:16] [INFO ] Invariant cache hit.
[2024-06-01 07:51:16] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:51:17] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 2014 ms to find 0 implicit places.
[2024-06-01 07:51:17] [INFO ] Redundant transitions in 28 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:51:17] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:51:17] [INFO ] Invariant cache hit.
[2024-06-01 07:51:17] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:51:30] [INFO ] Deduced a trap composed of 3 places in 303 ms of which 4 ms to minimize.
[2024-06-01 07:51:30] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:51:30] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2024-06-01 07:51:30] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:51:30] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:51:31] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:51:31] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:51:32] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:51:32] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:51:32] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 2 ms to minimize.
[2024-06-01 07:51:32] [INFO ] Deduced a trap composed of 60 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:51:32] [INFO ] Deduced a trap composed of 59 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:51:33] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:51:33] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:51:33] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:51:33] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:51:33] [INFO ] Deduced a trap composed of 58 places in 207 ms of which 3 ms to minimize.
[2024-06-01 07:51:34] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:51:34] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 3 ms to minimize.
[2024-06-01 07:51:34] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:51:35] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:51:37] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:51:39] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:51:39] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:51:41] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:51:43] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:51:45] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:51:47] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 4 ms to minimize.
[2024-06-01 07:51:48] [INFO ] Deduced a trap composed of 21 places in 267 ms of which 3 ms to minimize.
[2024-06-01 07:51:48] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 4 ms to minimize.
[2024-06-01 07:51:48] [INFO ] Deduced a trap composed of 16 places in 270 ms of which 3 ms to minimize.
SMT process timed out in 31020ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 31037ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33124 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 366 place count 100 transition count 179
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 378 place count 94 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 384 place count 94 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 391 place count 94 transition count 166
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 434 place count 94 transition count 123
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 477 place count 51 transition count 123
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 484 place count 51 transition count 123
Applied a total of 484 rules in 21 ms. Remains 51 /308 variables (removed 257) and now considering 123/1463 (removed 1340) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 51 cols
[2024-06-01 07:51:48] [INFO ] Computed 15 invariants in 0 ms
[2024-06-01 07:51:48] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-01 07:51:48] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:51:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-01 07:51:48] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:51:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:51:48] [INFO ] After 10ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:51:48] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:51:48] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 250 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1)), (G (OR p0 p2 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 21 factoid took 359 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 308 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 47 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 07:51:49] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 07:51:49] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 07:51:49] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-06-01 07:51:49] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:51:49] [INFO ] Invariant cache hit.
[2024-06-01 07:51:50] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:51:51] [INFO ] Implicit Places using invariants and state equation in 1526 ms returned []
Implicit Place search using SMT with State Equation took 2062 ms to find 0 implicit places.
[2024-06-01 07:51:51] [INFO ] Redundant transitions in 27 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:51:51] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:51:51] [INFO ] Invariant cache hit.
[2024-06-01 07:51:51] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:52:03] [INFO ] Deduced a trap composed of 3 places in 269 ms of which 3 ms to minimize.
[2024-06-01 07:52:03] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:52:04] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:52:04] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:52:04] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:52:04] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:52:05] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:52:05] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:52:05] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:52:05] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:52:05] [INFO ] Deduced a trap composed of 60 places in 201 ms of which 2 ms to minimize.
[2024-06-01 07:52:06] [INFO ] Deduced a trap composed of 59 places in 241 ms of which 2 ms to minimize.
[2024-06-01 07:52:06] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:52:06] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:52:06] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:52:06] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 2 ms to minimize.
[2024-06-01 07:52:07] [INFO ] Deduced a trap composed of 58 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:52:07] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:52:07] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:52:07] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:52:08] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:52:10] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:52:12] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 2 ms to minimize.
[2024-06-01 07:52:12] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:52:14] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:52:16] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:52:18] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:52:20] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 3 ms to minimize.
[2024-06-01 07:52:20] [INFO ] Deduced a trap composed of 21 places in 289 ms of which 3 ms to minimize.
[2024-06-01 07:52:21] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 3 ms to minimize.
[2024-06-01 07:52:21] [INFO ] Deduced a trap composed of 16 places in 274 ms of which 3 ms to minimize.
[2024-06-01 07:52:21] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 3 ms to minimize.
[2024-06-01 07:52:22] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 3 ms to minimize.
(s196 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 (/ 1.0 2.0))
(s8 0.0)
(s9 (/ 1.0 2.0))
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 (/ 1.0 2.0))
(s17 0.0)
(s18 (/ 1.0 2.0))
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 (/ 1.0 2.0))
(s23 0.0)
(s24 (/ 1.0 2.0))
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 (/ 1.0 2.0))
(s29 0.0)
(s30 0.0)
(s31 (/ 1.0 2.0))
(s32 0.0)
(s33 (/ 1.0 2.0))
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.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.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 55 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 33/55 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:52:30] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 2 ms to minimize.
[2024-06-01 07:52:31] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:52:31] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:52:31] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 3 ms to minimize.
[2024-06-01 07:52:31] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:52:32] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:52:32] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 2 ms to minimize.
[2024-06-01 07:52:33] [INFO ] Deduced a trap composed of 61 places in 215 ms of which 2 ms to minimize.
[2024-06-01 07:52:33] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:52:33] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:52:34] [INFO ] Deduced a trap composed of 58 places in 222 ms of which 2 ms to minimize.
[2024-06-01 07:52:34] [INFO ] Deduced a trap composed of 94 places in 189 ms of which 2 ms to minimize.
[2024-06-01 07:52:34] [INFO ] Deduced a trap composed of 95 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:52:34] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:52:35] [INFO ] Deduced a trap composed of 72 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:52:35] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 2 ms to minimize.
[2024-06-01 07:52:35] [INFO ] Deduced a trap composed of 45 places in 261 ms of which 3 ms to minimize.
[2024-06-01 07:52:36] [INFO ] Deduced a trap composed of 49 places in 242 ms of which 3 ms to minimize.
[2024-06-01 07:52:36] [INFO ] Deduced a trap composed of 41 places in 251 ms of which 3 ms to minimize.
[2024-06-01 07:52:36] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:52:38] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:52:44] [INFO ] Deduced a trap composed of 62 places in 201 ms of which 2 ms to minimize.
[2024-06-01 07:52:44] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:52:44] [INFO ] Deduced a trap composed of 54 places in 234 ms of which 3 ms to minimize.
[2024-06-01 07:52:44] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:52:45] [INFO ] Deduced a trap composed of 61 places in 231 ms of which 2 ms to minimize.
[2024-06-01 07:52:46] [INFO ] Deduced a trap composed of 66 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:52:46] [INFO ] Deduced a trap composed of 61 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:52:47] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:52:47] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:52:47] [INFO ] Deduced a trap composed of 67 places in 227 ms of which 2 ms to minimize.
[2024-06-01 07:52:47] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 2 ms to minimize.
[2024-06-01 07:52:48] [INFO ] Deduced a trap composed of 56 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:52:48] [INFO ] Deduced a trap composed of 61 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:52:48] [INFO ] Deduced a trap composed of 65 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:52:48] [INFO ] Deduced a trap composed of 55 places in 219 ms of which 3 ms to minimize.
[2024-06-01 07:52:49] [INFO ] Deduced a trap composed of 76 places in 255 ms of which 3 ms to minimize.
[2024-06-01 07:52:49] [INFO ] Deduced a trap composed of 54 places in 251 ms of which 3 ms to minimize.
[2024-06-01 07:52:49] [INFO ] Deduced a trap composed of 66 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:52:50] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 95 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 73/73 constraints]
After SMT, in 60962ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60979ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63123 ms. Remains : 308/308 places, 1463/1463 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 143 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 866 ms. (46 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 458448 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :3 out of 4
Probabilistic random walk after 458448 steps, saw 184134 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :3
[2024-06-01 07:52:56] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:52:56] [INFO ] Invariant cache hit.
[2024-06-01 07:52:56] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/84 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:56] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:52:56] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 204/297 variables, 93/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 28/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 100/397 variables, 45/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 22/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 160/557 variables, 10/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/567 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/567 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/567 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 245/812 variables, 170/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/812 variables, 170/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/812 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/84 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/93 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 204/297 variables, 93/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 28/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/297 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 100/397 variables, 45/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 22/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/557 variables, 10/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/557 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/567 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/567 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/567 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:57] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:52:57] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:52:57] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 1 ms to minimize.
[2024-06-01 07:52:57] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:52:57] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/567 variables, 5/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/567 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 245/812 variables, 170/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 170/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 559 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1740ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 38 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 308/308 places, 1463/1463 transitions.
RANDOM walk for 40000 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 478800 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 1
Probabilistic random walk after 478800 steps, saw 190402 distinct states, run finished after 3003 ms. (steps per millisecond=159 ) properties seen :0
[2024-06-01 07:53:01] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:53:01] [INFO ] Invariant cache hit.
[2024-06-01 07:53:01] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/84 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:01] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:53:01] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 204/297 variables, 93/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 28/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 100/397 variables, 45/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 22/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 160/557 variables, 10/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/567 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/567 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/567 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 245/812 variables, 170/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/812 variables, 170/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/812 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/84 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/93 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 204/297 variables, 93/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 28/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/297 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 100/397 variables, 45/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 22/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/557 variables, 10/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/557 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/567 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/567 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/567 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:02] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:53:02] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:53:02] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:53:02] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:53:02] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/567 variables, 5/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/567 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 245/812 variables, 170/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 170/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 559 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1163 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1748ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 40 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 36 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 07:53:03] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:53:03] [INFO ] Invariant cache hit.
[2024-06-01 07:53:03] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-06-01 07:53:03] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:53:03] [INFO ] Invariant cache hit.
[2024-06-01 07:53:03] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:53:05] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
[2024-06-01 07:53:05] [INFO ] Redundant transitions in 28 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:53:05] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:53:05] [INFO ] Invariant cache hit.
[2024-06-01 07:53:05] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:53:17] [INFO ] Deduced a trap composed of 3 places in 269 ms of which 3 ms to minimize.
[2024-06-01 07:53:17] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2024-06-01 07:53:18] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:53:18] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:53:18] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:53:18] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:53:19] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:53:19] [INFO ] Deduced a trap composed of 59 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:53:19] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:53:19] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:53:20] [INFO ] Deduced a trap composed of 60 places in 207 ms of which 3 ms to minimize.
[2024-06-01 07:53:20] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:53:20] [INFO ] Deduced a trap composed of 64 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:53:20] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:53:20] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 2 ms to minimize.
[2024-06-01 07:53:21] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 2 ms to minimize.
[2024-06-01 07:53:21] [INFO ] Deduced a trap composed of 58 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:53:21] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:53:22] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:53:22] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:53:23] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:53:25] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:53:26] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:53:27] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:53:28] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:53:30] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:53:34] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 3 ms to minimize.
[2024-06-01 07:53:35] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 3 ms to minimize.
[2024-06-01 07:53:35] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 3 ms to minimize.
[2024-06-01 07:53:35] [INFO ] Deduced a trap composed of 16 places in 285 ms of which 3 ms to minimize.
[2024-06-01 07:53:36] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 3 ms to minimize.
SMT process timed out in 30930ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 30954ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33036 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 366 place count 100 transition count 179
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 378 place count 94 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 384 place count 94 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 391 place count 94 transition count 166
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 434 place count 94 transition count 123
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 477 place count 51 transition count 123
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 484 place count 51 transition count 123
Applied a total of 484 rules in 20 ms. Remains 51 /308 variables (removed 257) and now considering 123/1463 (removed 1340) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 51 cols
[2024-06-01 07:53:36] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 07:53:36] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-01 07:53:36] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:53:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-06-01 07:53:36] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:53:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:53:36] [INFO ] After 9ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:53:36] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:53:36] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 215 ms.
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 9 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 220 ms.
Product exploration explored 100000 steps with 0 reset in 266 ms.
Support contains 4 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 36 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 07:53:37] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 07:53:37] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 07:53:37] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-06-01 07:53:37] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:53:37] [INFO ] Invariant cache hit.
[2024-06-01 07:53:38] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:53:39] [INFO ] Implicit Places using invariants and state equation in 1501 ms returned []
Implicit Place search using SMT with State Equation took 1987 ms to find 0 implicit places.
[2024-06-01 07:53:39] [INFO ] Redundant transitions in 27 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:53:39] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:53:39] [INFO ] Invariant cache hit.
[2024-06-01 07:53:39] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 1 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:53:52] [INFO ] Deduced a trap composed of 54 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:53:52] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:53:52] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:53:53] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:53:53] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:53:53] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:53:53] [INFO ] Deduced a trap composed of 64 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:53:53] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 2 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 58 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:53:55] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:53:55] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:53:55] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:53:56] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:53:58] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:54:00] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 2 ms to minimize.
[2024-06-01 07:54:00] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:54:02] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:54:04] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:54:06] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:54:09] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:54:09] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 3 ms to minimize.
[2024-06-01 07:54:09] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 3 ms to minimize.
[2024-06-01 07:54:10] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 3 ms to minimize.
[2024-06-01 07:54:10] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 3 ms to minimize.
SMT process timed out in 31042ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 31061ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33121 ms. Remains : 308/308 places, 1463/1463 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-06 finished in 247921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 1708/1708 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 517 transition count 1701
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 510 transition count 1701
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 510 transition count 1547
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 356 transition count 1547
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 328 place count 350 transition count 1505
Iterating global reduction 2 with 6 rules applied. Total rules applied 334 place count 350 transition count 1505
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 418 place count 308 transition count 1463
Applied a total of 418 rules in 76 ms. Remains 308 /517 variables (removed 209) and now considering 1463/1708 (removed 245) transitions.
[2024-06-01 07:54:10] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:54:10] [INFO ] Invariant cache hit.
[2024-06-01 07:54:10] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-06-01 07:54:10] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:54:10] [INFO ] Invariant cache hit.
[2024-06-01 07:54:11] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:54:12] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2024-06-01 07:54:12] [INFO ] Redundant transitions in 28 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:54:12] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:54:12] [INFO ] Invariant cache hit.
[2024-06-01 07:54:12] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 3 places in 260 ms of which 3 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:54:26] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:54:26] [INFO ] Deduced a trap composed of 54 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:54:27] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 2 ms to minimize.
[2024-06-01 07:54:27] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:54:27] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:54:27] [INFO ] Deduced a trap composed of 60 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:54:28] [INFO ] Deduced a trap composed of 59 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:54:28] [INFO ] Deduced a trap composed of 64 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:54:28] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:54:28] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:54:28] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:54:29] [INFO ] Deduced a trap composed of 58 places in 196 ms of which 2 ms to minimize.
[2024-06-01 07:54:29] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:54:29] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:54:29] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:54:30] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:54:32] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:54:34] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:54:34] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:54:38] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:54:40] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:54:42] [INFO ] Deduced a trap composed of 25 places in 300 ms of which 3 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 3 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 19 places in 278 ms of which 3 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 16 places in 279 ms of which 3 ms to minimize.
SMT process timed out in 31133ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 31150ms
Starting structural reductions in SI_LTL mode, iteration 1 : 308/517 places, 1463/1708 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33273 ms. Remains : 308/517 places, 1463/1708 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 222 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-08 finished in 33591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0)))) U (F(p2)&&p1)))'
Support contains 7 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 1708/1708 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 511 transition count 1666
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 511 transition count 1666
Applied a total of 12 rules in 17 ms. Remains 511 /517 variables (removed 6) and now considering 1666/1708 (removed 42) transitions.
[2024-06-01 07:54:44] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2024-06-01 07:54:44] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 07:54:44] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-06-01 07:54:44] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:54:44] [INFO ] Invariant cache hit.
[2024-06-01 07:54:45] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:54:46] [INFO ] Implicit Places using invariants and state equation in 2322 ms returned []
Implicit Place search using SMT with State Equation took 2899 ms to find 0 implicit places.
Running 1659 sub problems to find dead transitions.
[2024-06-01 07:54:46] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:54:46] [INFO ] Invariant cache hit.
[2024-06-01 07:54:46] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:55:06] [INFO ] Deduced a trap composed of 63 places in 223 ms of which 2 ms to minimize.
[2024-06-01 07:55:06] [INFO ] Deduced a trap composed of 29 places in 299 ms of which 3 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 38 places in 295 ms of which 6 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 32 places in 462 ms of which 5 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 23 places in 608 ms of which 7 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 32 places in 572 ms of which 7 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 4 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 89 places in 428 ms of which 6 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:55:13] [INFO ] Deduced a trap composed of 52 places in 650 ms of which 8 ms to minimize.
[2024-06-01 07:55:14] [INFO ] Deduced a trap composed of 74 places in 587 ms of which 7 ms to minimize.
[2024-06-01 07:55:14] [INFO ] Deduced a trap composed of 143 places in 650 ms of which 8 ms to minimize.
[2024-06-01 07:55:15] [INFO ] Deduced a trap composed of 122 places in 513 ms of which 7 ms to minimize.
[2024-06-01 07:55:15] [INFO ] Deduced a trap composed of 129 places in 546 ms of which 7 ms to minimize.
[2024-06-01 07:55:16] [INFO ] Deduced a trap composed of 121 places in 567 ms of which 7 ms to minimize.
[2024-06-01 07:55:17] [INFO ] Deduced a trap composed of 116 places in 561 ms of which 7 ms to minimize.
[2024-06-01 07:55:17] [INFO ] Deduced a trap composed of 89 places in 452 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/1218 variables, and 42 constraints, problems are : Problem set: 0 solved, 1659 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/511 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1659/1659 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:55:21] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:55:21] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:55:22] [INFO ] Deduced a trap composed of 67 places in 469 ms of which 6 ms to minimize.
[2024-06-01 07:55:22] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 3 ms to minimize.
[2024-06-01 07:55:25] [INFO ] Deduced a trap composed of 78 places in 524 ms of which 6 ms to minimize.
[2024-06-01 07:55:25] [INFO ] Deduced a trap composed of 94 places in 571 ms of which 7 ms to minimize.
[2024-06-01 07:55:26] [INFO ] Deduced a trap composed of 79 places in 569 ms of which 7 ms to minimize.
[2024-06-01 07:55:27] [INFO ] Deduced a trap composed of 98 places in 520 ms of which 7 ms to minimize.
[2024-06-01 07:55:27] [INFO ] Deduced a trap composed of 88 places in 509 ms of which 6 ms to minimize.
[2024-06-01 07:55:28] [INFO ] Deduced a trap composed of 90 places in 510 ms of which 7 ms to minimize.
[2024-06-01 07:55:28] [INFO ] Deduced a trap composed of 91 places in 501 ms of which 6 ms to minimize.
[2024-06-01 07:55:29] [INFO ] Deduced a trap composed of 65 places in 498 ms of which 6 ms to minimize.
[2024-06-01 07:55:29] [INFO ] Deduced a trap composed of 78 places in 511 ms of which 6 ms to minimize.
[2024-06-01 07:55:30] [INFO ] Deduced a trap composed of 74 places in 518 ms of which 5 ms to minimize.
[2024-06-01 07:55:30] [INFO ] Deduced a trap composed of 84 places in 307 ms of which 4 ms to minimize.
[2024-06-01 07:55:31] [INFO ] Deduced a trap composed of 103 places in 501 ms of which 6 ms to minimize.
[2024-06-01 07:55:31] [INFO ] Deduced a trap composed of 55 places in 531 ms of which 7 ms to minimize.
[2024-06-01 07:55:32] [INFO ] Deduced a trap composed of 63 places in 493 ms of which 6 ms to minimize.
[2024-06-01 07:55:32] [INFO ] Deduced a trap composed of 76 places in 446 ms of which 5 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 73 places in 427 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:55:34] [INFO ] Deduced a trap composed of 3 places in 261 ms of which 3 ms to minimize.
[2024-06-01 07:55:34] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:55:38] [INFO ] Deduced a trap composed of 100 places in 659 ms of which 8 ms to minimize.
[2024-06-01 07:55:39] [INFO ] Deduced a trap composed of 130 places in 542 ms of which 7 ms to minimize.
[2024-06-01 07:55:39] [INFO ] Deduced a trap composed of 154 places in 506 ms of which 6 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 102 places in 500 ms of which 6 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 110 places in 427 ms of which 6 ms to minimize.
[2024-06-01 07:55:41] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:55:41] [INFO ] Deduced a trap composed of 79 places in 378 ms of which 6 ms to minimize.
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 117 places in 397 ms of which 6 ms to minimize.
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 115 places in 390 ms of which 5 ms to minimize.
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 101 places in 561 ms of which 7 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 164 places in 565 ms of which 7 ms to minimize.
[2024-06-01 07:55:44] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 5 ms to minimize.
[2024-06-01 07:55:44] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 133 places in 546 ms of which 7 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 32 places in 575 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:55:46] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/1218 variables, and 83 constraints, problems are : Problem set: 0 solved, 1659 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/511 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1659 constraints, Known Traps: 61/61 constraints]
After SMT, in 61056ms problems are : Problem set: 0 solved, 1659 unsolved
Search for dead transitions found 0 dead transitions in 61075ms
Starting structural reductions in LTL mode, iteration 1 : 511/517 places, 1666/1708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63995 ms. Remains : 511/517 places, 1666/1708 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-09 finished in 64301 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((X(p0)&&G(p1)))||G((X(p3)&&p2))))'
Support contains 6 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 1708/1708 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 512 transition count 1673
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 512 transition count 1673
Applied a total of 10 rules in 28 ms. Remains 512 /517 variables (removed 5) and now considering 1673/1708 (removed 35) transitions.
[2024-06-01 07:55:48] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
// Phase 1: matrix 714 rows 512 cols
[2024-06-01 07:55:48] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:55:49] [INFO ] Implicit Places using invariants in 798 ms returned []
[2024-06-01 07:55:49] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2024-06-01 07:55:49] [INFO ] Invariant cache hit.
[2024-06-01 07:55:49] [INFO ] State equation strengthened by 226 read => feed constraints.
[2024-06-01 07:55:52] [INFO ] Implicit Places using invariants and state equation in 3473 ms returned []
Implicit Place search using SMT with State Equation took 4276 ms to find 0 implicit places.
Running 1666 sub problems to find dead transitions.
[2024-06-01 07:55:52] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2024-06-01 07:55:52] [INFO ] Invariant cache hit.
[2024-06-01 07:55:52] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
[2024-06-01 07:56:23] [INFO ] Deduced a trap composed of 63 places in 330 ms of which 4 ms to minimize.
[2024-06-01 07:56:23] [INFO ] Deduced a trap composed of 30 places in 262 ms of which 4 ms to minimize.
[2024-06-01 07:56:23] [INFO ] Deduced a trap composed of 38 places in 344 ms of which 4 ms to minimize.
[2024-06-01 07:56:24] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 3 ms to minimize.
SMT process timed out in 31362ms, After SMT, problems are : Problem set: 0 solved, 1666 unsolved
Search for dead transitions found 0 dead transitions in 31384ms
Starting structural reductions in LTL mode, iteration 1 : 512/517 places, 1673/1708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35692 ms. Remains : 512/517 places, 1673/1708 transitions.
Stuttering acceptance computed with spot in 488 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (NOT p0), (NOT p1), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 344 ms.
Stack based approach found an accepted trace after 122 steps with 0 reset with depth 123 and stack size 123 in 1 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-10 finished in 36567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(p1)||(p1&&F(!p0)))))'
Support contains 3 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 1708/1708 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 511 transition count 1666
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 511 transition count 1666
Applied a total of 12 rules in 29 ms. Remains 511 /517 variables (removed 6) and now considering 1666/1708 (removed 42) transitions.
[2024-06-01 07:56:24] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2024-06-01 07:56:24] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 07:56:25] [INFO ] Implicit Places using invariants in 841 ms returned []
[2024-06-01 07:56:25] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:56:25] [INFO ] Invariant cache hit.
[2024-06-01 07:56:26] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:56:29] [INFO ] Implicit Places using invariants and state equation in 3687 ms returned []
Implicit Place search using SMT with State Equation took 4530 ms to find 0 implicit places.
Running 1659 sub problems to find dead transitions.
[2024-06-01 07:56:29] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:56:29] [INFO ] Invariant cache hit.
[2024-06-01 07:56:29] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:56:57] [INFO ] Deduced a trap composed of 63 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:56:58] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:56:58] [INFO ] Deduced a trap composed of 41 places in 379 ms of which 5 ms to minimize.
[2024-06-01 07:56:59] [INFO ] Deduced a trap composed of 38 places in 447 ms of which 5 ms to minimize.
[2024-06-01 07:56:59] [INFO ] Deduced a trap composed of 32 places in 466 ms of which 6 ms to minimize.
[2024-06-01 07:57:00] [INFO ] Deduced a trap composed of 23 places in 627 ms of which 8 ms to minimize.
[2024-06-01 07:57:00] [INFO ] Deduced a trap composed of 32 places in 574 ms of which 7 ms to minimize.
SMT process timed out in 31325ms, After SMT, problems are : Problem set: 0 solved, 1659 unsolved
Search for dead transitions found 0 dead transitions in 31357ms
Starting structural reductions in LTL mode, iteration 1 : 511/517 places, 1666/1708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35922 ms. Remains : 511/517 places, 1666/1708 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (AND p0 (NOT p1)), p0]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 344 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-12 finished in 36521 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((X(F(p1))&&p0)))'
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 1708/1708 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 511 transition count 1666
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 511 transition count 1666
Applied a total of 12 rules in 33 ms. Remains 511 /517 variables (removed 6) and now considering 1666/1708 (removed 42) transitions.
[2024-06-01 07:57:01] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:57:01] [INFO ] Invariant cache hit.
[2024-06-01 07:57:02] [INFO ] Implicit Places using invariants in 735 ms returned []
[2024-06-01 07:57:02] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:57:02] [INFO ] Invariant cache hit.
[2024-06-01 07:57:02] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:57:06] [INFO ] Implicit Places using invariants and state equation in 3838 ms returned []
Implicit Place search using SMT with State Equation took 4575 ms to find 0 implicit places.
Running 1659 sub problems to find dead transitions.
[2024-06-01 07:57:06] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2024-06-01 07:57:06] [INFO ] Invariant cache hit.
[2024-06-01 07:57:06] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
[2024-06-01 07:57:34] [INFO ] Deduced a trap composed of 63 places in 386 ms of which 5 ms to minimize.
[2024-06-01 07:57:34] [INFO ] Deduced a trap composed of 29 places in 356 ms of which 4 ms to minimize.
[2024-06-01 07:57:35] [INFO ] Deduced a trap composed of 41 places in 405 ms of which 5 ms to minimize.
[2024-06-01 07:57:35] [INFO ] Deduced a trap composed of 38 places in 443 ms of which 5 ms to minimize.
[2024-06-01 07:57:36] [INFO ] Deduced a trap composed of 32 places in 484 ms of which 6 ms to minimize.
[2024-06-01 07:57:36] [INFO ] Deduced a trap composed of 23 places in 588 ms of which 7 ms to minimize.
[2024-06-01 07:57:37] [INFO ] Deduced a trap composed of 32 places in 587 ms of which 7 ms to minimize.
SMT process timed out in 31499ms, After SMT, problems are : Problem set: 0 solved, 1659 unsolved
Search for dead transitions found 0 dead transitions in 31529ms
Starting structural reductions in LTL mode, iteration 1 : 511/517 places, 1666/1708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36155 ms. Remains : 511/517 places, 1666/1708 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 597 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-14 finished in 36904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||G((X(p2)||p1)))))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-07-LTLFireability-04
Stuttering acceptance computed with spot in 415 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 517/517 places, 1708/1708 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 517 transition count 1701
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 510 transition count 1701
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 510 transition count 1547
Deduced a syphon composed of 154 places in 2 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 356 transition count 1547
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 328 place count 350 transition count 1505
Iterating global reduction 2 with 6 rules applied. Total rules applied 334 place count 350 transition count 1505
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 418 place count 308 transition count 1463
Applied a total of 418 rules in 93 ms. Remains 308 /517 variables (removed 209) and now considering 1463/1708 (removed 245) transitions.
[2024-06-01 07:57:39] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 07:57:39] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:57:39] [INFO ] Implicit Places using invariants in 766 ms returned []
[2024-06-01 07:57:39] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:57:39] [INFO ] Invariant cache hit.
[2024-06-01 07:57:40] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:57:42] [INFO ] Implicit Places using invariants and state equation in 2324 ms returned []
Implicit Place search using SMT with State Equation took 3092 ms to find 0 implicit places.
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:57:42] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:57:42] [INFO ] Invariant cache hit.
[2024-06-01 07:57:42] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:57:58] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 3 ms to minimize.
[2024-06-01 07:57:58] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:57:58] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:57:58] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:57:58] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:57:58] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:57:59] [INFO ] Deduced a trap composed of 54 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:58:00] [INFO ] Deduced a trap composed of 59 places in 333 ms of which 4 ms to minimize.
[2024-06-01 07:58:00] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:58:00] [INFO ] Deduced a trap composed of 11 places in 302 ms of which 4 ms to minimize.
[2024-06-01 07:58:01] [INFO ] Deduced a trap composed of 60 places in 303 ms of which 4 ms to minimize.
[2024-06-01 07:58:01] [INFO ] Deduced a trap composed of 59 places in 324 ms of which 4 ms to minimize.
[2024-06-01 07:58:01] [INFO ] Deduced a trap composed of 64 places in 358 ms of which 4 ms to minimize.
[2024-06-01 07:58:02] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:58:02] [INFO ] Deduced a trap composed of 53 places in 304 ms of which 4 ms to minimize.
[2024-06-01 07:58:02] [INFO ] Deduced a trap composed of 51 places in 318 ms of which 4 ms to minimize.
[2024-06-01 07:58:03] [INFO ] Deduced a trap composed of 58 places in 346 ms of which 4 ms to minimize.
[2024-06-01 07:58:03] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:58:04] [INFO ] Deduced a trap composed of 32 places in 348 ms of which 4 ms to minimize.
[2024-06-01 07:58:04] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:58:05] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:58:08] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:58:10] [INFO ] Deduced a trap composed of 14 places in 306 ms of which 4 ms to minimize.
[2024-06-01 07:58:11] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 46 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:58:24] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:58:26] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:58:29] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:58:32] [INFO ] Deduced a trap composed of 24 places in 479 ms of which 6 ms to minimize.
[2024-06-01 07:58:33] [INFO ] Deduced a trap composed of 20 places in 438 ms of which 5 ms to minimize.
[2024-06-01 07:58:33] [INFO ] Deduced a trap composed of 16 places in 439 ms of which 5 ms to minimize.
[2024-06-01 07:58:34] [INFO ] Deduced a trap composed of 17 places in 400 ms of which 4 ms to minimize.
[2024-06-01 07:58:34] [INFO ] Deduced a trap composed of 28 places in 406 ms of which 5 ms to minimize.
[2024-06-01 07:58:35] [INFO ] Deduced a trap composed of 18 places in 353 ms of which 4 ms to minimize.
[2024-06-01 07:58:35] [INFO ] Deduced a trap composed of 19 places in 379 ms of which 4 ms to minimize.
[2024-06-01 07:58:35] [INFO ] Deduced a trap composed of 21 places in 375 ms of which 4 ms to minimize.
[2024-06-01 07:58:36] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 3 ms to minimize.
[2024-06-01 07:58:36] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:58:36] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:58:36] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:58:37] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:58:37] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:58:38] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:58:38] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:58:38] [INFO ] Deduced a trap composed of 23 places in 363 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 66 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 44/44 constraints]
After SMT, in 61195ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 61226ms
Starting structural reductions in LI_LTL mode, iteration 1 : 308/517 places, 1463/1708 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 64417 ms. Remains : 308/517 places, 1463/1708 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 392 ms.
Product exploration explored 100000 steps with 0 reset in 441 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 143 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 707 ms. (56 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 117192 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 15
Probabilistic random walk after 117192 steps, saw 65430 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
[2024-06-01 07:58:48] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:58:48] [INFO ] Invariant cache hit.
[2024-06-01 07:58:48] [INFO ] State equation strengthened by 220 read => feed constraints.
Problem apf7 is UNSAT
Problem apf8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Problem apf6 is UNSAT
Problem apf12 is UNSAT
At refinement iteration 1 (OVERLAPS) 117/122 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 8/130 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 6/136 variables, 3/10 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 264/400 variables, 136/146 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 49/195 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/195 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 80/480 variables, 36/231 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 24/255 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 0/255 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 128/608 variables, 8/263 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/608 variables, 0/263 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 8/616 variables, 4/267 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/616 variables, 0/267 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 196/812 variables, 136/403 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/812 variables, 147/550 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 4 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 4 solved, 11 unsolved in 2037 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Problem apf3 is UNSAT
Problem apf11 is UNSAT
At refinement iteration 1 (OVERLAPS) 117/122 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 8/130 variables, 1/7 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 6/136 variables, 3/10 constraints. Problems are: Problem set: 6 solved, 9 unsolved
[2024-06-01 07:58:50] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 1/11 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/11 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 264/400 variables, 136/147 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 49/196 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/196 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 80/480 variables, 36/232 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 24/256 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/480 variables, 0/256 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 128/608 variables, 8/264 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/608 variables, 0/264 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 8/616 variables, 4/268 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/616 variables, 9/277 constraints. Problems are: Problem set: 6 solved, 9 unsolved
[2024-06-01 07:58:51] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:58:52] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 3 ms to minimize.
[2024-06-01 07:58:52] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 3 ms to minimize.
[2024-06-01 07:58:52] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 2 ms to minimize.
[2024-06-01 07:58:52] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:58:53] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/616 variables, 6/283 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/616 variables, 0/283 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 196/812 variables, 136/419 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 147/566 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/566 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/566 constraints. Problems are: Problem set: 6 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 566 constraints, problems are : Problem set: 6 solved, 9 unsolved in 3972 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 9/15 constraints, Known Traps: 7/7 constraints]
After SMT, in 6045ms problems are : Problem set: 6 solved, 9 unsolved
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 7 properties in 2821 ms.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 61 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 308/308 places, 1463/1463 transitions.
RANDOM walk for 40000 steps (8 resets) in 644 ms. (62 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 188496 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 188496 steps, saw 95677 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-06-01 07:59:00] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:59:00] [INFO ] Invariant cache hit.
[2024-06-01 07:59:00] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 117/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/130 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/136 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 264/400 variables, 136/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 49/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 80/480 variables, 36/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 24/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 128/608 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/608 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/616 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/616 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 196/812 variables, 136/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/812 variables, 147/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 2 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 117/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/130 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/136 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 264/400 variables, 136/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 49/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:59:01] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 80/480 variables, 36/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 24/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/480 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 128/608 variables, 8/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/608 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/616 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/616 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:59:01] [INFO ] Deduced a trap composed of 3 places in 319 ms of which 4 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 6 places in 362 ms of which 4 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 3 ms to minimize.
[2024-06-01 07:59:02] [INFO ] Deduced a trap composed of 37 places in 284 ms of which 4 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 4 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 3 ms to minimize.
[2024-06-01 07:59:03] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 3 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:59:04] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:59:05] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:59:05] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:59:05] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/616 variables, 17/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/616 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 196/812 variables, 136/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 147/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 570 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4930 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 constraints]
After SMT, in 5485ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 503 ms.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 60 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 58 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 07:59:06] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:59:06] [INFO ] Invariant cache hit.
[2024-06-01 07:59:07] [INFO ] Implicit Places using invariants in 679 ms returned []
[2024-06-01 07:59:07] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:59:07] [INFO ] Invariant cache hit.
[2024-06-01 07:59:07] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 07:59:09] [INFO ] Implicit Places using invariants and state equation in 2339 ms returned []
Implicit Place search using SMT with State Equation took 3022 ms to find 0 implicit places.
[2024-06-01 07:59:09] [INFO ] Redundant transitions in 45 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:59:09] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 07:59:09] [INFO ] Invariant cache hit.
[2024-06-01 07:59:09] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:59:28] [INFO ] Deduced a trap composed of 3 places in 403 ms of which 5 ms to minimize.
[2024-06-01 07:59:28] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:59:28] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:59:28] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:59:28] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:59:29] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:59:30] [INFO ] Deduced a trap composed of 54 places in 279 ms of which 3 ms to minimize.
[2024-06-01 07:59:30] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:59:30] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:59:30] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 4 ms to minimize.
[2024-06-01 07:59:31] [INFO ] Deduced a trap composed of 60 places in 348 ms of which 4 ms to minimize.
[2024-06-01 07:59:31] [INFO ] Deduced a trap composed of 59 places in 345 ms of which 4 ms to minimize.
[2024-06-01 07:59:32] [INFO ] Deduced a trap composed of 64 places in 332 ms of which 4 ms to minimize.
[2024-06-01 07:59:32] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:59:32] [INFO ] Deduced a trap composed of 53 places in 304 ms of which 4 ms to minimize.
[2024-06-01 07:59:32] [INFO ] Deduced a trap composed of 51 places in 300 ms of which 3 ms to minimize.
[2024-06-01 07:59:33] [INFO ] Deduced a trap composed of 58 places in 330 ms of which 4 ms to minimize.
[2024-06-01 07:59:33] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:59:34] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 4 ms to minimize.
[2024-06-01 07:59:34] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:59:35] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:59:38] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:59:40] [INFO ] Deduced a trap composed of 14 places in 319 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 45 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:59:48] [INFO ] Deduced a trap composed of 15 places in 270 ms of which 4 ms to minimize.
[2024-06-01 07:59:50] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:59:53] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:59:55] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:59:57] [INFO ] Deduced a trap composed of 25 places in 275 ms of which 3 ms to minimize.
[2024-06-01 07:59:57] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 3 ms to minimize.
[2024-06-01 07:59:58] [INFO ] Deduced a trap composed of 21 places in 376 ms of which 5 ms to minimize.
[2024-06-01 07:59:58] [INFO ] Deduced a trap composed of 16 places in 438 ms of which 5 ms to minimize.
[2024-06-01 07:59:58] [INFO ] Deduced a trap composed of 17 places in 446 ms of which 5 ms to minimize.
[2024-06-01 07:59:59] [INFO ] Deduced a trap composed of 28 places in 371 ms of which 5 ms to minimize.
[2024-06-01 07:59:59] [INFO ] Deduced a trap composed of 18 places in 388 ms of which 4 ms to minimize.
[2024-06-01 08:00:00] [INFO ] Deduced a trap composed of 23 places in 408 ms of which 5 ms to minimize.
[2024-06-01 08:00:00] [INFO ] Deduced a trap composed of 19 places in 385 ms of which 4 ms to minimize.
[2024-06-01 08:00:01] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 2 ms to minimize.
[2024-06-01 08:00:01] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
[2024-06-01 08:00:01] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:00:01] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:00:01] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-06-01 08:00:02] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:00:02] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:00:09] [INFO ] Deduced a trap composed of 54 places in 270 ms of which 4 ms to minimize.
[2024-06-01 08:00:09] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-01 08:00:10] [INFO ] Deduced a trap composed of 39 places in 327 ms of which 8 ms to minimize.
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 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(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 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 1)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 68 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 46/46 constraints]
After SMT, in 61070ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 61098ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64236 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1324 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 324 place count 101 transition count 220
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 363 place count 101 transition count 181
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 375 place count 95 transition count 181
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 381 place count 95 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 388 place count 95 transition count 168
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 431 place count 95 transition count 125
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 474 place count 52 transition count 125
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 481 place count 52 transition count 125
Applied a total of 481 rules in 31 ms. Remains 52 /308 variables (removed 256) and now considering 125/1463 (removed 1338) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 125 rows 52 cols
[2024-06-01 08:00:10] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 08:00:10] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 08:00:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 08:00:11] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 08:00:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 08:00:11] [INFO ] After 29ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 08:00:11] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:00:11] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:00:11] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:00:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 108 ms
TRAPS : Iteration 1
[2024-06-01 08:00:11] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:00:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
TRAPS : Iteration 2
[2024-06-01 08:00:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:00:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 3
[2024-06-01 08:00:11] [INFO ] After 340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 08:00:11] [INFO ] After 513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 608 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR (NOT p0) p1 (NOT p2))), (G (OR p0 p2)), (G (OR p0 p1 (NOT p2))), (G (OR p1 (NOT p2))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 519 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 422 ms :[true, (NOT p2), false, p2, (AND (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 409 ms :[true, (NOT p2), false, p2, (AND (NOT p1) (NOT p2)), false, false, false, false]
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 8 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 08:00:12] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 08:00:12] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 08:00:13] [INFO ] Implicit Places using invariants in 754 ms returned []
[2024-06-01 08:00:13] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:00:13] [INFO ] Invariant cache hit.
[2024-06-01 08:00:13] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 08:00:15] [INFO ] Implicit Places using invariants and state equation in 2239 ms returned []
Implicit Place search using SMT with State Equation took 2996 ms to find 0 implicit places.
Running 1456 sub problems to find dead transitions.
[2024-06-01 08:00:15] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:00:15] [INFO ] Invariant cache hit.
[2024-06-01 08:00:15] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:00:32] [INFO ] Deduced a trap composed of 3 places in 450 ms of which 5 ms to minimize.
[2024-06-01 08:00:32] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 2 ms to minimize.
[2024-06-01 08:00:32] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 2 ms to minimize.
[2024-06-01 08:00:32] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:00:32] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:00:32] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 4 ms to minimize.
[2024-06-01 08:00:34] [INFO ] Deduced a trap composed of 54 places in 272 ms of which 3 ms to minimize.
[2024-06-01 08:00:34] [INFO ] Deduced a trap composed of 59 places in 303 ms of which 4 ms to minimize.
[2024-06-01 08:00:34] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
[2024-06-01 08:00:35] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 4 ms to minimize.
[2024-06-01 08:00:35] [INFO ] Deduced a trap composed of 60 places in 344 ms of which 4 ms to minimize.
[2024-06-01 08:00:35] [INFO ] Deduced a trap composed of 59 places in 341 ms of which 5 ms to minimize.
[2024-06-01 08:00:36] [INFO ] Deduced a trap composed of 64 places in 357 ms of which 4 ms to minimize.
[2024-06-01 08:00:36] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:00:36] [INFO ] Deduced a trap composed of 53 places in 311 ms of which 4 ms to minimize.
[2024-06-01 08:00:37] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 4 ms to minimize.
[2024-06-01 08:00:37] [INFO ] Deduced a trap composed of 58 places in 353 ms of which 4 ms to minimize.
[2024-06-01 08:00:38] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 2 ms to minimize.
[2024-06-01 08:00:38] [INFO ] Deduced a trap composed of 32 places in 332 ms of which 4 ms to minimize.
[2024-06-01 08:00:38] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:00:39] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:00:42] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-06-01 08:00:45] [INFO ] Deduced a trap composed of 14 places in 275 ms of which 4 ms to minimize.
[2024-06-01 08:00:45] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 46 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:00:57] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2024-06-01 08:00:59] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-06-01 08:01:02] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
[2024-06-01 08:01:06] [INFO ] Deduced a trap composed of 24 places in 435 ms of which 5 ms to minimize.
[2024-06-01 08:01:06] [INFO ] Deduced a trap composed of 20 places in 427 ms of which 4 ms to minimize.
[2024-06-01 08:01:06] [INFO ] Deduced a trap composed of 16 places in 428 ms of which 5 ms to minimize.
[2024-06-01 08:01:07] [INFO ] Deduced a trap composed of 17 places in 429 ms of which 5 ms to minimize.
[2024-06-01 08:01:07] [INFO ] Deduced a trap composed of 28 places in 428 ms of which 5 ms to minimize.
[2024-06-01 08:01:08] [INFO ] Deduced a trap composed of 18 places in 387 ms of which 4 ms to minimize.
[2024-06-01 08:01:08] [INFO ] Deduced a trap composed of 19 places in 362 ms of which 4 ms to minimize.
[2024-06-01 08:01:09] [INFO ] Deduced a trap composed of 21 places in 385 ms of which 5 ms to minimize.
[2024-06-01 08:01:09] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 4 ms to minimize.
[2024-06-01 08:01:09] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 3 ms to minimize.
[2024-06-01 08:01:09] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 3 ms to minimize.
[2024-06-01 08:01:10] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-06-01 08:01:10] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:01:10] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-06-01 08:01:11] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 2 ms to minimize.
[2024-06-01 08:01:11] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2024-06-01 08:01:11] [INFO ] Deduced a trap composed of 23 places in 380 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 66 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 44/44 constraints]
After SMT, in 60880ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60897ms
Finished structural reductions in LTL mode , in 1 iterations and 63905 ms. Remains : 308/308 places, 1463/1463 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 418 ms :[true, (NOT p2), false, p2, (AND (NOT p1) (NOT p2)), false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 1495 ms. (26 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 148408 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 3
Probabilistic random walk after 148408 steps, saw 77874 distinct states, run finished after 3004 ms. (steps per millisecond=49 ) properties seen :0
[2024-06-01 08:01:20] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:01:20] [INFO ] Invariant cache hit.
[2024-06-01 08:01:20] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 117/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/130 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/136 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 264/400 variables, 136/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 49/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 80/480 variables, 36/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 24/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 128/608 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/608 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/616 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/616 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 196/812 variables, 136/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/812 variables, 147/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 3 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 117/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/130 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/136 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:01:21] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 2 ms to minimize.
[2024-06-01 08:01:22] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2024-06-01 08:01:22] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:01:22] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:01:22] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 264/400 variables, 136/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 49/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 80/480 variables, 36/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 24/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/480 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 128/608 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/608 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 8/616 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/616 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:01:22] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 3 ms to minimize.
[2024-06-01 08:01:23] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 2 ms to minimize.
[2024-06-01 08:01:23] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 2 ms to minimize.
[2024-06-01 08:01:23] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-06-01 08:01:23] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/616 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/616 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 196/812 variables, 136/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 147/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 563 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2640 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints]
After SMT, in 3386ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 592 ms.
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 58 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 308/308 places, 1463/1463 transitions.
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 419512 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 1
Probabilistic random walk after 419512 steps, saw 171932 distinct states, run finished after 3005 ms. (steps per millisecond=139 ) properties seen :0
[2024-06-01 08:01:28] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:01:28] [INFO ] Invariant cache hit.
[2024-06-01 08:01:28] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/194 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 120/314 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 21/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 192/506 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/506 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/518 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 294/812 variables, 204/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/812 variables, 188/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/194 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:01:28] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:01:29] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 3 ms to minimize.
[2024-06-01 08:01:29] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 3 ms to minimize.
[2024-06-01 08:01:29] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 2 ms to minimize.
[2024-06-01 08:01:29] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 2 ms to minimize.
[2024-06-01 08:01:30] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 4 ms to minimize.
[2024-06-01 08:01:30] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 3 ms to minimize.
[2024-06-01 08:01:30] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 3 ms to minimize.
[2024-06-01 08:01:30] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 2 ms to minimize.
[2024-06-01 08:01:31] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 3 ms to minimize.
[2024-06-01 08:01:31] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 3 ms to minimize.
[2024-06-01 08:01:31] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2024-06-01 08:01:31] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-06-01 08:01:31] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:01:31] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:01:31] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:01:32] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:01:32] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-06-01 08:01:32] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:01:32] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/518 variables, 19/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/518 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 294/812 variables, 204/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/812 variables, 188/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/812 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/812 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 571 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4289 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 20/20 constraints]
After SMT, in 4830ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 58 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 58 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 08:01:33] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:01:33] [INFO ] Invariant cache hit.
[2024-06-01 08:01:33] [INFO ] Implicit Places using invariants in 794 ms returned []
[2024-06-01 08:01:33] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:01:33] [INFO ] Invariant cache hit.
[2024-06-01 08:01:34] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 08:01:35] [INFO ] Implicit Places using invariants and state equation in 1940 ms returned []
Implicit Place search using SMT with State Equation took 2736 ms to find 0 implicit places.
[2024-06-01 08:01:35] [INFO ] Redundant transitions in 29 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 08:01:35] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:01:35] [INFO ] Invariant cache hit.
[2024-06-01 08:01:35] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:01:55] [INFO ] Deduced a trap composed of 3 places in 423 ms of which 5 ms to minimize.
[2024-06-01 08:01:55] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 3 ms to minimize.
[2024-06-01 08:01:55] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 2 ms to minimize.
[2024-06-01 08:01:55] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:01:55] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-06-01 08:01:56] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 3 ms to minimize.
[2024-06-01 08:01:57] [INFO ] Deduced a trap composed of 54 places in 276 ms of which 4 ms to minimize.
[2024-06-01 08:01:57] [INFO ] Deduced a trap composed of 59 places in 318 ms of which 4 ms to minimize.
[2024-06-01 08:01:58] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-06-01 08:01:58] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 4 ms to minimize.
[2024-06-01 08:01:58] [INFO ] Deduced a trap composed of 60 places in 332 ms of which 5 ms to minimize.
[2024-06-01 08:01:59] [INFO ] Deduced a trap composed of 59 places in 401 ms of which 5 ms to minimize.
[2024-06-01 08:01:59] [INFO ] Deduced a trap composed of 64 places in 359 ms of which 4 ms to minimize.
[2024-06-01 08:01:59] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:02:00] [INFO ] Deduced a trap composed of 53 places in 321 ms of which 5 ms to minimize.
[2024-06-01 08:02:00] [INFO ] Deduced a trap composed of 51 places in 316 ms of which 4 ms to minimize.
[2024-06-01 08:02:01] [INFO ] Deduced a trap composed of 58 places in 356 ms of which 4 ms to minimize.
[2024-06-01 08:02:01] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 2 ms to minimize.
[2024-06-01 08:02:02] [INFO ] Deduced a trap composed of 32 places in 353 ms of which 4 ms to minimize.
[2024-06-01 08:02:02] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:02:03] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
[2024-06-01 08:02:06] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.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 1.0)
(s198 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 44 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 22/44 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:02:14] [INFO ] Deduced a trap composed of 14 places in 355 ms of which 5 ms to minimize.
[2024-06-01 08:02:15] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 2 ms to minimize.
[2024-06-01 08:02:17] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2024-06-01 08:02:19] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:02:22] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:02:24] [INFO ] Deduced a trap composed of 23 places in 393 ms of which 4 ms to minimize.
[2024-06-01 08:02:25] [INFO ] Deduced a trap composed of 20 places in 384 ms of which 4 ms to minimize.
[2024-06-01 08:02:25] [INFO ] Deduced a trap composed of 16 places in 385 ms of which 4 ms to minimize.
[2024-06-01 08:02:26] [INFO ] Deduced a trap composed of 17 places in 399 ms of which 7 ms to minimize.
[2024-06-01 08:02:26] [INFO ] Deduced a trap composed of 28 places in 417 ms of which 5 ms to minimize.
[2024-06-01 08:02:27] [INFO ] Deduced a trap composed of 18 places in 419 ms of which 4 ms to minimize.
[2024-06-01 08:02:27] [INFO ] Deduced a trap composed of 23 places in 399 ms of which 4 ms to minimize.
[2024-06-01 08:02:27] [INFO ] Deduced a trap composed of 19 places in 383 ms of which 4 ms to minimize.
[2024-06-01 08:02:28] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 3 ms to minimize.
[2024-06-01 08:02:28] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 3 ms to minimize.
[2024-06-01 08:02:28] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 3 ms to minimize.
[2024-06-01 08:02:28] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 3 ms to minimize.
[2024-06-01 08:02:29] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:02:29] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 1 ms to minimize.
[2024-06-01 08:02:29] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 64 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 42/42 constraints]
After SMT, in 61200ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 61218ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64052 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1343 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 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 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 369 place count 99 transition count 177
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 383 place count 92 transition count 177
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 390 place count 92 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 397 place count 92 transition count 163
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 439 place count 92 transition count 121
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 481 place count 50 transition count 121
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 488 place count 50 transition count 121
Applied a total of 488 rules in 27 ms. Remains 50 /308 variables (removed 258) and now considering 121/1463 (removed 1342) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 50 cols
[2024-06-01 08:02:37] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 08:02:37] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:02:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 08:02:37] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:02:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 08:02:37] [INFO ] After 15ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:02:37] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
[2024-06-01 08:02:37] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:02:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
TRAPS : Iteration 1
[2024-06-01 08:02:37] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:02:37] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 325 ms.
Knowledge obtained : [(AND (NOT p2) p1)]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F p2)]
Knowledge based reduction with 1 factoid took 192 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 418 ms :[true, (NOT p2), false, p2, (AND (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 414 ms :[true, (NOT p2), false, p2, (AND (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 545 ms :[true, (NOT p2), false, p2, (AND (NOT p1) (NOT p2)), false, false, false, false]
Product exploration explored 100000 steps with 0 reset in 360 ms.
Product exploration explored 100000 steps with 0 reset in 422 ms.
Applying partial POR strategy [true, false, false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 410 ms :[true, (NOT p2), false, p2, (AND (NOT p1) (NOT p2)), false, false, false, false]
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 61 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 08:02:40] [INFO ] Redundant transitions in 43 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 08:02:40] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 08:02:40] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 08:02:40] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:02:57] [INFO ] Deduced a trap composed of 3 places in 423 ms of which 5 ms to minimize.
[2024-06-01 08:02:57] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 2 ms to minimize.
[2024-06-01 08:02:57] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 2 ms to minimize.
[2024-06-01 08:02:57] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:02:58] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:02:58] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 3 ms to minimize.
[2024-06-01 08:02:59] [INFO ] Deduced a trap composed of 44 places in 302 ms of which 4 ms to minimize.
[2024-06-01 08:03:00] [INFO ] Deduced a trap composed of 38 places in 262 ms of which 4 ms to minimize.
[2024-06-01 08:03:00] [INFO ] Deduced a trap composed of 42 places in 292 ms of which 4 ms to minimize.
[2024-06-01 08:03:00] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-06-01 08:03:01] [INFO ] Deduced a trap composed of 37 places in 314 ms of which 4 ms to minimize.
[2024-06-01 08:03:01] [INFO ] Deduced a trap composed of 80 places in 319 ms of which 4 ms to minimize.
[2024-06-01 08:03:01] [INFO ] Deduced a trap composed of 64 places in 306 ms of which 4 ms to minimize.
[2024-06-01 08:03:02] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:03:02] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:03:02] [INFO ] Deduced a trap composed of 71 places in 384 ms of which 4 ms to minimize.
[2024-06-01 08:03:03] [INFO ] Deduced a trap composed of 51 places in 370 ms of which 4 ms to minimize.
[2024-06-01 08:03:03] [INFO ] Deduced a trap composed of 53 places in 345 ms of which 4 ms to minimize.
[2024-06-01 08:03:03] [INFO ] Deduced a trap composed of 56 places in 320 ms of which 4 ms to minimize.
[2024-06-01 08:03:04] [INFO ] Deduced a trap composed of 75 places in 317 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:03:05] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:03:06] [INFO ] Deduced a trap composed of 38 places in 296 ms of which 4 ms to minimize.
[2024-06-01 08:03:08] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:03:10] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 2 ms to minimize.
[2024-06-01 08:03:10] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 47 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:03:17] [INFO ] Deduced a trap composed of 68 places in 273 ms of which 4 ms to minimize.
[2024-06-01 08:03:18] [INFO ] Deduced a trap composed of 63 places in 320 ms of which 4 ms to minimize.
[2024-06-01 08:03:19] [INFO ] Deduced a trap composed of 59 places in 297 ms of which 3 ms to minimize.
[2024-06-01 08:03:19] [INFO ] Deduced a trap composed of 53 places in 311 ms of which 4 ms to minimize.
[2024-06-01 08:03:19] [INFO ] Deduced a trap composed of 20 places in 298 ms of which 4 ms to minimize.
[2024-06-01 08:03:20] [INFO ] Deduced a trap composed of 63 places in 309 ms of which 4 ms to minimize.
[2024-06-01 08:03:20] [INFO ] Deduced a trap composed of 38 places in 351 ms of which 4 ms to minimize.
[2024-06-01 08:03:21] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 4 ms to minimize.
[2024-06-01 08:03:21] [INFO ] Deduced a trap composed of 61 places in 264 ms of which 3 ms to minimize.
[2024-06-01 08:03:22] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 4 ms to minimize.
[2024-06-01 08:03:22] [INFO ] Deduced a trap composed of 17 places in 316 ms of which 4 ms to minimize.
[2024-06-01 08:03:23] [INFO ] Deduced a trap composed of 63 places in 295 ms of which 4 ms to minimize.
[2024-06-01 08:03:23] [INFO ] Deduced a trap composed of 60 places in 266 ms of which 3 ms to minimize.
[2024-06-01 08:03:24] [INFO ] Deduced a trap composed of 64 places in 360 ms of which 5 ms to minimize.
[2024-06-01 08:03:24] [INFO ] Deduced a trap composed of 65 places in 340 ms of which 5 ms to minimize.
[2024-06-01 08:03:25] [INFO ] Deduced a trap composed of 60 places in 339 ms of which 5 ms to minimize.
[2024-06-01 08:03:25] [INFO ] Deduced a trap composed of 60 places in 293 ms of which 4 ms to minimize.
[2024-06-01 08:03:25] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2024-06-01 08:03:26] [INFO ] Deduced a trap composed of 66 places in 407 ms of which 4 ms to minimize.
[2024-06-01 08:03:26] [INFO ] Deduced a trap composed of 58 places in 402 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:03:33] [INFO ] Deduced a trap composed of 53 places in 260 ms of which 3 ms to minimize.
[2024-06-01 08:03:34] [INFO ] Deduced a trap composed of 42 places in 258 ms of which 4 ms to minimize.
[2024-06-01 08:03:35] [INFO ] Deduced a trap composed of 64 places in 356 ms of which 5 ms to minimize.
[2024-06-01 08:03:36] [INFO ] Deduced a trap composed of 43 places in 357 ms of which 4 ms to minimize.
[2024-06-01 08:03:36] [INFO ] Deduced a trap composed of 41 places in 305 ms of which 4 ms to minimize.
[2024-06-01 08:03:36] [INFO ] Deduced a trap composed of 51 places in 345 ms of which 4 ms to minimize.
[2024-06-01 08:03:37] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-06-01 08:03:38] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 4 ms to minimize.
[2024-06-01 08:03:38] [INFO ] Deduced a trap composed of 53 places in 306 ms of which 4 ms to minimize.
[2024-06-01 08:03:39] [INFO ] Deduced a trap composed of 60 places in 353 ms of which 5 ms to minimize.
[2024-06-01 08:03:39] [INFO ] Deduced a trap composed of 42 places in 277 ms of which 4 ms to minimize.
[2024-06-01 08:03:40] [INFO ] Deduced a trap composed of 53 places in 330 ms of which 3 ms to minimize.
[2024-06-01 08:03:40] [INFO ] Deduced a trap composed of 77 places in 398 ms of which 10 ms to minimize.
[2024-06-01 08:03:41] [INFO ] Deduced a trap composed of 66 places in 399 ms of which 5 ms to minimize.
[2024-06-01 08:03:41] [INFO ] Deduced a trap composed of 59 places in 383 ms of which 4 ms to minimize.
[2024-06-01 08:03:42] [INFO ] Deduced a trap composed of 62 places in 302 ms of which 4 ms to minimize.
SMT process timed out in 61527ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 61554ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61670 ms. Remains : 308/308 places, 1463/1463 transitions.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 8 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 08:03:42] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:03:42] [INFO ] Invariant cache hit.
[2024-06-01 08:03:42] [INFO ] Implicit Places using invariants in 750 ms returned []
[2024-06-01 08:03:42] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:03:42] [INFO ] Invariant cache hit.
[2024-06-01 08:03:43] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 08:03:45] [INFO ] Implicit Places using invariants and state equation in 2325 ms returned []
Implicit Place search using SMT with State Equation took 3078 ms to find 0 implicit places.
Running 1456 sub problems to find dead transitions.
[2024-06-01 08:03:45] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:03:45] [INFO ] Invariant cache hit.
[2024-06-01 08:03:45] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:04:03] [INFO ] Deduced a trap composed of 3 places in 418 ms of which 5 ms to minimize.
[2024-06-01 08:04:03] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 2 ms to minimize.
[2024-06-01 08:04:03] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
[2024-06-01 08:04:03] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2024-06-01 08:04:03] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-06-01 08:04:04] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 4 ms to minimize.
[2024-06-01 08:04:05] [INFO ] Deduced a trap composed of 54 places in 266 ms of which 3 ms to minimize.
[2024-06-01 08:04:05] [INFO ] Deduced a trap composed of 59 places in 315 ms of which 4 ms to minimize.
[2024-06-01 08:04:06] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2024-06-01 08:04:06] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 4 ms to minimize.
[2024-06-01 08:04:06] [INFO ] Deduced a trap composed of 60 places in 337 ms of which 4 ms to minimize.
[2024-06-01 08:04:07] [INFO ] Deduced a trap composed of 59 places in 342 ms of which 4 ms to minimize.
[2024-06-01 08:04:07] [INFO ] Deduced a trap composed of 64 places in 330 ms of which 4 ms to minimize.
[2024-06-01 08:04:07] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:04:08] [INFO ] Deduced a trap composed of 53 places in 316 ms of which 4 ms to minimize.
[2024-06-01 08:04:08] [INFO ] Deduced a trap composed of 51 places in 301 ms of which 4 ms to minimize.
[2024-06-01 08:04:08] [INFO ] Deduced a trap composed of 58 places in 317 ms of which 4 ms to minimize.
[2024-06-01 08:04:09] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 2 ms to minimize.
[2024-06-01 08:04:09] [INFO ] Deduced a trap composed of 32 places in 332 ms of which 4 ms to minimize.
[2024-06-01 08:04:10] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:04:10] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 44 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 22/44 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 4 ms to minimize.
[2024-06-01 08:04:25] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-06-01 08:04:27] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-06-01 08:04:30] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
[2024-06-01 08:04:33] [INFO ] Deduced a trap composed of 23 places in 478 ms of which 5 ms to minimize.
[2024-06-01 08:04:34] [INFO ] Deduced a trap composed of 20 places in 461 ms of which 5 ms to minimize.
[2024-06-01 08:04:34] [INFO ] Deduced a trap composed of 16 places in 612 ms of which 11 ms to minimize.
[2024-06-01 08:04:35] [INFO ] Deduced a trap composed of 17 places in 408 ms of which 5 ms to minimize.
[2024-06-01 08:04:35] [INFO ] Deduced a trap composed of 28 places in 413 ms of which 4 ms to minimize.
[2024-06-01 08:04:36] [INFO ] Deduced a trap composed of 18 places in 410 ms of which 5 ms to minimize.
[2024-06-01 08:04:36] [INFO ] Deduced a trap composed of 23 places in 399 ms of which 4 ms to minimize.
[2024-06-01 08:04:37] [INFO ] Deduced a trap composed of 19 places in 384 ms of which 4 ms to minimize.
[2024-06-01 08:04:37] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 4 ms to minimize.
[2024-06-01 08:04:37] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 3 ms to minimize.
[2024-06-01 08:04:37] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 2 ms to minimize.
[2024-06-01 08:04:38] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 2 ms to minimize.
[2024-06-01 08:04:38] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 2 ms to minimize.
[2024-06-01 08:04:38] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:04:38] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 64 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 42/42 constraints]
After SMT, in 61090ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 61117ms
Finished structural reductions in LTL mode , in 1 iterations and 64209 ms. Remains : 308/308 places, 1463/1463 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-04 finished in 428063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(p1)||X(G(p2))))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-07-LTLFireability-05
Stuttering acceptance computed with spot in 518 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 8 out of 517 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 517/517 places, 1708/1708 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 517 transition count 1701
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 510 transition count 1701
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 510 transition count 1547
Deduced a syphon composed of 154 places in 2 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 356 transition count 1547
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 327 place count 351 transition count 1512
Iterating global reduction 2 with 5 rules applied. Total rules applied 332 place count 351 transition count 1512
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 416 place count 309 transition count 1470
Applied a total of 416 rules in 81 ms. Remains 309 /517 variables (removed 208) and now considering 1470/1708 (removed 238) transitions.
[2024-06-01 08:04:47] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
// Phase 1: matrix 511 rows 309 cols
[2024-06-01 08:04:47] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 08:04:47] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-06-01 08:04:47] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2024-06-01 08:04:47] [INFO ] Invariant cache hit.
[2024-06-01 08:04:48] [INFO ] State equation strengthened by 226 read => feed constraints.
[2024-06-01 08:04:50] [INFO ] Implicit Places using invariants and state equation in 2157 ms returned []
Implicit Place search using SMT with State Equation took 2868 ms to find 0 implicit places.
Running 1463 sub problems to find dead transitions.
[2024-06-01 08:04:50] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2024-06-01 08:04:50] [INFO ] Invariant cache hit.
[2024-06-01 08:04:50] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
[2024-06-01 08:05:08] [INFO ] Deduced a trap composed of 3 places in 320 ms of which 4 ms to minimize.
[2024-06-01 08:05:08] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 2 ms to minimize.
[2024-06-01 08:05:08] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2024-06-01 08:05:09] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-06-01 08:05:09] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-06-01 08:05:09] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 3 ms to minimize.
[2024-06-01 08:05:09] [INFO ] Deduced a trap composed of 59 places in 272 ms of which 4 ms to minimize.
[2024-06-01 08:05:11] [INFO ] Deduced a trap composed of 41 places in 287 ms of which 4 ms to minimize.
[2024-06-01 08:05:11] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 3 ms to minimize.
[2024-06-01 08:05:11] [INFO ] Deduced a trap composed of 64 places in 294 ms of which 4 ms to minimize.
[2024-06-01 08:05:11] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:05:12] [INFO ] Deduced a trap composed of 39 places in 309 ms of which 5 ms to minimize.
[2024-06-01 08:05:12] [INFO ] Deduced a trap composed of 51 places in 309 ms of which 4 ms to minimize.
[2024-06-01 08:05:12] [INFO ] Deduced a trap composed of 62 places in 344 ms of which 4 ms to minimize.
[2024-06-01 08:05:13] [INFO ] Deduced a trap composed of 77 places in 343 ms of which 4 ms to minimize.
[2024-06-01 08:05:13] [INFO ] Deduced a trap composed of 59 places in 353 ms of which 4 ms to minimize.
[2024-06-01 08:05:14] [INFO ] Deduced a trap composed of 57 places in 261 ms of which 3 ms to minimize.
[2024-06-01 08:05:14] [INFO ] Deduced a trap composed of 60 places in 310 ms of which 4 ms to minimize.
[2024-06-01 08:05:14] [INFO ] Deduced a trap composed of 58 places in 290 ms of which 4 ms to minimize.
[2024-06-01 08:05:15] [INFO ] Deduced a trap composed of 25 places in 355 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
[2024-06-01 08:05:16] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:05:16] [INFO ] Deduced a trap composed of 45 places in 273 ms of which 4 ms to minimize.
[2024-06-01 08:05:16] [INFO ] Deduced a trap composed of 37 places in 318 ms of which 4 ms to minimize.
[2024-06-01 08:05:18] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-06-01 08:05:18] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 3 ms to minimize.
[2024-06-01 08:05:18] [INFO ] Deduced a trap composed of 75 places in 405 ms of which 4 ms to minimize.
[2024-06-01 08:05:19] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 4 ms to minimize.
[2024-06-01 08:05:19] [INFO ] Deduced a trap composed of 59 places in 300 ms of which 4 ms to minimize.
[2024-06-01 08:05:19] [INFO ] Deduced a trap composed of 53 places in 218 ms of which 2 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 75 places in 317 ms of which 3 ms to minimize.
[2024-06-01 08:05:21] [INFO ] Deduced a trap composed of 66 places in 391 ms of which 4 ms to minimize.
[2024-06-01 08:05:21] [INFO ] Deduced a trap composed of 74 places in 279 ms of which 2 ms to minimize.
SMT process timed out in 31340ms, After SMT, problems are : Problem set: 0 solved, 1463 unsolved
Search for dead transitions found 0 dead transitions in 31367ms
Starting structural reductions in LI_LTL mode, iteration 1 : 309/517 places, 1470/1708 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 34321 ms. Remains : 309/517 places, 1470/1708 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 263 ms.
Product exploration explored 100000 steps with 0 reset in 350 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 156 ms. Reduced automaton from 11 states, 35 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 737 ms. (54 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 80592 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 6
Probabilistic random walk after 80592 steps, saw 45992 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2024-06-01 08:05:26] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2024-06-01 08:05:26] [INFO ] Invariant cache hit.
[2024-06-01 08:05:26] [INFO ] State equation strengthened by 226 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 86/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 70/162 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 18/180 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 331/511 variables, 180/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 84/277 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 60/571 variables, 27/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 21/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/571 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 96/667 variables, 6/331 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/667 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 6/673 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/673 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 147/820 variables, 102/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/820 variables, 121/557 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/820 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/820 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 557 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1131 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 309/309 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 86/92 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 70/162 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 08:05:27] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 2 ms to minimize.
[2024-06-01 08:05:27] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 18/180 variables, 4/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 08:05:28] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 3 ms to minimize.
[2024-06-01 08:05:28] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 331/511 variables, 180/197 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 84/281 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/511 variables, 0/281 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 60/571 variables, 27/308 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/571 variables, 21/329 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/571 variables, 0/329 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 96/667 variables, 6/335 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/667 variables, 0/335 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 6/673 variables, 3/338 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/673 variables, 5/343 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 08:05:28] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
[2024-06-01 08:05:28] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2024-06-01 08:05:29] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:05:29] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-06-01 08:05:29] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/673 variables, 5/348 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/673 variables, 0/348 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 147/820 variables, 102/450 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/820 variables, 121/571 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/820 variables, 0/571 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/820 variables, 0/571 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 571 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2552 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 309/309 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 3705ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 1124 ms.
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1470/1470 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 308 transition count 1463
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 308 transition count 1463
Applied a total of 2 rules in 65 ms. Remains 308 /309 variables (removed 1) and now considering 1463/1470 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 308/309 places, 1463/1470 transitions.
RANDOM walk for 40000 steps (8 resets) in 1217 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 203560 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 2
Probabilistic random walk after 203560 steps, saw 102023 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-06-01 08:05:34] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 08:05:34] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 08:05:34] [INFO ] State equation strengthened by 220 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) 85/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/161 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/179 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 324/503 variables, 179/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 78/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 60/563 variables, 27/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 21/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/563 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 96/659 variables, 6/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/659 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/665 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/665 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 147/812 variables, 102/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/812 variables, 121/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 2 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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
At refinement iteration 1 (OVERLAPS) 85/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 70/161 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:05:35] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/179 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:05:35] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 2 ms to minimize.
[2024-06-01 08:05:35] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 324/503 variables, 179/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 78/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:05:35] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 60/563 variables, 27/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/563 variables, 21/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/563 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/659 variables, 6/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/659 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/665 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:05:36] [INFO ] Deduced a trap composed of 3 places in 276 ms of which 3 ms to minimize.
[2024-06-01 08:05:36] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 4 ms to minimize.
[2024-06-01 08:05:37] [INFO ] Deduced a trap composed of 3 places in 269 ms of which 3 ms to minimize.
[2024-06-01 08:05:37] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 3 ms to minimize.
[2024-06-01 08:05:37] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 3 ms to minimize.
[2024-06-01 08:05:37] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 3 ms to minimize.
[2024-06-01 08:05:38] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 3 ms to minimize.
[2024-06-01 08:05:38] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 3 ms to minimize.
[2024-06-01 08:05:38] [INFO ] Deduced a trap composed of 30 places in 351 ms of which 4 ms to minimize.
[2024-06-01 08:05:38] [INFO ] Deduced a trap composed of 63 places in 357 ms of which 4 ms to minimize.
[2024-06-01 08:05:39] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:05:39] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 12/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/665 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 147/812 variables, 102/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 121/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4540 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints]
After SMT, in 4998ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 489 ms.
Support contains 6 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 58 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 58 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 08:05:40] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:05:40] [INFO ] Invariant cache hit.
[2024-06-01 08:05:41] [INFO ] Implicit Places using invariants in 733 ms returned []
[2024-06-01 08:05:41] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:05:41] [INFO ] Invariant cache hit.
[2024-06-01 08:05:41] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 08:05:43] [INFO ] Implicit Places using invariants and state equation in 2224 ms returned []
Implicit Place search using SMT with State Equation took 2959 ms to find 0 implicit places.
[2024-06-01 08:05:43] [INFO ] Redundant transitions in 45 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 08:05:43] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:05:43] [INFO ] Invariant cache hit.
[2024-06-01 08:05:43] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:06:01] [INFO ] Deduced a trap composed of 3 places in 423 ms of which 5 ms to minimize.
[2024-06-01 08:06:01] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 3 ms to minimize.
[2024-06-01 08:06:01] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2024-06-01 08:06:01] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-06-01 08:06:02] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:06:02] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 4 ms to minimize.
[2024-06-01 08:06:03] [INFO ] Deduced a trap composed of 54 places in 278 ms of which 4 ms to minimize.
[2024-06-01 08:06:04] [INFO ] Deduced a trap composed of 59 places in 302 ms of which 4 ms to minimize.
[2024-06-01 08:06:04] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2024-06-01 08:06:04] [INFO ] Deduced a trap composed of 11 places in 315 ms of which 4 ms to minimize.
[2024-06-01 08:06:04] [INFO ] Deduced a trap composed of 60 places in 356 ms of which 5 ms to minimize.
[2024-06-01 08:06:05] [INFO ] Deduced a trap composed of 59 places in 337 ms of which 4 ms to minimize.
[2024-06-01 08:06:05] [INFO ] Deduced a trap composed of 64 places in 319 ms of which 4 ms to minimize.
[2024-06-01 08:06:05] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:06:06] [INFO ] Deduced a trap composed of 53 places in 311 ms of which 4 ms to minimize.
[2024-06-01 08:06:06] [INFO ] Deduced a trap composed of 51 places in 312 ms of which 4 ms to minimize.
[2024-06-01 08:06:07] [INFO ] Deduced a trap composed of 58 places in 333 ms of which 4 ms to minimize.
[2024-06-01 08:06:07] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2024-06-01 08:06:07] [INFO ] Deduced a trap composed of 32 places in 331 ms of which 5 ms to minimize.
[2024-06-01 08:06:08] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:06:08] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:06:12] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 14 places in 321 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 45 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:06:23] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 4 ms to minimize.
[2024-06-01 08:06:26] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:06:28] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-06-01 08:06:31] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2024-06-01 08:06:34] [INFO ] Deduced a trap composed of 25 places in 429 ms of which 5 ms to minimize.
[2024-06-01 08:06:35] [INFO ] Deduced a trap composed of 21 places in 435 ms of which 5 ms to minimize.
[2024-06-01 08:06:35] [INFO ] Deduced a trap composed of 21 places in 480 ms of which 5 ms to minimize.
[2024-06-01 08:06:36] [INFO ] Deduced a trap composed of 16 places in 456 ms of which 5 ms to minimize.
[2024-06-01 08:06:36] [INFO ] Deduced a trap composed of 17 places in 431 ms of which 4 ms to minimize.
[2024-06-01 08:06:36] [INFO ] Deduced a trap composed of 28 places in 406 ms of which 5 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 18 places in 394 ms of which 4 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 23 places in 406 ms of which 4 ms to minimize.
[2024-06-01 08:06:38] [INFO ] Deduced a trap composed of 19 places in 367 ms of which 5 ms to minimize.
[2024-06-01 08:06:38] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 2 ms to minimize.
[2024-06-01 08:06:38] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-06-01 08:06:38] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:06:39] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-06-01 08:06:39] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-06-01 08:06:40] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-06-01 08:06:40] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 1)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 65 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 43/43 constraints]
After SMT, in 61214ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 61242ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64314 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1313 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 266 transition count 318
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 121 place count 206 transition count 318
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 121 place count 206 transition count 303
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 158 place count 184 transition count 303
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 322 place count 102 transition count 221
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 360 place count 102 transition count 183
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 370 place count 97 transition count 183
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 375 place count 97 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 382 place count 97 transition count 171
Free-agglomeration rule applied 44 times.
Iterating global reduction 4 with 44 rules applied. Total rules applied 426 place count 97 transition count 127
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 4 with 44 rules applied. Total rules applied 470 place count 53 transition count 127
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 477 place count 53 transition count 127
Applied a total of 477 rules in 19 ms. Remains 53 /308 variables (removed 255) and now considering 127/1463 (removed 1336) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 127 rows 53 cols
[2024-06-01 08:06:44] [INFO ] Computed 15 invariants in 0 ms
[2024-06-01 08:06:44] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 08:06:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-01 08:06:44] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 08:06:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 08:06:44] [INFO ] After 27ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 08:06:44] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:06:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 1
[2024-06-01 08:06:44] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 08:06:44] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 323 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (NOT p1)), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 27 factoid took 334 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 309 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 1470/1470 transitions.
Applied a total of 0 rules in 8 ms. Remains 309 /309 variables (removed 0) and now considering 1470/1470 (removed 0) transitions.
[2024-06-01 08:06:45] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
// Phase 1: matrix 511 rows 309 cols
[2024-06-01 08:06:45] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 08:06:46] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-06-01 08:06:46] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2024-06-01 08:06:46] [INFO ] Invariant cache hit.
[2024-06-01 08:06:46] [INFO ] State equation strengthened by 226 read => feed constraints.
[2024-06-01 08:06:48] [INFO ] Implicit Places using invariants and state equation in 2173 ms returned []
Implicit Place search using SMT with State Equation took 2810 ms to find 0 implicit places.
Running 1463 sub problems to find dead transitions.
[2024-06-01 08:06:48] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2024-06-01 08:06:48] [INFO ] Invariant cache hit.
[2024-06-01 08:06:48] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
[2024-06-01 08:07:06] [INFO ] Deduced a trap composed of 3 places in 435 ms of which 5 ms to minimize.
[2024-06-01 08:07:06] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 2 ms to minimize.
[2024-06-01 08:07:07] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2024-06-01 08:07:07] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2024-06-01 08:07:07] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:07:07] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 4 ms to minimize.
[2024-06-01 08:07:07] [INFO ] Deduced a trap composed of 59 places in 271 ms of which 4 ms to minimize.
[2024-06-01 08:07:09] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 2 ms to minimize.
[2024-06-01 08:07:09] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 3 ms to minimize.
[2024-06-01 08:07:09] [INFO ] Deduced a trap composed of 64 places in 277 ms of which 4 ms to minimize.
[2024-06-01 08:07:09] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:07:09] [INFO ] Deduced a trap composed of 39 places in 316 ms of which 4 ms to minimize.
[2024-06-01 08:07:10] [INFO ] Deduced a trap composed of 51 places in 261 ms of which 4 ms to minimize.
[2024-06-01 08:07:10] [INFO ] Deduced a trap composed of 62 places in 357 ms of which 4 ms to minimize.
[2024-06-01 08:07:11] [INFO ] Deduced a trap composed of 77 places in 348 ms of which 4 ms to minimize.
[2024-06-01 08:07:11] [INFO ] Deduced a trap composed of 59 places in 353 ms of which 5 ms to minimize.
[2024-06-01 08:07:11] [INFO ] Deduced a trap composed of 57 places in 227 ms of which 2 ms to minimize.
[2024-06-01 08:07:12] [INFO ] Deduced a trap composed of 60 places in 169 ms of which 3 ms to minimize.
[2024-06-01 08:07:12] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 2 ms to minimize.
[2024-06-01 08:07:12] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
[2024-06-01 08:07:13] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:07:13] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 3 ms to minimize.
[2024-06-01 08:07:13] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 3 ms to minimize.
[2024-06-01 08:07:15] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:07:15] [INFO ] Deduced a trap composed of 38 places in 257 ms of which 3 ms to minimize.
[2024-06-01 08:07:15] [INFO ] Deduced a trap composed of 75 places in 313 ms of which 3 ms to minimize.
[2024-06-01 08:07:16] [INFO ] Deduced a trap composed of 25 places in 357 ms of which 4 ms to minimize.
[2024-06-01 08:07:16] [INFO ] Deduced a trap composed of 59 places in 342 ms of which 4 ms to minimize.
[2024-06-01 08:07:16] [INFO ] Deduced a trap composed of 53 places in 308 ms of which 4 ms to minimize.
[2024-06-01 08:07:17] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 2 ms to minimize.
[2024-06-01 08:07:17] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:07:17] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-06-01 08:07:17] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-06-01 08:07:17] [INFO ] Deduced a trap composed of 75 places in 419 ms of which 4 ms to minimize.
[2024-06-01 08:07:18] [INFO ] Deduced a trap composed of 66 places in 412 ms of which 5 ms to minimize.
[2024-06-01 08:07:18] [INFO ] Deduced a trap composed of 74 places in 364 ms of which 5 ms to minimize.
[2024-06-01 08:07:19] [INFO ] Deduced a trap composed of 64 places in 399 ms of which 5 ms to minimize.
[2024-06-01 08:07:19] [INFO ] Deduced a trap composed of 38 places in 400 ms of which 5 ms to minimize.
[2024-06-01 08:07:19] [INFO ] Deduced a trap composed of 58 places in 357 ms of which 4 ms to minimize.
SMT process timed out in 31223ms, After SMT, problems are : Problem set: 0 solved, 1463 unsolved
Search for dead transitions found 0 dead transitions in 31251ms
Finished structural reductions in LTL mode , in 1 iterations and 34073 ms. Remains : 309/309 places, 1470/1470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1), (X (X p2)), (X (X p1)), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1301 ms. (30 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 165960 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 3
Probabilistic random walk after 165960 steps, saw 86631 distinct states, run finished after 3007 ms. (steps per millisecond=55 ) properties seen :0
[2024-06-01 08:07:23] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2024-06-01 08:07:23] [INFO ] Invariant cache hit.
[2024-06-01 08:07:23] [INFO ] State equation strengthened by 226 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 86/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 70/162 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 18/180 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 331/511 variables, 180/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 84/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 60/571 variables, 27/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 21/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/571 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 96/667 variables, 6/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/667 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 6/673 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/673 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 147/820 variables, 102/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/820 variables, 121/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/820 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/820 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 557 constraints, problems are : Problem set: 0 solved, 3 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 309/309 constraints, ReadFeed: 226/226 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 86/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 70/162 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:07:25] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:07:25] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 18/180 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:07:25] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 3 ms to minimize.
[2024-06-01 08:07:25] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 331/511 variables, 180/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 84/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/511 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 60/571 variables, 27/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/571 variables, 21/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/571 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 96/667 variables, 6/335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/667 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 6/673 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/673 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:07:26] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/673 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/673 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 147/820 variables, 102/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/820 variables, 121/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:07:26] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/820 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/820 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/820 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 566 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2247 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 309/309 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 3119ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 773 ms.
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1470/1470 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 308 transition count 1463
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 308 transition count 1463
Applied a total of 2 rules in 70 ms. Remains 308 /309 variables (removed 1) and now considering 1463/1470 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 308/309 places, 1463/1470 transitions.
RANDOM walk for 40000 steps (8 resets) in 1003 ms. (39 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 205304 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 3
Probabilistic random walk after 205304 steps, saw 102835 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-06-01 08:07:31] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 08:07:31] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 08:07:31] [INFO ] State equation strengthened by 220 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 70/161 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 18/179 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 324/503 variables, 179/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 78/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 60/563 variables, 27/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 21/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/563 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 96/659 variables, 6/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/659 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 6/665 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/665 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 147/812 variables, 102/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/812 variables, 121/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 3 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 70/161 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:07:32] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:07:32] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 18/179 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:07:32] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 324/503 variables, 179/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 78/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 60/563 variables, 27/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/563 variables, 21/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/563 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 96/659 variables, 6/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/659 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 6/665 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:07:33] [INFO ] Deduced a trap composed of 3 places in 420 ms of which 4 ms to minimize.
[2024-06-01 08:07:34] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 3 ms to minimize.
[2024-06-01 08:07:34] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 147/812 variables, 102/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 121/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/812 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 559 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2681 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 3438ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 102 ms.
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 63 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 308/308 places, 1463/1463 transitions.
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 438928 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 438928 steps, saw 178062 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
[2024-06-01 08:07:38] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:07:38] [INFO ] Invariant cache hit.
[2024-06-01 08:07:38] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/84 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 204/297 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 28/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 100/397 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 22/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 160/557 variables, 10/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/567 variables, 5/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 245/812 variables, 170/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/812 variables, 170/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/84 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:07:38] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/93 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:07:38] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 204/297 variables, 93/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 28/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/297 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 100/397 variables, 45/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 22/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/557 variables, 10/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/557 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/567 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/567 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:07:39] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 3 ms to minimize.
[2024-06-01 08:07:39] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 3 ms to minimize.
[2024-06-01 08:07:39] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/567 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/567 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 245/812 variables, 170/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 170/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/812 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1416 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1893ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 57 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 56 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-06-01 08:07:40] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:07:40] [INFO ] Invariant cache hit.
[2024-06-01 08:07:41] [INFO ] Implicit Places using invariants in 740 ms returned []
[2024-06-01 08:07:41] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:07:41] [INFO ] Invariant cache hit.
[2024-06-01 08:07:41] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 08:07:43] [INFO ] Implicit Places using invariants and state equation in 2063 ms returned []
Implicit Place search using SMT with State Equation took 2805 ms to find 0 implicit places.
[2024-06-01 08:07:43] [INFO ] Redundant transitions in 41 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 08:07:43] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:07:43] [INFO ] Invariant cache hit.
[2024-06-01 08:07:43] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:08:00] [INFO ] Deduced a trap composed of 3 places in 404 ms of which 4 ms to minimize.
[2024-06-01 08:08:00] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 3 ms to minimize.
[2024-06-01 08:08:00] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 2 ms to minimize.
[2024-06-01 08:08:01] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2024-06-01 08:08:01] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:08:01] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 4 ms to minimize.
[2024-06-01 08:08:02] [INFO ] Deduced a trap composed of 54 places in 280 ms of which 4 ms to minimize.
[2024-06-01 08:08:03] [INFO ] Deduced a trap composed of 59 places in 311 ms of which 5 ms to minimize.
[2024-06-01 08:08:03] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 2 ms to minimize.
[2024-06-01 08:08:03] [INFO ] Deduced a trap composed of 11 places in 299 ms of which 4 ms to minimize.
[2024-06-01 08:08:04] [INFO ] Deduced a trap composed of 60 places in 337 ms of which 4 ms to minimize.
[2024-06-01 08:08:04] [INFO ] Deduced a trap composed of 59 places in 337 ms of which 4 ms to minimize.
[2024-06-01 08:08:04] [INFO ] Deduced a trap composed of 64 places in 339 ms of which 5 ms to minimize.
[2024-06-01 08:08:05] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-06-01 08:08:05] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 4 ms to minimize.
[2024-06-01 08:08:05] [INFO ] Deduced a trap composed of 51 places in 286 ms of which 4 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 58 places in 321 ms of which 4 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 2 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 32 places in 323 ms of which 4 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:08:08] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:08:11] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:08:13] [INFO ] Deduced a trap composed of 14 places in 304 ms of which 4 ms to minimize.
[2024-06-01 08:08:14] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 4 ms to minimize.
SMT process timed out in 31149ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 31180ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34098 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 366 place count 100 transition count 179
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 378 place count 94 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 384 place count 94 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 391 place count 94 transition count 166
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 434 place count 94 transition count 123
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 477 place count 51 transition count 123
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 484 place count 51 transition count 123
Applied a total of 484 rules in 32 ms. Remains 51 /308 variables (removed 257) and now considering 123/1463 (removed 1340) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 51 cols
[2024-06-01 08:08:14] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 08:08:14] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:08:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 08:08:14] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:08:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 08:08:14] [INFO ] After 14ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:08:14] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:08:14] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 238 ms.
Knowledge obtained : [(AND p2 p1), (X (X p2)), (X (X p1)), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 397 ms.
Product exploration explored 100000 steps with 0 reset in 388 ms.
Applying partial POR strategy [true, true, false, true, false, false]
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 1470/1470 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 308 transition count 1463
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 308 transition count 1463
Applied a total of 2 rules in 70 ms. Remains 308 /309 variables (removed 1) and now considering 1463/1470 (removed 7) transitions.
[2024-06-01 08:08:16] [INFO ] Redundant transitions in 44 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 08:08:16] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-06-01 08:08:16] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 08:08:16] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:08:35] [INFO ] Deduced a trap composed of 3 places in 389 ms of which 5 ms to minimize.
[2024-06-01 08:08:35] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 3 ms to minimize.
[2024-06-01 08:08:35] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 2 ms to minimize.
[2024-06-01 08:08:35] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:08:35] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:08:36] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 3 ms to minimize.
[2024-06-01 08:08:37] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 4 ms to minimize.
[2024-06-01 08:08:38] [INFO ] Deduced a trap composed of 38 places in 289 ms of which 4 ms to minimize.
[2024-06-01 08:08:38] [INFO ] Deduced a trap composed of 42 places in 281 ms of which 4 ms to minimize.
[2024-06-01 08:08:38] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:08:39] [INFO ] Deduced a trap composed of 37 places in 302 ms of which 4 ms to minimize.
[2024-06-01 08:08:39] [INFO ] Deduced a trap composed of 80 places in 305 ms of which 4 ms to minimize.
[2024-06-01 08:08:39] [INFO ] Deduced a trap composed of 64 places in 322 ms of which 4 ms to minimize.
[2024-06-01 08:08:40] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-06-01 08:08:40] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:08:40] [INFO ] Deduced a trap composed of 71 places in 371 ms of which 4 ms to minimize.
[2024-06-01 08:08:41] [INFO ] Deduced a trap composed of 51 places in 366 ms of which 4 ms to minimize.
[2024-06-01 08:08:41] [INFO ] Deduced a trap composed of 53 places in 350 ms of which 4 ms to minimize.
[2024-06-01 08:08:41] [INFO ] Deduced a trap composed of 56 places in 312 ms of which 4 ms to minimize.
[2024-06-01 08:08:42] [INFO ] Deduced a trap composed of 75 places in 377 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:08:43] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-06-01 08:08:44] [INFO ] Deduced a trap composed of 38 places in 299 ms of which 3 ms to minimize.
[2024-06-01 08:08:46] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 45 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:08:55] [INFO ] Deduced a trap composed of 14 places in 306 ms of which 4 ms to minimize.
[2024-06-01 08:08:56] [INFO ] Deduced a trap composed of 68 places in 301 ms of which 4 ms to minimize.
[2024-06-01 08:08:56] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:08:58] [INFO ] Deduced a trap composed of 54 places in 302 ms of which 4 ms to minimize.
[2024-06-01 08:08:58] [INFO ] Deduced a trap composed of 51 places in 343 ms of which 4 ms to minimize.
[2024-06-01 08:08:59] [INFO ] Deduced a trap composed of 17 places in 308 ms of which 4 ms to minimize.
[2024-06-01 08:09:00] [INFO ] Deduced a trap composed of 19 places in 310 ms of which 4 ms to minimize.
[2024-06-01 08:09:01] [INFO ] Deduced a trap composed of 46 places in 388 ms of which 5 ms to minimize.
[2024-06-01 08:09:02] [INFO ] Deduced a trap composed of 19 places in 344 ms of which 4 ms to minimize.
[2024-06-01 08:09:03] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-06-01 08:09:04] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 3 ms to minimize.
[2024-06-01 08:09:05] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-06-01 08:09:05] [INFO ] Deduced a trap composed of 44 places in 398 ms of which 5 ms to minimize.
[2024-06-01 08:09:06] [INFO ] Deduced a trap composed of 41 places in 383 ms of which 5 ms to minimize.
[2024-06-01 08:09:07] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2024-06-01 08:09:07] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:09:08] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 3 ms to minimize.
[2024-06-01 08:09:08] [INFO ] Deduced a trap composed of 18 places in 228 ms of which 4 ms to minimize.
[2024-06-01 08:09:09] [INFO ] Deduced a trap composed of 53 places in 377 ms of which 4 ms to minimize.
[2024-06-01 08:09:10] [INFO ] Deduced a trap composed of 58 places in 340 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:09:15] [INFO ] Deduced a trap composed of 53 places in 316 ms of which 4 ms to minimize.
[2024-06-01 08:09:15] [INFO ] Deduced a trap composed of 55 places in 300 ms of which 4 ms to minimize.
[2024-06-01 08:09:16] [INFO ] Deduced a trap composed of 53 places in 280 ms of which 4 ms to minimize.
[2024-06-01 08:09:17] [INFO ] Deduced a trap composed of 42 places in 259 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 69 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 47/47 constraints]
After SMT, in 61475ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 61502ms
Starting structural reductions in SI_LTL mode, iteration 1 : 308/309 places, 1463/1470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61627 ms. Remains : 308/309 places, 1463/1470 transitions.
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 1470/1470 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 308 transition count 1463
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 308 transition count 1463
Applied a total of 2 rules in 18 ms. Remains 308 /309 variables (removed 1) and now considering 1463/1470 (removed 7) transitions.
[2024-06-01 08:09:18] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:09:18] [INFO ] Invariant cache hit.
[2024-06-01 08:09:19] [INFO ] Implicit Places using invariants in 748 ms returned []
[2024-06-01 08:09:19] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:09:19] [INFO ] Invariant cache hit.
[2024-06-01 08:09:19] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-06-01 08:09:21] [INFO ] Implicit Places using invariants and state equation in 2208 ms returned []
Implicit Place search using SMT with State Equation took 2960 ms to find 0 implicit places.
Running 1456 sub problems to find dead transitions.
[2024-06-01 08:09:21] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-06-01 08:09:21] [INFO ] Invariant cache hit.
[2024-06-01 08:09:21] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:09:39] [INFO ] Deduced a trap composed of 3 places in 452 ms of which 5 ms to minimize.
[2024-06-01 08:09:39] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 2 ms to minimize.
[2024-06-01 08:09:40] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 2 ms to minimize.
[2024-06-01 08:09:40] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-06-01 08:09:40] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:09:40] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 3 ms to minimize.
[2024-06-01 08:09:42] [INFO ] Deduced a trap composed of 54 places in 304 ms of which 4 ms to minimize.
[2024-06-01 08:09:42] [INFO ] Deduced a trap composed of 59 places in 319 ms of which 5 ms to minimize.
[2024-06-01 08:09:42] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 2 ms to minimize.
[2024-06-01 08:09:42] [INFO ] Deduced a trap composed of 11 places in 306 ms of which 4 ms to minimize.
[2024-06-01 08:09:43] [INFO ] Deduced a trap composed of 60 places in 345 ms of which 5 ms to minimize.
[2024-06-01 08:09:43] [INFO ] Deduced a trap composed of 59 places in 337 ms of which 5 ms to minimize.
[2024-06-01 08:09:44] [INFO ] Deduced a trap composed of 64 places in 350 ms of which 5 ms to minimize.
[2024-06-01 08:09:44] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:09:44] [INFO ] Deduced a trap composed of 53 places in 312 ms of which 4 ms to minimize.
[2024-06-01 08:09:44] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 2 ms to minimize.
[2024-06-01 08:09:45] [INFO ] Deduced a trap composed of 58 places in 178 ms of which 3 ms to minimize.
[2024-06-01 08:09:45] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 2 ms to minimize.
[2024-06-01 08:09:45] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 2 ms to minimize.
[2024-06-01 08:09:46] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:09:46] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:09:48] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:09:50] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 2 ms to minimize.
[2024-06-01 08:09:50] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 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 Real declared 308/812 variables, and 46 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:10:01] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-06-01 08:10:03] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-01 08:10:05] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:10:08] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 3 ms to minimize.
[2024-06-01 08:10:08] [INFO ] Deduced a trap composed of 20 places in 311 ms of which 3 ms to minimize.
[2024-06-01 08:10:08] [INFO ] Deduced a trap composed of 16 places in 313 ms of which 3 ms to minimize.
[2024-06-01 08:10:09] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 4 ms to minimize.
[2024-06-01 08:10:09] [INFO ] Deduced a trap composed of 28 places in 361 ms of which 4 ms to minimize.
[2024-06-01 08:10:09] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 2 ms to minimize.
[2024-06-01 08:10:10] [INFO ] Deduced a trap composed of 19 places in 315 ms of which 4 ms to minimize.
[2024-06-01 08:10:10] [INFO ] Deduced a trap composed of 21 places in 338 ms of which 4 ms to minimize.
[2024-06-01 08:10:10] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 3 ms to minimize.
[2024-06-01 08:10:11] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 2 ms to minimize.
[2024-06-01 08:10:11] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 2 ms to minimize.
[2024-06-01 08:10:11] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2024-06-01 08:10:11] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2024-06-01 08:10:11] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-06-01 08:10:12] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 3 ms to minimize.
[2024-06-01 08:10:12] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:10:13] [INFO ] Deduced a trap composed of 23 places in 366 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 08:10:21] [INFO ] Deduced a trap composed of 54 places in 172 ms of which 2 ms to minimize.
[2024-06-01 08:10:21] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 08:10:21] [INFO ] Deduced a trap composed of 66 places in 329 ms of which 4 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 56 places in 361 ms of which 4 ms to minimize.
[2024-06-01 08:10:22] [INFO ] Deduced a trap composed of 64 places in 362 ms of which 4 ms to minimize.
SMT process timed out in 61272ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 61297ms
Starting structural reductions in LTL mode, iteration 1 : 308/309 places, 1463/1470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64277 ms. Remains : 308/309 places, 1463/1470 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-05 finished in 336293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((G(p1)||G(F(p2)))))))'
[2024-06-01 08:10:23] [INFO ] Flatten gal took : 144 ms
[2024-06-01 08:10:23] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 08:10:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 517 places, 1708 transitions and 8204 arcs took 30 ms.
Total runtime 2195594 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : EisenbergMcGuire-PT-07-LTLFireability-04
Could not compute solution for formula : EisenbergMcGuire-PT-07-LTLFireability-05
Could not compute solution for formula : EisenbergMcGuire-PT-07-LTLFireability-06
BK_STOP 1717230786636
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name EisenbergMcGuire-PT-07-LTLFireability-04
ltl formula formula --ltl=/tmp/9331/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 517 places, 1708 transitions and 8204 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.110 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/9331/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/9331/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/9331/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/9331/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 519 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 518, there are 1939 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~241000 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~477824 transitions
pnml2lts-mc( 0/ 4): ~10000 levels ~40000 states ~959648 transitions
pnml2lts-mc( 0/ 4): ~19898 levels ~80000 states ~1975320 transitions
pnml2lts-mc( 0/ 4): ~35315 levels ~160000 states ~3729016 transitions
pnml2lts-mc( 0/ 4): ~68964 levels ~320000 states ~7753904 transitions
pnml2lts-mc( 0/ 4): ~131029 levels ~640000 states ~15947544 transitions
pnml2lts-mc( 0/ 4): ~242661 levels ~1280000 states ~31883576 transitions
pnml2lts-mc( 0/ 4): ~432495 levels ~2560000 states ~63846724 transitions
pnml2lts-mc( 3/ 4): ~764323 levels ~5120000 states ~126727388 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7720881
pnml2lts-mc( 0/ 4): unique transitions count: 199063018
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 124822116
pnml2lts-mc( 0/ 4): - claim success count: 7721186
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4305910
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7721203 states 199071763 transitions, fanout: 25.782
pnml2lts-mc( 0/ 4): Total exploration time 415.490 sec (415.400 sec minimum, 415.430 sec on average)
pnml2lts-mc( 0/ 4): States per second: 18583, Transitions per second: 479125
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 148.3MB, 14.1 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 32.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1738 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 148.3MB (~256.0MB paged-in)
ltl formula name EisenbergMcGuire-PT-07-LTLFireability-05
ltl formula formula --ltl=/tmp/9331/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 517 places, 1708 transitions and 8204 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.060 user 0.120 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/9331/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/9331/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/9331/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/9331/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 519 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 518, there are 2643 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~532088 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~1031636 transitions
pnml2lts-mc( 0/ 4): ~9996 levels ~40000 states ~2145140 transitions
pnml2lts-mc( 0/ 4): ~19983 levels ~80000 states ~4202132 transitions
pnml2lts-mc( 0/ 4): ~37922 levels ~160000 states ~8529476 transitions
pnml2lts-mc( 2/ 4): ~69776 levels ~320000 states ~17411216 transitions
pnml2lts-mc( 0/ 4): ~123777 levels ~640000 states ~34139144 transitions
pnml2lts-mc( 0/ 4): ~223449 levels ~1280000 states ~68844668 transitions
pnml2lts-mc( 0/ 4): ~406592 levels ~2560000 states ~138619688 transitions
pnml2lts-mc( 0/ 4): ~736549 levels ~5120000 states ~276604472 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 8015370
pnml2lts-mc( 0/ 4): unique transitions count: 432298412
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 276340635
pnml2lts-mc( 0/ 4): - claim success count: 8015734
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4478845
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8015746 states 432315896 transitions, fanout: 53.933
pnml2lts-mc( 0/ 4): Total exploration time 474.890 sec (474.810 sec minimum, 474.850 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16879, Transitions per second: 910350
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 150.5MB, 13.9 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 33.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1738 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 150.5MB (~256.0MB paged-in)
ltl formula name EisenbergMcGuire-PT-07-LTLFireability-06
ltl formula formula --ltl=/tmp/9331/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 517 places, 1708 transitions and 8204 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.060 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/9331/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/9331/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/9331/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/9331/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 518 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 518, there are 2715 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~326708 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~641316 transitions
pnml2lts-mc( 0/ 4): ~9999 levels ~40000 states ~1305280 transitions
pnml2lts-mc( 0/ 4): ~19954 levels ~80000 states ~2628980 transitions
pnml2lts-mc( 0/ 4): ~37149 levels ~160000 states ~5322664 transitions
pnml2lts-mc( 0/ 4): ~62449 levels ~320000 states ~10640424 transitions
pnml2lts-mc( 2/ 4): ~116394 levels ~640000 states ~20622480 transitions
pnml2lts-mc( 2/ 4): ~220077 levels ~1280000 states ~41512720 transitions
pnml2lts-mc( 2/ 4): ~408778 levels ~2560000 states ~82892100 transitions
pnml2lts-mc( 2/ 4): ~753578 levels ~5120000 states ~165792372 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 8328020
pnml2lts-mc( 0/ 4): unique transitions count: 272203169
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 175955652
pnml2lts-mc( 0/ 4): - claim success count: 8328725
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4335447
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8328775 states 272228116 transitions, fanout: 32.685
pnml2lts-mc( 0/ 4): Total exploration time 469.360 sec (469.240 sec minimum, 469.292 sec on average)
pnml2lts-mc( 0/ 4): States per second: 17745, Transitions per second: 579999
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 152.8MB, 13.8 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 34.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1738 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 152.8MB (~256.0MB paged-in)
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="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-07, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r492-smll-171636266300180"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;