About the Execution of LTSMin+red for DoubleExponent-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16179.760 | 2766387.00 | 6327840.00 | 3099.70 | ?F?TTTTT?FF?FT?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r488-tall-171631132900571.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 DoubleExponent-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900571
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 DoubleExponent-PT-100-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-100-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717197250206
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:14:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:14:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:14:11] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2024-05-31 23:14:11] [INFO ] Transformed 5304 places.
[2024-05-31 23:14:11] [INFO ] Transformed 4998 transitions.
[2024-05-31 23:14:11] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DoubleExponent-PT-100-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 5304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 5300 transition count 4998
Applied a total of 4 rules in 1068 ms. Remains 5300 /5304 variables (removed 4) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:14:14] [INFO ] Invariants computation overflowed in 198 ms
[2024-05-31 23:14:16] [INFO ] Implicit Places using invariants in 2356 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:14:16] [INFO ] Invariants computation overflowed in 101 ms
[2024-05-31 23:16:56] [INFO ] Performed 3/5300 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2024-05-31 23:16:56] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2024-05-31 23:16:56] [INFO ] Implicit Places using invariants and state equation in 160289 ms returned []
Implicit Place search using SMT with State Equation took 162674 ms to find 0 implicit places.
Running 4997 sub problems to find dead transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:16:56] [INFO ] Invariants computation overflowed in 110 ms
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 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30118 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 4997/4997 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4997 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30065 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 0/4997 constraints, Known Traps: 0/0 constraints]
After SMT, in 62809ms problems are : Problem set: 0 solved, 4997 unsolved
Search for dead transitions found 0 dead transitions in 62890ms
Starting structural reductions in LTL mode, iteration 1 : 5300/5304 places, 4998/4998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226679 ms. Remains : 5300/5304 places, 4998/4998 transitions.
Support contains 37 out of 5300 places after structural reductions.
[2024-05-31 23:18:00] [INFO ] Flatten gal took : 286 ms
[2024-05-31 23:18:00] [INFO ] Flatten gal took : 171 ms
[2024-05-31 23:18:00] [INFO ] Input system was already deterministic with 4998 transitions.
RANDOM walk for 40000 steps (1315 resets) in 1327 ms. (30 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (118 resets) in 104 ms. (38 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (112 resets) in 277 ms. (14 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (117 resets) in 271 ms. (14 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (110 resets) in 279 ms. (14 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (111 resets) in 146 ms. (27 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (114 resets) in 51 ms. (76 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (114 resets) in 143 ms. (27 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (107 resets) in 56 ms. (70 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (118 resets) in 63 ms. (62 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (113 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (111 resets) in 192 ms. (20 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (116 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (118 resets) in 45 ms. (86 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (110 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (112 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (116 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (111 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (113 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (108 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (116 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (112 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (114 resets) in 28 ms. (137 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (109 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 58099 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :1 out of 23
Probabilistic random walk after 58099 steps, saw 29055 distinct states, run finished after 3006 ms. (steps per millisecond=19 ) properties seen :1
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:18:05] [INFO ] Invariants computation overflowed in 85 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 100/136 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 490/626 variables, 177/213 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 1110/1736 variables, 494/707 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1736 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 1702/3438 variables, 815/1522 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3438 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 1853/5291 variables, 974/2496 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5291 variables, 0/2496 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1545/6836 variables, 848/3344 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6836/10298 variables, and 3344 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5009 ms.
Refiners :[State Equation: 3344/5300 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 100/136 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 490/626 variables, 177/213 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 22/235 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 1110/1736 variables, 494/729 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1736 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 1702/3438 variables, 815/1544 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3438 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 1853/5291 variables, 974/2518 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5291 variables, 0/2518 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 1545/6836 variables, 848/3366 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6836/10298 variables, and 3366 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5016 ms.
Refiners :[State Equation: 3344/5300 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 10158ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1159 transitions
Trivial Post-agglo rules discarded 1159 transitions
Performed 1159 trivial Post agglomeration. Transition count delta: 1159
Iterating post reduction 0 with 1162 rules applied. Total rules applied 1163 place count 5297 transition count 3837
Reduce places removed 1159 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 1177 rules applied. Total rules applied 2340 place count 4138 transition count 3819
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 2358 place count 4120 transition count 3819
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2358 place count 4120 transition count 3618
Deduced a syphon composed of 201 places in 162 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2760 place count 3919 transition count 3618
Performed 887 Post agglomeration using F-continuation condition.Transition count delta: 887
Deduced a syphon composed of 887 places in 63 ms
Reduce places removed 887 places and 0 transitions.
Iterating global reduction 3 with 1774 rules applied. Total rules applied 4534 place count 3032 transition count 2731
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 155 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4736 place count 2931 transition count 2731
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 58 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 4916 place count 2841 transition count 2731
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4918 place count 2841 transition count 2729
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4920 place count 2839 transition count 2729
Free-agglomeration rule (complex) applied 408 times.
Iterating global reduction 4 with 408 rules applied. Total rules applied 5328 place count 2839 transition count 2321
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 4 with 408 rules applied. Total rules applied 5736 place count 2431 transition count 2321
Partial Free-agglomeration rule applied 398 times.
Drop transitions (Partial Free agglomeration) removed 398 transitions
Iterating global reduction 5 with 398 rules applied. Total rules applied 6134 place count 2431 transition count 2321
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6135 place count 2430 transition count 2320
Applied a total of 6135 rules in 2215 ms. Remains 2430 /5300 variables (removed 2870) and now considering 2320/4998 (removed 2678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2216 ms. Remains : 2430/5300 places, 2320/4998 transitions.
RANDOM walk for 40000 steps (5142 resets) in 957 ms. (41 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (345 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (334 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (328 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (325 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (333 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (344 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (341 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (310 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (349 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (352 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (333 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (341 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (346 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (331 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (338 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (344 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (331 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (330 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (346 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (347 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (338 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (335 resets) in 22 ms. (173 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 96322 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 22
Probabilistic random walk after 96322 steps, saw 48205 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 2320 rows 2430 cols
[2024-05-31 23:18:21] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-31 23:18:21] [INFO ] State equation strengthened by 387 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 137/173 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 1413/1586 variables, 424/463 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1586 variables, 53/516 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1586 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2578/4164 variables, 1482/1998 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4164/4750 variables, and 2239 constraints, problems are : Problem set: 0 solved, 22 unsolved in 45027 ms.
Refiners :[State Equation: 1942/2430 constraints, ReadFeed: 297/387 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 137/173 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 1413/1586 variables, 424/463 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1586 variables, 53/516 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1586 variables, 21/537 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1586 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 2578/4164 variables, 1482/2019 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4164/4750 variables, and 2260 constraints, problems are : Problem set: 0 solved, 22 unsolved in 45024 ms.
Refiners :[State Equation: 1942/2430 constraints, ReadFeed: 297/387 constraints, PredecessorRefiner: 21/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 90144ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 2430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2430/2430 places, 2320/2320 transitions.
Applied a total of 0 rules in 140 ms. Remains 2430 /2430 variables (removed 0) and now considering 2320/2320 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 2430/2430 places, 2320/2320 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2430/2430 places, 2320/2320 transitions.
Applied a total of 0 rules in 135 ms. Remains 2430 /2430 variables (removed 0) and now considering 2320/2320 (removed 0) transitions.
// Phase 1: matrix 2320 rows 2430 cols
[2024-05-31 23:19:52] [INFO ] Invariants computation overflowed in 54 ms
[2024-05-31 23:20:00] [INFO ] Implicit Places using invariants in 8591 ms returned []
// Phase 1: matrix 2320 rows 2430 cols
[2024-05-31 23:20:00] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-31 23:20:02] [INFO ] State equation strengthened by 387 read => feed constraints.
[2024-05-31 23:20:46] [INFO ] Performed 5/2430 implicitness test of which 0 returned IMPLICIT in 44 seconds.
[2024-05-31 23:22:40] [INFO ] Performed 6/2430 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2024-05-31 23:22:40] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2024-05-31 23:22:40] [INFO ] Implicit Places using invariants and state equation in 160110 ms returned []
Implicit Place search using SMT with State Equation took 168703 ms to find 0 implicit places.
[2024-05-31 23:22:41] [INFO ] Redundant transitions in 138 ms returned []
Running 2319 sub problems to find dead transitions.
// Phase 1: matrix 2320 rows 2430 cols
[2024-05-31 23:22:41] [INFO ] Invariants computation overflowed in 56 ms
[2024-05-31 23:22:41] [INFO ] State equation strengthened by 387 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2429/4750 variables, and 0 constraints, problems are : Problem set: 0 solved, 2319 unsolved in 30040 ms.
Refiners :[State Equation: 0/2430 constraints, ReadFeed: 0/387 constraints, PredecessorRefiner: 2319/2319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2319 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 2429/4750 variables, and 0 constraints, problems are : Problem set: 0 solved, 2319 unsolved in 30033 ms.
Refiners :[State Equation: 0/2430 constraints, ReadFeed: 0/387 constraints, PredecessorRefiner: 0/2319 constraints, Known Traps: 0/0 constraints]
After SMT, in 70323ms problems are : Problem set: 0 solved, 2319 unsolved
Search for dead transitions found 0 dead transitions in 70350ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239351 ms. Remains : 2430/2430 places, 2320/2320 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.35 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&&F(G(p1))))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 893 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:23:52] [INFO ] Invariants computation overflowed in 96 ms
[2024-05-31 23:23:54] [INFO ] Implicit Places using invariants in 1840 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:23:54] [INFO ] Invariants computation overflowed in 99 ms
[2024-05-31 23:26:34] [INFO ] Performed 3/5300 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2024-05-31 23:26:34] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2024-05-31 23:26:34] [INFO ] Implicit Places using invariants and state equation in 160281 ms returned []
Implicit Place search using SMT with State Equation took 162126 ms to find 0 implicit places.
Running 4997 sub problems to find dead transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:26:34] [INFO ] Invariants computation overflowed in 97 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30068 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 4997/4997 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4997 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30069 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 0/4997 constraints, Known Traps: 0/0 constraints]
After SMT, in 62583ms problems are : Problem set: 0 solved, 4997 unsolved
Search for dead transitions found 0 dead transitions in 62631ms
Finished structural reductions in LTL mode , in 1 iterations and 225668 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLCardinality-00
Product exploration explored 100000 steps with 3327 reset in 325 ms.
Product exploration explored 100000 steps with 3286 reset in 283 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
RANDOM walk for 40000 steps (1326 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1137 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 82823 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 1
Probabilistic random walk after 82823 steps, saw 41418 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:27:42] [INFO ] Invariants computation overflowed in 86 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/19 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/54 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/115 variables, 32/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 68/183 variables, 33/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 95/278 variables, 47/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 71/349 variables, 40/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/349 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 84/433 variables, 38/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/433 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 98/531 variables, 54/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/531 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 80/611 variables, 39/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/611 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 107/718 variables, 55/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/718 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 94/812 variables, 47/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 109/921 variables, 57/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/921 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 97/1018 variables, 49/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1018 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 109/1127 variables, 57/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1127 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 97/1224 variables, 49/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1224 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 109/1333 variables, 57/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1333 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 97/1430 variables, 49/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1430 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 109/1539 variables, 57/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1539 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 97/1636 variables, 49/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1636 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 109/1745 variables, 57/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1745 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 97/1842 variables, 49/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1842 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 109/1951 variables, 57/991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1951 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 97/2048 variables, 49/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2048 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 109/2157 variables, 57/1097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2157 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 97/2254 variables, 49/1146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2254 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 109/2363 variables, 57/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2363 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 97/2460 variables, 49/1252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2460 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 109/2569 variables, 57/1309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2569 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 97/2666 variables, 49/1358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2666 variables, 0/1358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 109/2775 variables, 57/1415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2775 variables, 0/1415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 97/2872 variables, 49/1464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2872 variables, 0/1464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 109/2981 variables, 57/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2981 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 97/3078 variables, 49/1570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/3078 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 109/3187 variables, 57/1627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/3187 variables, 0/1627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 97/3284 variables, 49/1676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/3284 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 109/3393 variables, 57/1733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/3393 variables, 0/1733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 97/3490 variables, 49/1782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/3490 variables, 0/1782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 109/3599 variables, 57/1839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/3599 variables, 0/1839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 97/3696 variables, 49/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/3696 variables, 0/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 109/3805 variables, 57/1945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/3805 variables, 0/1945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 97/3902 variables, 49/1994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/3902 variables, 0/1994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 109/4011 variables, 57/2051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/4011 variables, 0/2051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 97/4108 variables, 49/2100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/4108 variables, 0/2100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 109/4217 variables, 57/2157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/4217 variables, 0/2157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 97/4314 variables, 49/2206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/4314 variables, 0/2206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 109/4423 variables, 57/2263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/4423 variables, 0/2263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 97/4520 variables, 49/2312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/4520 variables, 0/2312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 109/4629 variables, 57/2369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/4629 variables, 0/2369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 97/4726 variables, 49/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/4726 variables, 0/2418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 109/4835 variables, 57/2475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/4835 variables, 0/2475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 97/4932 variables, 49/2524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/4932 variables, 0/2524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 109/5041 variables, 57/2581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/5041 variables, 0/2581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 97/5138 variables, 49/2630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/5138 variables, 0/2630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 109/5247 variables, 57/2687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/5247 variables, 0/2687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 97/5344 variables, 49/2736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/5344 variables, 0/2736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 109/5453 variables, 57/2793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/5453 variables, 0/2793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 97/5550 variables, 49/2842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/5550 variables, 0/2842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 109/5659 variables, 57/2899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/5659 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 97/5756 variables, 49/2948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/5756 variables, 0/2948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 109/5865 variables, 57/3005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/5865 variables, 0/3005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 97/5962 variables, 49/3054 constraints. Problems are: Problem set: 0 solved, 1 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 Real declared 5962/10298 variables, and 3054 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5019 ms.
Refiners :[State Equation: 3054/5300 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/19 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 35/54 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 61/115 variables, 32/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 68/183 variables, 33/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 95/278 variables, 47/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/278 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 71/349 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/349 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 84/433 variables, 38/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 98/531 variables, 54/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/531 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 80/611 variables, 39/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/611 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 107/718 variables, 55/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/718 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 94/812 variables, 47/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/812 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 109/921 variables, 57/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/921 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 97/1018 variables, 49/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1018 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 109/1127 variables, 57/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1127 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 97/1224 variables, 49/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1224 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 109/1333 variables, 57/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1333 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 97/1430 variables, 49/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1430 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 109/1539 variables, 57/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1539 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 97/1636 variables, 49/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1636 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 109/1745 variables, 57/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1745 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 97/1842 variables, 49/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1842 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 109/1951 variables, 57/992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1951 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 97/2048 variables, 49/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2048 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 109/2157 variables, 57/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2157 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 97/2254 variables, 49/1147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2254 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 109/2363 variables, 57/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2363 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 97/2460 variables, 49/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2460 variables, 0/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 109/2569 variables, 57/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2569 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 97/2666 variables, 49/1359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2666 variables, 0/1359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 109/2775 variables, 57/1416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2775 variables, 0/1416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 97/2872 variables, 49/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2872 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 109/2981 variables, 57/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2981 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 97/3078 variables, 49/1571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/3078 variables, 0/1571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 109/3187 variables, 57/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/3187 variables, 0/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 97/3284 variables, 49/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/3284 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 109/3393 variables, 57/1734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/3393 variables, 0/1734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 97/3490 variables, 49/1783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/3490 variables, 0/1783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 109/3599 variables, 57/1840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/3599 variables, 0/1840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 97/3696 variables, 49/1889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/3696 variables, 0/1889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 109/3805 variables, 57/1946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/3805 variables, 0/1946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 97/3902 variables, 49/1995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/3902 variables, 0/1995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 109/4011 variables, 57/2052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/4011 variables, 0/2052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 97/4108 variables, 49/2101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/4108 variables, 0/2101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 109/4217 variables, 57/2158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/4217 variables, 0/2158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 97/4314 variables, 49/2207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/4314 variables, 0/2207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 109/4423 variables, 57/2264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/4423 variables, 0/2264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 97/4520 variables, 49/2313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/4520 variables, 0/2313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 109/4629 variables, 57/2370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/4629 variables, 0/2370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 97/4726 variables, 49/2419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/4726 variables, 0/2419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 109/4835 variables, 57/2476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/4835 variables, 0/2476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 97/4932 variables, 49/2525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/4932 variables, 0/2525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 109/5041 variables, 57/2582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/5041 variables, 0/2582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 97/5138 variables, 49/2631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/5138 variables, 0/2631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 109/5247 variables, 57/2688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/5247 variables, 0/2688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 97/5344 variables, 49/2737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/5344 variables, 0/2737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 109/5453 variables, 57/2794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/5453 variables, 0/2794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 97/5550 variables, 49/2843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/5550 variables, 0/2843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 109/5659 variables, 57/2900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/5659 variables, 0/2900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 97/5756 variables, 49/2949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/5756 variables, 0/2949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 109/5865 variables, 57/3006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/5865 variables, 0/3006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 97/5962 variables, 49/3055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/5962 variables, 0/3055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6071/10298 variables, and 3112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5019 ms.
Refiners :[State Equation: 3111/5300 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 10147ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1201 rules applied. Total rules applied 1202 place count 5297 transition count 3798
Reduce places removed 1198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2401 place count 4099 transition count 3797
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2402 place count 4098 transition count 3797
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2402 place count 4098 transition count 3597
Deduced a syphon composed of 200 places in 187 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2802 place count 3898 transition count 3597
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 63 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 3 with 1810 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 54 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 49 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 5008 place count 2795 transition count 2692
Free-agglomeration rule (complex) applied 399 times.
Iterating global reduction 3 with 399 rules applied. Total rules applied 5407 place count 2795 transition count 2293
Reduce places removed 399 places and 0 transitions.
Iterating post reduction 3 with 399 rules applied. Total rules applied 5806 place count 2396 transition count 2293
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions (Partial Free agglomeration) removed 400 transitions
Iterating global reduction 4 with 400 rules applied. Total rules applied 6206 place count 2396 transition count 2293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6207 place count 2395 transition count 2292
Applied a total of 6207 rules in 1745 ms. Remains 2395 /5300 variables (removed 2905) and now considering 2292/4998 (removed 2706) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1747 ms. Remains : 2395/5300 places, 2292/4998 transitions.
RANDOM walk for 40000 steps (5101 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3359 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 176025 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 176025 steps, saw 88052 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 2292 rows 2395 cols
[2024-05-31 23:27:57] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 23:27:57] [INFO ] State equation strengthened by 398 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 688/695 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2618/3313 variables, 1231/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3313 variables, 203/1532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/3313 variables, 0/1532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4687/4687 variables, and 2601 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10884 ms.
Refiners :[State Equation: 2395/2395 constraints, ReadFeed: 206/398 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 688/695 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2618/3313 variables, 1231/1330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3313/4687 variables, and 1533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5919 ms.
Refiners :[State Equation: 1326/2395 constraints, ReadFeed: 206/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 16874ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 2395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2395/2395 places, 2292/2292 transitions.
Applied a total of 0 rules in 192 ms. Remains 2395 /2395 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 2395/2395 places, 2292/2292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2395/2395 places, 2292/2292 transitions.
Applied a total of 0 rules in 194 ms. Remains 2395 /2395 variables (removed 0) and now considering 2292/2292 (removed 0) transitions.
// Phase 1: matrix 2292 rows 2395 cols
[2024-05-31 23:28:15] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 23:28:37] [INFO ] Implicit Places using invariants in 22336 ms returned []
// Phase 1: matrix 2292 rows 2395 cols
[2024-05-31 23:28:37] [INFO ] Invariants computation overflowed in 61 ms
[2024-05-31 23:28:38] [INFO ] State equation strengthened by 398 read => feed constraints.
[2024-05-31 23:30:28] [INFO ] Performed 25/2395 implicitness test of which 2 returned IMPLICIT in 109 seconds.
[2024-05-31 23:31:05] [INFO ] Performed 54/2395 implicitness test of which 4 returned IMPLICIT in 146 seconds.
[2024-05-31 23:31:17] [INFO ] Implicit Places using invariants and state equation in 160095 ms returned [19, 25, 47, 54, 76, 81]
[2024-05-31 23:31:17] [INFO ] Actually due to overlaps returned [25, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 182446 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2393/2395 places, 2292/2292 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2393 transition count 2291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2392 transition count 2291
Applied a total of 2 rules in 385 ms. Remains 2392 /2393 variables (removed 1) and now considering 2291/2292 (removed 1) transitions.
// Phase 1: matrix 2291 rows 2392 cols
[2024-05-31 23:31:17] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 23:31:40] [INFO ] Implicit Places using invariants in 23090 ms returned []
// Phase 1: matrix 2291 rows 2392 cols
[2024-05-31 23:31:40] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-31 23:31:42] [INFO ] State equation strengthened by 398 read => feed constraints.
[2024-05-31 23:32:26] [INFO ] Performed 4/2392 implicitness test of which 0 returned IMPLICIT in 44 seconds.
[2024-05-31 23:33:59] [INFO ] Performed 6/2392 implicitness test of which 0 returned IMPLICIT in 137 seconds.
[2024-05-31 23:33:59] [INFO ] Timeout of Implicit test with SMT after 137 seconds.
[2024-05-31 23:33:59] [INFO ] Implicit Places using invariants and state equation in 138693 ms returned []
Implicit Place search using SMT with State Equation took 161787 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2392/2395 places, 2291/2292 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 344813 ms. Remains : 2392/2395 places, 2291/2292 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Support contains 1 out of 5300 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 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1194 transitions
Trivial Post-agglo rules discarded 1194 transitions
Performed 1194 trivial Post agglomeration. Transition count delta: 1194
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1194 place count 5299 transition count 3803
Reduce places removed 1194 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1197 rules applied. Total rules applied 2391 place count 4105 transition count 3800
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2394 place count 4102 transition count 3800
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2394 place count 4102 transition count 3599
Deduced a syphon composed of 201 places in 172 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Deduced a syphon composed of 898 places in 64 ms
Reduce places removed 898 places and 0 transitions.
Iterating global reduction 3 with 1796 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 56 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 50 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4988 place count 2805 transition count 2701
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 4992 place count 2805 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4993 place count 2804 transition count 2700
Applied a total of 4993 rules in 1384 ms. Remains 2804 /5300 variables (removed 2496) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-31 23:34:01] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-31 23:34:02] [INFO ] Implicit Places using invariants in 1279 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-31 23:34:02] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:34:03] [INFO ] State equation strengthened by 198 read => feed constraints.
[2024-05-31 23:36:02] [INFO ] Performed 1/2804 implicitness test of which 0 returned IMPLICIT in 118 seconds.
[2024-05-31 23:36:35] [INFO ] Performed 3/2804 implicitness test of which 0 returned IMPLICIT in 151 seconds.
[2024-05-31 23:36:35] [INFO ] Timeout of Implicit test with SMT after 151 seconds.
[2024-05-31 23:36:35] [INFO ] Implicit Places using invariants and state equation in 152812 ms returned []
Implicit Place search using SMT with State Equation took 154096 ms to find 0 implicit places.
[2024-05-31 23:36:35] [INFO ] Redundant transitions in 125 ms returned []
Running 2699 sub problems to find dead transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-31 23:36:35] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-31 23:36:35] [INFO ] State equation strengthened by 198 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2803/5504 variables, and 0 constraints, problems are : Problem set: 0 solved, 2699 unsolved in 30042 ms.
Refiners :[State Equation: 0/2804 constraints, ReadFeed: 0/198 constraints, PredecessorRefiner: 2699/2699 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2803/5504 variables, and 0 constraints, problems are : Problem set: 0 solved, 2699 unsolved in 30038 ms.
Refiners :[State Equation: 0/2804 constraints, ReadFeed: 0/198 constraints, PredecessorRefiner: 0/2699 constraints, Known Traps: 0/0 constraints]
After SMT, in 60983ms problems are : Problem set: 0 solved, 2699 unsolved
Search for dead transitions found 0 dead transitions in 61006ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5300 places, 2700/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216626 ms. Remains : 2804/5300 places, 2700/4998 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8876 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
RANDOM walk for 40000 steps (5548 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3233 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 94316 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 1
Probabilistic random walk after 94316 steps, saw 47166 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 2700 rows 2804 cols
[2024-05-31 23:37:39] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-31 23:37:39] [INFO ] State equation strengthened by 198 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/28 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 68/96 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/188 variables, 46/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 107/295 variables, 53/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 110/405 variables, 56/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/405 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 110/515 variables, 56/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/515 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 110/625 variables, 56/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/625 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/625 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 110/735 variables, 56/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/735 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/735 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 110/845 variables, 56/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/845 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/845 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 110/955 variables, 56/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/955 variables, 4/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/955 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1065/5504 variables, and 562 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2103 ms.
Refiners :[State Equation: 528/2804 constraints, ReadFeed: 34/198 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/28 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 68/96 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 92/188 variables, 46/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 107/295 variables, 53/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/295 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 110/405 variables, 56/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 110/515 variables, 56/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 110/625 variables, 56/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/625 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/625 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 110/735 variables, 56/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/735 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/735 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/845 variables, 56/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/845 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/845 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 110/955 variables, 56/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/955 variables, 4/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/955 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 110/1065 variables, 56/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1065 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1065 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 112/1177 variables, 57/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1177 variables, 4/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1177 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 112/1289 variables, 57/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1289 variables, 4/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1289 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 110/1399 variables, 56/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1399 variables, 4/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1399 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 110/1509 variables, 56/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1509 variables, 4/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1509 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 110/1619 variables, 56/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1619 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1619 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 110/1729 variables, 56/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1729 variables, 4/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1729 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 110/1839 variables, 56/985 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1839 variables, 4/989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1839 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 110/1949 variables, 56/1045 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1949 variables, 4/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1949 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 110/2059 variables, 56/1105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2059 variables, 4/1109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2059 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 110/2169 variables, 56/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2169 variables, 4/1169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2169 variables, 0/1169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2279/5504 variables, and 1225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4113 ms.
Refiners :[State Equation: 1146/2804 constraints, ReadFeed: 78/198 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 6287ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8476 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 2802 transition count 2694
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 2798 transition count 2694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 2798 transition count 2693
Deduced a syphon composed of 1 places in 44 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 2797 transition count 2693
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 42 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 2796 transition count 2692
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 2 with 398 rules applied. Total rules applied 413 place count 2796 transition count 2294
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 2 with 398 rules applied. Total rules applied 811 place count 2398 transition count 2294
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions (Partial Free agglomeration) removed 399 transitions
Iterating global reduction 3 with 399 rules applied. Total rules applied 1210 place count 2398 transition count 2294
Applied a total of 1210 rules in 722 ms. Remains 2398 /2804 variables (removed 406) and now considering 2294/2700 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 724 ms. Remains : 2398/2804 places, 2294/2700 transitions.
RANDOM walk for 40000 steps (5125 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3414 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 116632 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 116632 steps, saw 58361 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-31 23:37:50] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-31 23:37:50] [INFO ] State equation strengthened by 398 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 688/695 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2618/3313 variables, 1231/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3313 variables, 202/1531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/3313 variables, 0/1531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4692/4692 variables, and 2603 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11035 ms.
Refiners :[State Equation: 2398/2398 constraints, ReadFeed: 205/398 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 688/695 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2618/3313 variables, 1231/1330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3313 variables, 202/1532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3313 variables, 0/1532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4692/4692 variables, and 2604 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10924 ms.
Refiners :[State Equation: 2398/2398 constraints, ReadFeed: 205/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 22027ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2398/2398 places, 2294/2294 transitions.
Applied a total of 0 rules in 190 ms. Remains 2398 /2398 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 2398/2398 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2398/2398 places, 2294/2294 transitions.
Applied a total of 0 rules in 183 ms. Remains 2398 /2398 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-31 23:38:12] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 23:38:34] [INFO ] Implicit Places using invariants in 22247 ms returned []
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-31 23:38:34] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-31 23:38:36] [INFO ] State equation strengthened by 398 read => feed constraints.
[2024-05-31 23:39:08] [INFO ] Performed 4/2398 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2024-05-31 23:40:10] [INFO ] Performed 6/2398 implicitness test of which 0 returned IMPLICIT in 94 seconds.
[2024-05-31 23:40:44] [INFO ] Performed 8/2398 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2024-05-31 23:40:44] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2024-05-31 23:40:44] [INFO ] Implicit Places using invariants and state equation in 130201 ms returned []
Implicit Place search using SMT with State Equation took 152450 ms to find 0 implicit places.
[2024-05-31 23:40:44] [INFO ] Redundant transitions in 104 ms returned []
Running 2293 sub problems to find dead transitions.
// Phase 1: matrix 2294 rows 2398 cols
[2024-05-31 23:40:45] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 23:40:45] [INFO ] State equation strengthened by 398 read => feed constraints.
Could not compute solution for formula : DoubleExponent-PT-100-LTLCardinality-00
FORMULA DoubleExponent-PT-100-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DoubleExponent-PT-100-LTLCardinality-02
FORMULA DoubleExponent-PT-100-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-100-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-100-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-100-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-100-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DoubleExponent-PT-100-LTLCardinality-08
FORMULA DoubleExponent-PT-100-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-100-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DoubleExponent-PT-100-LTLCardinality-11
FORMULA DoubleExponent-PT-100-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-100-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DoubleExponent-PT-100-LTLCardinality-14
FORMULA DoubleExponent-PT-100-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717200016593
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name DoubleExponent-PT-100-LTLCardinality-00
ltl formula formula --ltl=/tmp/789/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 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.180 real 0.210 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 5301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 5006 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): ~1243 levels ~10000 states ~11176 transitions
pnml2lts-mc( 2/ 4): ~2098 levels ~20000 states ~22284 transitions
pnml2lts-mc( 2/ 4): ~3747 levels ~40000 states ~44540 transitions
pnml2lts-mc( 2/ 4): ~6226 levels ~80000 states ~88956 transitions
pnml2lts-mc( 2/ 4): ~9500 levels ~160000 states ~177684 transitions
ltl formula name DoubleExponent-PT-100-LTLCardinality-01
ltl formula formula --ltl=/tmp/789/ltl_1_
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 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.560 real 0.180 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 5301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 5004 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):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~23!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 28
pnml2lts-mc( 0/ 4): unique transitions count: 30
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 88
pnml2lts-mc( 0/ 4): - cum. max stack depth: 88
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 88 states 97 transitions, fanout: 1.102
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 978, Transitions per second: 1078
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 97.3 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5106 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-100-LTLCardinality-02
ltl formula formula --ltl=/tmp/789/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 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.500 real 0.180 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 5301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 5002 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): ~1262 levels ~10000 states ~11104 transitions
pnml2lts-mc( 0/ 4): ~1360 levels ~20000 states ~22168 transitions
pnml2lts-mc( 0/ 4): ~1510 levels ~40000 states ~44304 transitions
pnml2lts-mc( 0/ 4): ~1692 levels ~80000 states ~88572 transitions
pnml2lts-mc( 0/ 4): ~2707 levels ~160000 states ~177160 transitions
ltl formula name DoubleExponent-PT-100-LTLCardinality-03
ltl formula formula --ltl=/tmp/789/ltl_3_
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 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.530 real 0.150 user 0.180 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5302 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 5008 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):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 2
pnml2lts-mc( 0/ 4): unique transitions count: 1
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7 states 8 transitions, fanout: 1.143
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 700, Transitions per second: 800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 172.0 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5106 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-100-LTLCardinality-04
ltl formula formula --ltl=/tmp/789/ltl_4_
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 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.470 real 0.160 user 0.180 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5302 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 4999 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):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.015 sec on average)
pnml2lts-mc( 0/ 4): States per second: 200, Transitions per second: 200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 104.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5106 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-100-LTLCardinality-05
ltl formula formula --ltl=/tmp/789/ltl_5_
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 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.480 real 0.130 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5302 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 5002 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):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 400, Transitions per second: 400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 104.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5106 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-100-LTLCardinality-06
ltl formula formula --ltl=/tmp/789/ltl_6_
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 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.480 real 0.160 user 0.160 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5302 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 5011 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):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5
pnml2lts-mc( 0/ 4): unique states count: 5
pnml2lts-mc( 0/ 4): unique transitions count: 4
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 17
pnml2lts-mc( 0/ 4): - cum. max stack depth: 17
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 17 states 20 transitions, fanout: 1.176
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 850, Transitions per second: 1000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 188.8 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5106 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-100-LTLCardinality-07
ltl formula formula --ltl=/tmp/789/ltl_7_
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 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.480 real 0.180 user 0.130 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5302 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 4999 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):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 400, Transitions per second: 400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 104.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5106 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-100-LTLCardinality-08
ltl formula formula --ltl=/tmp/789/ltl_8_
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 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.470 real 0.160 user 0.170 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5302 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 5001 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( 1/ 4): ~1178 levels ~10000 states ~11140 transitions
pnml2lts-mc( 1/ 4): ~1328 levels ~20000 states ~22208 transitions
pnml2lts-mc( 1/ 4): ~1484 levels ~40000 states ~44364 transitions
pnml2lts-mc( 1/ 4): ~1692 levels ~80000 states ~88624 transitions
pnml2lts-mc( 1/ 4): ~2707 levels ~160000 states ~177212 transitions
ltl formula name DoubleExponent-PT-100-LTLCardinality-09
ltl formula formula --ltl=/tmp/789/ltl_9_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.490 real 0.160 user 0.180 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 5301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 5005 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):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~25!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 28
pnml2lts-mc( 0/ 4): unique transitions count: 30
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 72
pnml2lts-mc( 0/ 4): - cum. max stack depth: 72
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 72 states 79 transitions, fanout: 1.097
pnml2lts-mc( 0/ 4): Total exploration time 0.110 sec (0.090 sec minimum, 0.105 sec on average)
pnml2lts-mc( 0/ 4): States per second: 655, Transitions per second: 718
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 98.1 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5106 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-100-LTLCardinality-10
ltl formula formula --ltl=/tmp/789/ltl_10_
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 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.490 real 0.150 user 0.180 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 5301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 5008 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):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~23!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 29
pnml2lts-mc( 0/ 4): unique transitions count: 31
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 90
pnml2lts-mc( 0/ 4): - cum. max stack depth: 90
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 90 states 99 transitions, fanout: 1.100
pnml2lts-mc( 0/ 4): Total exploration time 0.100 sec (0.090 sec minimum, 0.093 sec on average)
pnml2lts-mc( 0/ 4): States per second: 900, Transitions per second: 990
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 97.3 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5106 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-100-LTLCardinality-11
ltl formula formula --ltl=/tmp/789/ltl_11_
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 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.490 real 0.150 user 0.180 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5302 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 5003 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( 1/ 4): ~1025 levels ~10000 states ~11124 transitions
pnml2lts-mc( 0/ 4): ~1360 levels ~20000 states ~22188 transitions
pnml2lts-mc( 1/ 4): ~1390 levels ~40000 states ~44312 transitions
pnml2lts-mc( 1/ 4): ~1455 levels ~80000 states ~88580 transitions
pnml2lts-mc( 1/ 4): ~1670 levels ~160000 states ~177108 transitions
ltl formula name DoubleExponent-PT-100-LTLCardinality-12
ltl formula formula --ltl=/tmp/789/ltl_12_
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 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.520 real 0.180 user 0.160 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5302 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 5001 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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~25!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 34
pnml2lts-mc( 0/ 4): unique transitions count: 37
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 101
pnml2lts-mc( 0/ 4): - cum. max stack depth: 101
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 101 states 114 transitions, fanout: 1.129
pnml2lts-mc( 0/ 4): Total exploration time 0.100 sec (0.100 sec minimum, 0.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1010, Transitions per second: 1140
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 91.0 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5106 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-100-LTLCardinality-13
ltl formula formula --ltl=/tmp/789/ltl_13_
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 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.510 real 0.130 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5302 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 5009 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):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 400, Transitions per second: 400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 104.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5106 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-100-LTLCardinality-14
ltl formula formula --ltl=/tmp/789/ltl_14_
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 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.480 real 0.190 user 0.150 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 5301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 5005 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( 1/ 4): ~1003 levels ~10000 states ~11116 transitions
pnml2lts-mc( 0/ 4): ~1360 levels ~20000 states ~22180 transitions
pnml2lts-mc( 0/ 4): ~1510 levels ~40000 states ~44312 transitions
pnml2lts-mc( 0/ 4): ~1692 levels ~80000 states ~88580 transitions
pnml2lts-mc( 3/ 4): ~1670 levels ~160000 states ~177496 transitions
ltl formula name DoubleExponent-PT-100-LTLCardinality-15
ltl formula formula --ltl=/tmp/789/ltl_15_
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 5304 places, 4998 transitions and 14094 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-100 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.540 real 0.180 user 0.160 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/789/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/789/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/789/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/789/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 5301 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5305, there are 5020 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):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~25!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 33
pnml2lts-mc( 0/ 4): unique transitions count: 35
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 100
pnml2lts-mc( 0/ 4): - cum. max stack depth: 100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 100 states 109 transitions, fanout: 1.090
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.130 sec minimum, 0.137 sec on average)
pnml2lts-mc( 0/ 4): States per second: 714, Transitions per second: 779
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 93.0 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5106 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~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="DoubleExponent-PT-100"
export BK_EXAMINATION="LTLCardinality"
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 DoubleExponent-PT-100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132900571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;