About the Execution of ITS-Tools for ShieldPPPt-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4232.907 | 1381877.00 | 2244220.00 | 3119.80 | TFFFFFFFFTFFTFFF | 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.r356-tall-171683761600676.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldPPPt-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761600676
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K 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 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 11 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 337K May 18 16:43 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 ShieldPPPt-PT-050A-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-050A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717023648233
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 23:00:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 23:00:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 23:00:49] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2024-05-29 23:00:49] [INFO ] Transformed 1253 places.
[2024-05-29 23:00:49] [INFO ] Transformed 903 transitions.
[2024-05-29 23:00:49] [INFO ] Found NUPN structural information;
[2024-05-29 23:00:49] [INFO ] Parsed PT model containing 1253 places and 903 transitions and 3606 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-050A-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 216 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2024-05-29 23:00:50] [INFO ] Computed 551 invariants in 27 ms
[2024-05-29 23:00:51] [INFO ] Implicit Places using invariants in 966 ms returned []
[2024-05-29 23:00:51] [INFO ] Invariant cache hit.
[2024-05-29 23:00:52] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 2354 ms to find 0 implicit places.
Running 901 sub problems to find dead transitions.
[2024-05-29 23:00:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30034 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 901/901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 901 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30018 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/901 constraints, Known Traps: 0/0 constraints]
After SMT, in 60454ms problems are : Problem set: 0 solved, 901 unsolved
Search for dead transitions found 0 dead transitions in 60484ms
Finished structural reductions in LTL mode , in 1 iterations and 63082 ms. Remains : 1253/1253 places, 902/902 transitions.
Support contains 51 out of 1253 places after structural reductions.
[2024-05-29 23:01:53] [INFO ] Flatten gal took : 172 ms
[2024-05-29 23:01:53] [INFO ] Flatten gal took : 83 ms
[2024-05-29 23:01:53] [INFO ] Input system was already deterministic with 902 transitions.
Support contains 46 out of 1253 places (down from 51) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40000 steps (8 resets) in 1972 ms. (20 steps per ms) remains 14/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 531 ms. (75 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 414 ms. (96 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 444 ms. (89 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 425 ms. (93 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 395 ms. (101 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 333 ms. (119 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 268 ms. (148 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 14/14 properties
[2024-05-29 23:01:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 32/55 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 32/79 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1198/1253 variables, 527/606 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 1198/1804 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 902/2155 variables, 1253/3057 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2155 variables, 0/3057 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/2155 variables, 0/3057 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2155/2155 variables, and 3057 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1927 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 32/55 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 32/79 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1198/1253 variables, 527/606 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 1198/1804 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 902/2155 variables, 1253/3057 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2155 variables, 14/3071 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2155 variables, 0/3071 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/2155 variables, 0/3071 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2155/2155 variables, and 3071 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3060 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 5008ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 11 different solutions.
Finished Parikh walk after 1300 steps, including 1 resets, run visited all 14 properties in 41 ms. (steps per millisecond=31 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 14 properties in 52 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 29 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2024-05-29 23:02:01] [INFO ] Invariant cache hit.
[2024-05-29 23:02:02] [INFO ] Implicit Places using invariants in 679 ms returned []
[2024-05-29 23:02:02] [INFO ] Invariant cache hit.
[2024-05-29 23:02:03] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
Running 901 sub problems to find dead transitions.
[2024-05-29 23:02:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30035 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 901/901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 901 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30023 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/901 constraints, Known Traps: 0/0 constraints]
After SMT, in 60320ms problems are : Problem set: 0 solved, 901 unsolved
Search for dead transitions found 0 dead transitions in 60329ms
Finished structural reductions in LTL mode , in 1 iterations and 62246 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 2835 ms.
Product exploration explored 100000 steps with 50000 reset in 2849 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 30 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050A-LTLFireability-00 finished in 68285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 21 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2024-05-29 23:03:09] [INFO ] Invariant cache hit.
[2024-05-29 23:03:10] [INFO ] Implicit Places using invariants in 763 ms returned []
[2024-05-29 23:03:10] [INFO ] Invariant cache hit.
[2024-05-29 23:03:11] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 2089 ms to find 0 implicit places.
Running 901 sub problems to find dead transitions.
[2024-05-29 23:03:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30020 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 901/901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 901 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 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 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30025 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/901 constraints, Known Traps: 0/0 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 901 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Finished structural reductions in LTL mode , in 1 iterations and 62412 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-01
Product exploration explored 100000 steps with 2 reset in 852 ms.
Stack based approach found an accepted trace after 130 steps with 0 reset with depth 131 and stack size 131 in 2 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-01 finished in 63445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((!(G(p0) U (p1 U p2))||!(p2 U p3)))))'
Support contains 8 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 230 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2024-05-29 23:04:13] [INFO ] Computed 551 invariants in 5 ms
[2024-05-29 23:04:14] [INFO ] Implicit Places using invariants in 780 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 800 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 86 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2024-05-29 23:04:14] [INFO ] Computed 550 invariants in 5 ms
[2024-05-29 23:04:14] [INFO ] Implicit Places using invariants in 766 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 779 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 88 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2024-05-29 23:04:15] [INFO ] Computed 548 invariants in 3 ms
[2024-05-29 23:04:15] [INFO ] Implicit Places using invariants in 792 ms returned []
[2024-05-29 23:04:15] [INFO ] Invariant cache hit.
[2024-05-29 23:04:17] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 2046 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4036 ms. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND p2 p3), true, (AND p2 (NOT p3)), (AND (NOT p2) p3), (AND p0 p2), p0]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 854 ms.
Product exploration explored 100000 steps with 0 reset in 1103 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (OR (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 162 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter insensitive) to 6 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND p2 p3), true, (AND p2 (NOT p3)), (AND (NOT p2) p3), (AND p0 p2), p0]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (8 resets) in 1020 ms. (39 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 391 ms. (102 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 431 ms. (92 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 309 ms. (129 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 378 ms. (105 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 361 ms. (110 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 348 ms. (114 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 368 ms. (108 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 324 ms. (123 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 106699 steps, run timeout after 3004 ms. (steps per millisecond=35 ) properties seen :7 out of 12
Probabilistic random walk after 106699 steps, saw 105676 distinct states, run finished after 3008 ms. (steps per millisecond=35 ) properties seen :7
[2024-05-29 23:04:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 15/23 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1221/1244 variables, 539/571 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1244 variables, 1221/1792 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1244 variables, 0/1792 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 896/2140 variables, 1244/3036 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2140 variables, 0/3036 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/2140 variables, 0/3036 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2140/2140 variables, and 3036 constraints, problems are : Problem set: 0 solved, 5 unsolved in 955 ms.
Refiners :[Domain max(s): 1244/1244 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1244/1244 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 15/23 variables, 9/17 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 15/32 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1221/1244 variables, 539/571 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1244 variables, 1221/1792 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1244 variables, 0/1792 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 896/2140 variables, 1244/3036 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2140 variables, 4/3040 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2140 variables, 0/3040 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/2140 variables, 0/3040 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2140/2140 variables, and 3040 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1361 ms.
Refiners :[Domain max(s): 1244/1244 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1244/1244 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2332ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 1371 steps, including 0 resets, run visited all 4 properties in 29 ms. (steps per millisecond=47 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 31 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (OR (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p3))))), (G (OR p2 p3 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR p2 p3 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p2 (NOT p3) (NOT p1)))), (F p2), (F p3), (F (NOT (OR p2 (NOT p3) (NOT p0)))), (F p1), (F p0)]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p2) (NOT p3))))
Knowledge based reduction with 28 factoid took 174 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050A-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050A-LTLFireability-03 finished in 13963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!p0&&X(!p0))||F((G(F(p0))||(!p1&&X(p0)))))))'
Support contains 1 out of 1253 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 : 1253/1253 places, 902/902 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 1248 transition count 898
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 1247 transition count 897
Applied a total of 9 rules in 101 ms. Remains 1247 /1253 variables (removed 6) and now considering 897/902 (removed 5) transitions.
// Phase 1: matrix 897 rows 1247 cols
[2024-05-29 23:04:27] [INFO ] Computed 550 invariants in 9 ms
[2024-05-29 23:04:27] [INFO ] Implicit Places using invariants in 675 ms returned [1230, 1234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 678 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1245/1253 places, 897/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1243 transition count 895
Applied a total of 4 rules in 57 ms. Remains 1243 /1245 variables (removed 2) and now considering 895/897 (removed 2) transitions.
// Phase 1: matrix 895 rows 1243 cols
[2024-05-29 23:04:27] [INFO ] Computed 548 invariants in 11 ms
[2024-05-29 23:04:28] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-29 23:04:28] [INFO ] Invariant cache hit.
[2024-05-29 23:04:29] [INFO ] Implicit Places using invariants and state equation in 1178 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1243/1253 places, 895/902 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2689 ms. Remains : 1243/1253 places, 895/902 transitions.
Stuttering acceptance computed with spot in 75 ms :[false, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-04
Product exploration explored 100000 steps with 33367 reset in 895 ms.
Product exploration explored 100000 steps with 33295 reset in 976 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[false, (NOT p0)]
RANDOM walk for 33725 steps (7 resets) in 378 ms. (88 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[false, (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[false, (NOT p0)]
Support contains 1 out of 1243 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 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 34 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2024-05-29 23:04:32] [INFO ] Invariant cache hit.
[2024-05-29 23:04:32] [INFO ] Implicit Places using invariants in 640 ms returned []
[2024-05-29 23:04:32] [INFO ] Invariant cache hit.
[2024-05-29 23:04:34] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1750 ms to find 0 implicit places.
[2024-05-29 23:04:34] [INFO ] Redundant transitions in 51 ms returned []
Running 893 sub problems to find dead transitions.
[2024-05-29 23:04:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1241 variables, 1241/1241 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1241 variables, 546/1787 constraints. Problems are: Problem set: 0 solved, 893 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1241/2138 variables, and 1787 constraints, problems are : Problem set: 0 solved, 893 unsolved in 30022 ms.
Refiners :[Domain max(s): 1241/1243 constraints, Positive P Invariants (semi-flows): 546/548 constraints, State Equation: 0/1243 constraints, PredecessorRefiner: 893/893 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 893 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1241 variables, 1241/1241 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1241 variables, 546/1787 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1241 variables, 0/1787 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 3 (OVERLAPS) 2/1243 variables, 2/1789 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1243 variables, 2/1791 constraints. Problems are: Problem set: 0 solved, 893 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 timeout
1)
(s15 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1243/2138 variables, and 1791 constraints, problems are : Problem set: 0 solved, 893 unsolved in 30020 ms.
Refiners :[Domain max(s): 1243/1243 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1243 constraints, PredecessorRefiner: 0/893 constraints, Known Traps: 0/0 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 893 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62042 ms. Remains : 1243/1243 places, 895/895 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[false, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 476 ms. (83 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4434 steps, run visited all 1 properties in 66 ms. (steps per millisecond=67 )
Probabilistic random walk after 4434 steps, saw 4267 distinct states, run finished after 70 ms. (steps per millisecond=63 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[false, (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[false, (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[false, (NOT p0)]
Product exploration explored 100000 steps with 33294 reset in 809 ms.
Product exploration explored 100000 steps with 33459 reset in 948 ms.
Built C files in :
/tmp/ltsmin7585144993271900263
[2024-05-29 23:05:36] [INFO ] Computing symmetric may disable matrix : 895 transitions.
[2024-05-29 23:05:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:05:36] [INFO ] Computing symmetric may enable matrix : 895 transitions.
[2024-05-29 23:05:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:05:37] [INFO ] Computing Do-Not-Accords matrix : 895 transitions.
[2024-05-29 23:05:37] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:05:37] [INFO ] Built C files in 189ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7585144993271900263
Running compilation step : cd /tmp/ltsmin7585144993271900263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7585144993271900263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7585144993271900263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 29 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2024-05-29 23:05:40] [INFO ] Invariant cache hit.
[2024-05-29 23:05:40] [INFO ] Implicit Places using invariants in 671 ms returned []
[2024-05-29 23:05:40] [INFO ] Invariant cache hit.
[2024-05-29 23:05:42] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1871 ms to find 0 implicit places.
[2024-05-29 23:05:42] [INFO ] Redundant transitions in 10 ms returned []
Running 893 sub problems to find dead transitions.
[2024-05-29 23:05:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1241 variables, 1241/1241 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1241 variables, 546/1787 constraints. Problems are: Problem set: 0 solved, 893 unsolved
(s1098 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 1.0)
(s252 1.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 1.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 1.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 1.0)
(s352 1.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 1.0)
(s402 1.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 1.0)
(s427 1.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 1.0)
(s452 1.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 1.0)
(s477 1.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 1.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 1.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 1.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 1.0)
(s527 1.0)
(s528 0.0)
(s529 1.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 1.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 1.0)
(s546 1.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 1.0)
(s552 1.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 1.0)
(s571 1.0)
(s572 0.0)
(s573 0.0)
(s574 1.0)
(s575 0.0)
(s576 1.0)
(s577 1.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 1.0)
(s588 0.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 1.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 0.0)
(s601 1.0)
(s602 1.0)
(s603 0.0)
(s604 1.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 0.0)
(s615 1.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 1.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 1.0)
(s627 1.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 1.0)
(s638 0.0)
(s639 0.0)
(s640 1.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 0.0)
(s645 1.0)
(s646 1.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 1.0)
(s661 0.0)
(s662 1.0)
(s663 0.0)
(s664 0.0)
(s665 1.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 0.0)
(s670 1.0)
(s671 1.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 1.0)
(s677 1.0)
(s678 0.0)
(s679 1.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)
(s692 1.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 1.0)
(s697 0.0)
(s698 0.0)
(s699 1.0)
(s700 0.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 0.0)
(s712 1.0)
(s713 0.0)
(s714 0.0)
(s715 1.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 0.0)
(s720 1.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 0.0)
(s726 1.0)
(s727 1.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 1.0)
(s736 0.0)
(s737 1.0)
(s738 0.0)
(s739 0.0)
(s740 1.0)
(s741 0.0)
(s742 1.0)
(s743 0.0)
(s744 0.0)
(s745 1.0)
(s746 1.0)
(s747 0.0)
(s748 0.0)
(s749 1.0)
(s750 0.0)
(s751 1.0)
(s752 1.0)
(s753 0.0)
(s754 1.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 1.0)
(s761 0.0)
(s762 1.0)
(s763 0.0)
(s764 0.0)
(s765 1.0)
(s766 0.0)
(s767 1.0)
(s768 0.0)
(s769 0.0)
(s770 1.0)
(s771 1.0)
(s772 0.0)
(s773 0.0)
(s774 1.0)
(s775 0.0)
(s776 1.0)
(s777 1.0)
(s778 0.0)
(s779 1.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 1.0)
(s786 0.0)
(s787 1.0)
(s788 0.0)
(s789 0.0)
(s790 1.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 0.0)
(s795 1.0)
(s796 1.0)
(s797 0.0)
(s798 0.0)
(s799 1.0)
(s800 0.0)
(s801 1.0)
(s802 1.0)
(s803 0.0)
(s804 1.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 1.0)
(s811 0.0)
(s812 1.0)
(s813 0.0)
(s814 0.0)
(s815 1.0)
(s816 0.0)
(s817 1.0)
(s818 0.0)
(s819 0.0)
(s820 1.0)
(s821 1.0)
(s822 0.0)
(s823 0.0)
(s824 1.0)
(s825 0.0)
(s826 1.0)
(s827 1.0)
(s828 0.0)
(s829 1.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 1.0)
(s836 0.0)
(s837 1.0)
(s838 0.0)
(s839 0.0)
(s840 1.0)
(s841 0.0)
(s842 1.0)
(s843 0.0)
(s844 0.0)
(s845 1.0)
(s846 1.0)
(s847 0.0)
(s848 0.0)
(s849 1.0)
(s850 0.0)
(s851 1.0)
(s852 1.0)
(s853 0.0)
(s854 1.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 1.0)
(s861 0.0)
(s862 1.0)
(s863 0.0)
(s864 0.0)
(s865 1.0)
(s866 0.0)
(s867 1.0)
(s868 0.0)
(s869 0.0)
(s870 1.0)
(s871 1.0)
(s872 0.0)
(s873 0.0)
(s874 1.0)
(s875 0.0)
(s876 1.0)
(s877 1.0)
(s878 0.0)
(s879 1.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 1.0)
(s886 0.0)
(s887 1.0)
(s888 0.0)
(s889 0.0)
(s890 1.0)
(s891 0.0)
(s892 1.0)
(s893 0.0)
(s894 0.0)
(s895 1.0)
(s896 1.0)
(s897 0.0)
(s898 0.0)
(s899 1.0)
(s900 0.0)
(s901 1.0)
(s902 1.0)
(s903 0.0)
(s904 1.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 1.0)
(s911 0.0)
(s912 1.0)
(s913 0.0)
(s914 0.0)
(s915 1.0)
(s916 0.0)
(s917 1.0)
(s918 0.0)
(s919 0.0)
(s920 1.0)
(s921 1.0)
(s922 0.0)
(s923 0.0)
(s924 1.0)
(s925 0.0)
(s926 1.0)
(s927 1.0)
(s928 0.0)
(s929 1.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 1.0)
(s936 0.0)
(s937 1.0)
(s938 0.0)
(s939 0.0)
(s940 1.0)
(s941 0.0)
(s942 1.0)
(s943 0.0)
(s944 0.0)
(s945 1.0)
(s946 1.0)
(s947 0.0)
(s948 0.0)
(s949 1.0)
(s950 0.0)
(s951 1.0)
(s952 1.0)
(s953 0.0)
(s954 1.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 1.0)
(s961 0.0)
(s962 1.0)
(s963 0.0)
(s964 0.0)
(s965 1.0)
(s966 0.0)
(s967 1.0)
(s968 0.0)
(s969 0.0)
(s970 1.0)
(s971 1.0)
(s972 0.0)
(s973 0.0)
(s974 1.0)
(s975 0.0)
(s976 1.0)
(s977 1.0)
(s978 0.0)
(s979 1.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 1.0)
(s986 0.0)
(s987 1.0)
(s988 0.0)
(s989 0.0)
(s990 1.0)
(s991 0.0)
(s992 1.0)
(s993 0.0)
(s994 0.0)
(s995 1.0)
(s996 1.0)
(s997 0.0)
(s998 0.0)
(s999 1.0)
(s1000 0.0)
(s1001 1.0)
(s1002 1.0)
(s1003 0.0)
(s1004 1.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 1.0)
(s1011 0.0)
(s1012 1.0)
(s1013 0.0)
(s1014 0.0)
(s1015 1.0)
(s1016 0.0)
(s1017 1.0)
(s1018 0.0)
(s1019 0.0)
(s1020 1.0)
(s1021 1.0)
(s1022 0.0)
(s1023 0.0)
(s1024 1.0)
(s1025 0.0)
(s1026 1.0)
(s1027 1.0)
(s1028 0.0)
(s1029 1.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 1.0)
(s1036 0.0)
(s1037 1.0)
(s1038 0.0)
(s1039 0.0)
(s1040 1.0)
(s1041 0.0)
(s1042 1.0)
(s1043 0.0)
(s1044 0.0)
(s1045 1.0)
(s1046 1.0)
(s1047 0.0)
(s1048 0.0)
(s1049 1.0)
(s1050 0.0)
(s1051 1.0)
(s1052 1.0)
(s1053 0.0)
(s1054 1.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 1.0)
(s1061 0.0)
(s1062 1.0)
(s1063 0.0)
(s1064 0.0)
(s1065 1.0)
(s1066 0.0)
(s1067 1.0)
(s1068 0.0)
(s1069 0.0)
(s1070 1.0)
(s1071 1.0)
(s1072 0.0)
(s1073 0.0)
(s1074 1.0)
(s1075 0.0)
(s1076 1.0)
(s1077 1.0)
(s1078 0.0)
(s1079 1.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 1.0)
(s1086 0.0)
(s1087 1.0)
(s1088 0.0)
(s1089 0.0)
(s1090 1.0)
(s1091 0.0)
(s1092 1.0)
(s1093 0.0)
(s1094 0.0)
(s1095 1.0)
(s1096 1.0)
(s1097 0.0)
(s1098 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1241/2138 variables, and 1787 constraints, problems are : Problem set: 0 solved, 893 unsolved in 30039 ms.
Refiners :[Domain max(s): 1241/1243 constraints, Positive P Invariants (semi-flows): 546/548 constraints, State Equation: 0/1243 constraints, PredecessorRefiner: 893/893 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 893 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1241 variables, 1241/1241 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1241 variables, 546/1787 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1241 variables, 0/1787 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 3 (OVERLAPS) 2/1243 variables, 2/1789 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1243 variables, 2/1791 constraints. Problems are: Problem set: 0 solved, 893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1243/2138 variables, and 1791 constraints, problems are : Problem set: 0 solved, 893 unsolved in 30022 ms.
Refiners :[Domain max(s): 1243/1243 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1243 constraints, PredecessorRefiner: 0/893 constraints, Known Traps: 0/0 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 893 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62134 ms. Remains : 1243/1243 places, 895/895 transitions.
Built C files in :
/tmp/ltsmin4719594637150470286
[2024-05-29 23:06:42] [INFO ] Computing symmetric may disable matrix : 895 transitions.
[2024-05-29 23:06:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:06:42] [INFO ] Computing symmetric may enable matrix : 895 transitions.
[2024-05-29 23:06:42] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:06:42] [INFO ] Computing Do-Not-Accords matrix : 895 transitions.
[2024-05-29 23:06:42] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:06:42] [INFO ] Built C files in 187ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4719594637150470286
Running compilation step : cd /tmp/ltsmin4719594637150470286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4719594637150470286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4719594637150470286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 23:06:45] [INFO ] Flatten gal took : 47 ms
[2024-05-29 23:06:45] [INFO ] Flatten gal took : 44 ms
[2024-05-29 23:06:45] [INFO ] Time to serialize gal into /tmp/LTL1644032970711217536.gal : 11 ms
[2024-05-29 23:06:45] [INFO ] Time to serialize properties into /tmp/LTL16117486637211988798.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1644032970711217536.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5040480250869915726.hoa' '-atoms' '/tmp/LTL16117486637211988798.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16117486637211988798.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5040480250869915726.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1347 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.5894,376076,1,0,121,2.41843e+06,25,48,28985,1.19153e+06,265
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-050A-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-050A-LTLFireability-04 finished in 153689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(p1) U ((X(p1)&&G(p2))||X(G(p1))))))))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 1248 transition count 898
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 1247 transition count 897
Applied a total of 9 rules in 84 ms. Remains 1247 /1253 variables (removed 6) and now considering 897/902 (removed 5) transitions.
// Phase 1: matrix 897 rows 1247 cols
[2024-05-29 23:07:00] [INFO ] Computed 550 invariants in 7 ms
[2024-05-29 23:07:01] [INFO ] Implicit Places using invariants in 649 ms returned [1230, 1234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 652 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1245/1253 places, 897/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1243 transition count 895
Applied a total of 4 rules in 46 ms. Remains 1243 /1245 variables (removed 2) and now considering 895/897 (removed 2) transitions.
// Phase 1: matrix 895 rows 1243 cols
[2024-05-29 23:07:01] [INFO ] Computed 548 invariants in 7 ms
[2024-05-29 23:07:02] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-05-29 23:07:02] [INFO ] Invariant cache hit.
[2024-05-29 23:07:03] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1243/1253 places, 895/902 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2634 ms. Remains : 1243/1253 places, 895/902 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-05
Product exploration explored 100000 steps with 33253 reset in 839 ms.
Product exploration explored 100000 steps with 33299 reset in 984 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 160 ms. Reduced automaton from 4 states, 29 edges and 3 AP (stutter insensitive) to 6 states, 36 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), false, false]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (8 resets) in 520 ms. (76 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 499 ms. (80 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 430 ms. (92 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 480 ms. (83 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 425 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 536 ms. (74 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 465 ms. (85 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 469 ms. (85 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 458 ms. (87 steps per ms) remains 8/8 properties
[2024-05-29 23:07:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 8/12 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 28/40 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 8/48 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/48 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/48 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 8/56 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/56 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/56 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 42/98 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/98 variables, 16/114 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/98 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/98 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 74/172 variables, 38/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/172 variables, 38/198 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/172 variables, 8/206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/172 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 12/184 variables, 12/218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/184 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/184 variables, 12/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/184 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 16/200 variables, 8/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/200 variables, 16/266 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/200 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 86/286 variables, 54/320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/286 variables, 38/358 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/286 variables, 12/370 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/286 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 6/292 variables, 8/378 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/292 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/292 variables, 6/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/292 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 84/376 variables, 50/440 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/376 variables, 50/490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/376 variables, 10/500 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/376 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (OVERLAPS) 12/388 variables, 16/516 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/388 variables, 12/528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/388 variables, 12/540 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/388 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (OVERLAPS) 8/396 variables, 4/544 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/396 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/396 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (OVERLAPS) 70/466 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/466 variables, 30/620 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/466 variables, 12/632 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/466 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (OVERLAPS) 4/470 variables, 4/636 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/470 variables, 4/640 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/470 variables, 4/644 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/470 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (OVERLAPS) 78/548 variables, 46/690 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/548 variables, 46/736 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/548 variables, 8/744 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/548 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (OVERLAPS) 12/560 variables, 16/760 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/560 variables, 12/772 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/560 variables, 12/784 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/560 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (OVERLAPS) 8/568 variables, 4/788 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/568 variables, 8/796 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/568 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 70 (OVERLAPS) 70/638 variables, 38/834 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/638 variables, 30/864 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/638 variables, 12/876 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/638 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 74 (OVERLAPS) 4/642 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/642 variables, 4/884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/642 variables, 4/888 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/642 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 78 (OVERLAPS) 78/720 variables, 46/934 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/720 variables, 46/980 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/720 variables, 8/988 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/720 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 82 (OVERLAPS) 12/732 variables, 16/1004 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/732 variables, 12/1016 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/732 variables, 12/1028 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/732 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 86 (OVERLAPS) 8/740 variables, 4/1032 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/740 variables, 8/1040 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/740 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 89 (OVERLAPS) 70/810 variables, 38/1078 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/810 variables, 30/1108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/810 variables, 12/1120 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/810 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 93 (OVERLAPS) 4/814 variables, 4/1124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/814 variables, 4/1128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/814 variables, 4/1132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/814 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 97 (OVERLAPS) 78/892 variables, 46/1178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/892 variables, 46/1224 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/892 variables, 8/1232 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/892 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 101 (OVERLAPS) 12/904 variables, 16/1248 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/904 variables, 12/1260 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/904 variables, 12/1272 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/904 variables, 0/1272 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 105 (OVERLAPS) 8/912 variables, 4/1276 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/912 variables, 8/1284 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/912 variables, 0/1284 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 108 (OVERLAPS) 70/982 variables, 38/1322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/982 variables, 30/1352 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/982 variables, 12/1364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/982 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 112 (OVERLAPS) 4/986 variables, 4/1368 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/986 variables, 4/1372 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/986 variables, 4/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/986 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 116 (OVERLAPS) 78/1064 variables, 46/1422 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1064 variables, 46/1468 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1064 variables, 8/1476 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1064 variables, 0/1476 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 120 (OVERLAPS) 12/1076 variables, 16/1492 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1076 variables, 12/1504 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1076 variables, 12/1516 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1076 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 124 (OVERLAPS) 8/1084 variables, 4/1520 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1084 variables, 8/1528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1084 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 127 (OVERLAPS) 70/1154 variables, 38/1566 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1154 variables, 30/1596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1154 variables, 12/1608 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1154 variables, 0/1608 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 131 (OVERLAPS) 4/1158 variables, 4/1612 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1158 variables, 4/1616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1158 variables, 4/1620 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1158 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 135 (OVERLAPS) 78/1236 variables, 46/1666 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1236 variables, 46/1712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1236 variables, 8/1720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1236 variables, 0/1720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 139 (OVERLAPS) 12/1248 variables, 16/1736 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1248 variables, 12/1748 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1248 variables, 12/1760 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1248 variables, 0/1760 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 143 (OVERLAPS) 8/1256 variables, 4/1764 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1256 variables, 8/1772 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1256 variables, 0/1772 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 146 (OVERLAPS) 70/1326 variables, 38/1810 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1326 variables, 30/1840 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1326 variables, 12/1852 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1326 variables, 0/1852 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 150 (OVERLAPS) 4/1330 variables, 4/1856 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1330 variables, 4/1860 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1330 variables, 4/1864 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1330 variables, 0/1864 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 154 (OVERLAPS) 74/1404 variables, 45/1909 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1404 variables, 45/1954 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1404 variables, 9/1963 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1404 variables, 0/1963 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 158 (OVERLAPS) 10/1414 variables, 14/1977 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1414 variables, 10/1987 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1414 variables, 10/1997 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1414 variables, 0/1997 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 162 (OVERLAPS) 8/1422 variables, 4/2001 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1422 variables, 8/2009 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1422 variables, 0/2009 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 165 (OVERLAPS) 55/1477 variables, 32/2041 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1477 variables, 24/2065 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1477 variables, 9/2074 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1477 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 169 (OVERLAPS) 4/1481 variables, 4/2078 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1481 variables, 4/2082 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1481 variables, 4/2086 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1481 variables, 0/2086 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 173 (OVERLAPS) 54/1535 variables, 32/2118 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1535 variables, 32/2150 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/1535 variables, 8/2158 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1535 variables, 0/2158 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 177 (OVERLAPS) 6/1541 variables, 8/2166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/1541 variables, 6/2172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/1541 variables, 6/2178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1541 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 181 (OVERLAPS) 8/1549 variables, 4/2182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1549 variables, 8/2190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1549/2138 variables, and 2190 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5012 ms.
Refiners :[Domain max(s): 901/1243 constraints, Positive P Invariants (semi-flows): 396/548 constraints, State Equation: 893/1243 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/12 variables, 4/10 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 28/40 variables, 14/24 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 14/38 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 4/42 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/42 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 8/48 variables, 8/50 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/48 variables, 8/58 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/48 variables, 8/66 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/48 variables, 0/66 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/56 variables, 4/70 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/56 variables, 8/78 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 42/98 variables, 24/102 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/98 variables, 16/118 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/98 variables, 8/126 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/98 variables, 0/126 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 74/172 variables, 38/164 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/172 variables, 38/202 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/172 variables, 8/210 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/172 variables, 0/210 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 12/184 variables, 12/222 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/184 variables, 12/234 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/184 variables, 12/246 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/184 variables, 0/246 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 16/200 variables, 8/254 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/200 variables, 16/270 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/200 variables, 0/270 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 86/286 variables, 54/324 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/286 variables, 38/362 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/286 variables, 12/374 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/286 variables, 0/374 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 6/292 variables, 8/382 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/292 variables, 6/388 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/292 variables, 6/394 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/292 variables, 0/394 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 84/376 variables, 50/444 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/376 variables, 50/494 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/376 variables, 10/504 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/376 variables, 0/504 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 12/388 variables, 16/520 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/388 variables, 12/532 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/388 variables, 12/544 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/388 variables, 0/544 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 8/396 variables, 4/548 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/396 variables, 8/556 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/396 variables, 0/556 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 70/466 variables, 38/594 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/466 variables, 30/624 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/466 variables, 12/636 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/466 variables, 0/636 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 4/470 variables, 4/640 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/470 variables, 4/644 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/470 variables, 4/648 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/470 variables, 0/648 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 78/548 variables, 46/694 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/548 variables, 46/740 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/548 variables, 8/748 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/548 variables, 0/748 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 12/560 variables, 16/764 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/560 variables, 12/776 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/560 variables, 12/788 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/560 variables, 0/788 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 68 (OVERLAPS) 8/568 variables, 4/792 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/568 variables, 8/800 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/568 variables, 0/800 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 71 (OVERLAPS) 70/638 variables, 38/838 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/638 variables, 30/868 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/638 variables, 12/880 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/638 variables, 0/880 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 75 (OVERLAPS) 4/642 variables, 4/884 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/642 variables, 4/888 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/642 variables, 4/892 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/642 variables, 0/892 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 79 (OVERLAPS) 78/720 variables, 46/938 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/720 variables, 46/984 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/720 variables, 8/992 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/720 variables, 0/992 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 83 (OVERLAPS) 12/732 variables, 16/1008 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/732 variables, 12/1020 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/732 variables, 12/1032 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/732 variables, 0/1032 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 87 (OVERLAPS) 8/740 variables, 4/1036 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/740 variables, 8/1044 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/740 variables, 0/1044 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 90 (OVERLAPS) 70/810 variables, 38/1082 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/810 variables, 30/1112 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/810 variables, 12/1124 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/810 variables, 0/1124 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 94 (OVERLAPS) 4/814 variables, 4/1128 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/814 variables, 4/1132 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/814 variables, 4/1136 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/814 variables, 0/1136 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 98 (OVERLAPS) 78/892 variables, 46/1182 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/892 variables, 46/1228 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/892 variables, 8/1236 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/892 variables, 0/1236 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 102 (OVERLAPS) 12/904 variables, 16/1252 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/904 variables, 12/1264 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/904 variables, 12/1276 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/904 variables, 0/1276 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 106 (OVERLAPS) 8/912 variables, 4/1280 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/912 variables, 8/1288 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/912 variables, 0/1288 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 109 (OVERLAPS) 70/982 variables, 38/1326 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/982 variables, 30/1356 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/982 variables, 12/1368 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/982 variables, 0/1368 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 113 (OVERLAPS) 4/986 variables, 4/1372 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/986 variables, 4/1376 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/986 variables, 4/1380 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/986 variables, 0/1380 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 117 (OVERLAPS) 78/1064 variables, 46/1426 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1064 variables, 46/1472 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1064 variables, 8/1480 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1064 variables, 0/1480 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 121 (OVERLAPS) 12/1076 variables, 16/1496 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1076 variables, 12/1508 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1076 variables, 12/1520 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1076 variables, 0/1520 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 125 (OVERLAPS) 8/1084 variables, 4/1524 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1084 variables, 8/1532 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1084 variables, 0/1532 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 128 (OVERLAPS) 70/1154 variables, 38/1570 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1154 variables, 30/1600 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1154 variables, 12/1612 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1154 variables, 0/1612 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 132 (OVERLAPS) 4/1158 variables, 4/1616 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1158 variables, 4/1620 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1158 variables, 4/1624 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1158 variables, 0/1624 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 136 (OVERLAPS) 78/1236 variables, 46/1670 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1236 variables, 46/1716 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1236 variables, 8/1724 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1236 variables, 0/1724 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 140 (OVERLAPS) 12/1248 variables, 16/1740 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1248 variables, 12/1752 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1248 variables, 12/1764 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1248 variables, 0/1764 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 144 (OVERLAPS) 8/1256 variables, 4/1768 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1256 variables, 8/1776 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1256 variables, 0/1776 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 147 (OVERLAPS) 70/1326 variables, 38/1814 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1326 variables, 30/1844 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1326 variables, 12/1856 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1326 variables, 0/1856 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 151 (OVERLAPS) 4/1330 variables, 4/1860 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1330 variables, 4/1864 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1330 variables, 4/1868 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1330 variables, 0/1868 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 155 (OVERLAPS) 74/1404 variables, 45/1913 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1404 variables, 45/1958 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1404 variables, 9/1967 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1404 variables, 0/1967 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 159 (OVERLAPS) 10/1414 variables, 14/1981 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1414 variables, 10/1991 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1414 variables, 10/2001 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1414 variables, 0/2001 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 163 (OVERLAPS) 8/1422 variables, 4/2005 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1422 variables, 8/2013 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1422 variables, 0/2013 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 166 (OVERLAPS) 55/1477 variables, 32/2045 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1477 variables, 24/2069 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1477 variables, 9/2078 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1477 variables, 0/2078 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 170 (OVERLAPS) 4/1481 variables, 4/2082 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1481 variables, 4/2086 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1481 variables, 4/2090 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1481 variables, 0/2090 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 174 (OVERLAPS) 54/1535 variables, 32/2122 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/1535 variables, 32/2154 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1535 variables, 8/2162 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/1535 variables, 0/2162 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 178 (OVERLAPS) 6/1541 variables, 8/2170 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/1541 variables, 6/2176 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1541 variables, 6/2182 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/1541 variables, 0/2182 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 182 (OVERLAPS) 8/1549 variables, 4/2186 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1549 variables, 8/2194 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/1549 variables, 0/2194 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 185 (OVERLAPS) 47/1596 variables, 28/2222 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/1596 variables, 20/2242 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/1596 variables, 7/2249 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/1596 variables, 0/2249 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 189 (OVERLAPS) 4/1600 variables, 4/2253 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/1600 variables, 4/2257 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1600 variables, 4/2261 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/1600 variables, 0/2261 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 193 (OVERLAPS) 47/1647 variables, 28/2289 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/1647 variables, 28/2317 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/1647 variables, 10/2327 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/1647 variables, 0/2327 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 197 (OVERLAPS) 4/1651 variables, 4/2331 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/1651 variables, 4/2335 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/1651 variables, 4/2339 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/1651 variables, 0/2339 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 201 (OVERLAPS) 8/1659 variables, 4/2343 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/1659 variables, 8/2351 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/1659 variables, 0/2351 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 204 (OVERLAPS) 37/1696 variables, 24/2375 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/1696 variables, 16/2391 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1696 variables, 5/2396 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 207 (INCLUDED_ONLY) 0/1696 variables, 0/2396 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 208 (OVERLAPS) 4/1700 variables, 4/2400 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/1700 variables, 4/2404 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/1700 variables, 4/2408 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 211 (INCLUDED_ONLY) 0/1700 variables, 0/2408 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 212 (OVERLAPS) 36/1736 variables, 20/2428 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/1736 variables, 20/2448 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/1736 variables, 6/2454 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 215 (INCLUDED_ONLY) 0/1736 variables, 0/2454 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 216 (OVERLAPS) 4/1740 variables, 4/2458 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/1740 variables, 4/2462 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/1740 variables, 4/2466 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 219 (INCLUDED_ONLY) 0/1740 variables, 0/2466 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 220 (OVERLAPS) 8/1748 variables, 4/2470 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/1748 variables, 8/2478 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/1748 variables, 0/2478 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 223 (OVERLAPS) 34/1782 variables, 22/2500 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/1782 variables, 14/2514 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/1782 variables, 4/2518 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/1782 variables, 0/2518 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 227 (OVERLAPS) 4/1786 variables, 4/2522 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/1786 variables, 4/2526 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/1786 variables, 4/2530 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/1786 variables, 0/2530 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 231 (OVERLAPS) 36/1822 variables, 20/2550 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/1822 variables, 20/2570 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/1822 variables, 6/2576 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/1822 variables, 0/2576 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 235 (OVERLAPS) 4/1826 variables, 4/2580 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/1826 variables, 4/2584 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/1826 variables, 4/2588 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 238 (INCLUDED_ONLY) 0/1826 variables, 0/2588 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 239 (OVERLAPS) 8/1834 variables, 4/2592 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/1834 variables, 8/2600 constraints. Problems are: Problem set: 4 solved, 4 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 1834/2138 variables, and 2600 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5006 ms.
Refiners :[Domain max(s): 1067/1243 constraints, Positive P Invariants (semi-flows): 470/548 constraints, State Equation: 1059/1243 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 10039ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 56 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1243/1243 places, 895/895 transitions.
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 1042 ms. (38 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 48504 steps, run visited all 3 properties in 797 ms. (steps per millisecond=60 )
Probabilistic random walk after 48504 steps, saw 47765 distinct states, run finished after 800 ms. (steps per millisecond=60 ) properties seen :3
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p0) p2 p1)), (G (OR (NOT p0) p2 (NOT p1))), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND p0 p2 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 27 factoid took 415 ms. Reduced automaton from 6 states, 36 edges and 3 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p2) (NOT p1))]
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 32 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2024-05-29 23:07:19] [INFO ] Invariant cache hit.
[2024-05-29 23:07:20] [INFO ] Implicit Places using invariants in 645 ms returned []
[2024-05-29 23:07:20] [INFO ] Invariant cache hit.
[2024-05-29 23:07:21] [INFO ] Implicit Places using invariants and state equation in 1145 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
[2024-05-29 23:07:21] [INFO ] Redundant transitions in 15 ms returned []
Running 893 sub problems to find dead transitions.
[2024-05-29 23:07:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1241 variables, 1241/1241 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1241 variables, 546/1787 constraints. Problems are: Problem set: 0 solved, 893 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1241/2138 variables, and 1787 constraints, problems are : Problem set: 0 solved, 893 unsolved in 30022 ms.
Refiners :[Domain max(s): 1241/1243 constraints, Positive P Invariants (semi-flows): 546/548 constraints, State Equation: 0/1243 constraints, PredecessorRefiner: 893/893 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 893 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1241 variables, 1241/1241 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1241 variables, 546/1787 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1241 variables, 0/1787 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 3 (OVERLAPS) 2/1243 variables, 2/1789 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1243 variables, 2/1791 constraints. Problems are: Problem set: 0 solved, 893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1243/2138 variables, and 1791 constraints, problems are : Problem set: 0 solved, 893 unsolved in 30024 ms.
Refiners :[Domain max(s): 1243/1243 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1243 constraints, PredecessorRefiner: 0/893 constraints, Known Traps: 0/0 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 893 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62037 ms. Remains : 1243/1243 places, 895/895 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p1)), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 137 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1404 ms. (28 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 398 ms. (100 steps per ms) remains 3/3 properties
[2024-05-29 23:08:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/12 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 28/40 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 8/48 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/48 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/48 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 8/56 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/56 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/56 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 42/98 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/98 variables, 16/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/98 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/98 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 74/172 variables, 38/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/172 variables, 38/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/172 variables, 8/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/172 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 12/184 variables, 12/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/184 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/184 variables, 12/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/184 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 16/200 variables, 8/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/200 variables, 16/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/200 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 86/286 variables, 54/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/286 variables, 38/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/286 variables, 12/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/286 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 6/292 variables, 8/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/292 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/292 variables, 6/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/292 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 84/376 variables, 50/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/376 variables, 50/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/376 variables, 10/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/376 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 12/388 variables, 16/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/388 variables, 12/528 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/388 variables, 12/540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/388 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 8/396 variables, 4/544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/396 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/396 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 70/466 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/466 variables, 30/620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/466 variables, 12/632 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/466 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 4/470 variables, 4/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/470 variables, 4/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/470 variables, 4/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/470 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 78/548 variables, 46/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/548 variables, 46/736 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/548 variables, 8/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/548 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 12/560 variables, 16/760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/560 variables, 12/772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/560 variables, 12/784 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/560 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 8/568 variables, 4/788 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/568 variables, 8/796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/568 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (OVERLAPS) 70/638 variables, 38/834 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/638 variables, 30/864 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/638 variables, 12/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/638 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (OVERLAPS) 4/642 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/642 variables, 4/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/642 variables, 4/888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/642 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (OVERLAPS) 78/720 variables, 46/934 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/720 variables, 46/980 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/720 variables, 8/988 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/720 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (OVERLAPS) 12/732 variables, 16/1004 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/732 variables, 12/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/732 variables, 12/1028 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/732 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (OVERLAPS) 8/740 variables, 4/1032 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/740 variables, 8/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/740 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (OVERLAPS) 70/810 variables, 38/1078 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/810 variables, 30/1108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/810 variables, 12/1120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/810 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (OVERLAPS) 4/814 variables, 4/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/814 variables, 4/1128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/814 variables, 4/1132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/814 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 78/892 variables, 46/1178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/892 variables, 46/1224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/892 variables, 8/1232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/892 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (OVERLAPS) 12/904 variables, 16/1248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/904 variables, 12/1260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/904 variables, 12/1272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/904 variables, 0/1272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 8/912 variables, 4/1276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/912 variables, 8/1284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/912 variables, 0/1284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (OVERLAPS) 70/982 variables, 38/1322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/982 variables, 30/1352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/982 variables, 12/1364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/982 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (OVERLAPS) 4/986 variables, 4/1368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/986 variables, 4/1372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/986 variables, 4/1376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/986 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (OVERLAPS) 78/1064 variables, 46/1422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1064 variables, 46/1468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1064 variables, 8/1476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1064 variables, 0/1476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (OVERLAPS) 12/1076 variables, 16/1492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1076 variables, 12/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1076 variables, 12/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1076 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (OVERLAPS) 8/1084 variables, 4/1520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1084 variables, 8/1528 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1084 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 70/1154 variables, 38/1566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1154 variables, 30/1596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1154 variables, 12/1608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1154 variables, 0/1608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (OVERLAPS) 4/1158 variables, 4/1612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1158 variables, 4/1616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1158 variables, 4/1620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1158 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (OVERLAPS) 78/1236 variables, 46/1666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1236 variables, 46/1712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1236 variables, 8/1720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1236 variables, 0/1720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (OVERLAPS) 12/1248 variables, 16/1736 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1248 variables, 12/1748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1248 variables, 12/1760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1248 variables, 0/1760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (OVERLAPS) 8/1256 variables, 4/1764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1256 variables, 8/1772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1256 variables, 0/1772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (OVERLAPS) 70/1326 variables, 38/1810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1326 variables, 30/1840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1326 variables, 12/1852 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1326 variables, 0/1852 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (OVERLAPS) 4/1330 variables, 4/1856 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1330 variables, 4/1860 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1330 variables, 4/1864 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1330 variables, 0/1864 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 154 (OVERLAPS) 74/1404 variables, 45/1909 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1404 variables, 45/1954 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1404 variables, 9/1963 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1404 variables, 0/1963 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 158 (OVERLAPS) 10/1414 variables, 14/1977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1414 variables, 10/1987 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1414 variables, 10/1997 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1414 variables, 0/1997 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 162 (OVERLAPS) 8/1422 variables, 4/2001 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1422 variables, 8/2009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1422 variables, 0/2009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 165 (OVERLAPS) 55/1477 variables, 32/2041 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1477 variables, 24/2065 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1477 variables, 9/2074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1477 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 169 (OVERLAPS) 4/1481 variables, 4/2078 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1481 variables, 4/2082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1481 variables, 4/2086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1481 variables, 0/2086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 173 (OVERLAPS) 54/1535 variables, 32/2118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1535 variables, 32/2150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/1535 variables, 8/2158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1535 variables, 0/2158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 177 (OVERLAPS) 6/1541 variables, 8/2166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/1541 variables, 6/2172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/1541 variables, 6/2178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1541 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 181 (OVERLAPS) 8/1549 variables, 4/2182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1549 variables, 8/2190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1549 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 184 (OVERLAPS) 47/1596 variables, 28/2218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1596 variables, 20/2238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/1596 variables, 7/2245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/1596 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 188 (OVERLAPS) 4/1600 variables, 4/2249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/1600 variables, 4/2253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/1600 variables, 4/2257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1600 variables, 0/2257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 192 (OVERLAPS) 47/1647 variables, 28/2285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/1647 variables, 28/2313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/1647 variables, 10/2323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/1647 variables, 0/2323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 196 (OVERLAPS) 4/1651 variables, 4/2327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1651 variables, 4/2331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/1651 variables, 4/2335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/1651 variables, 0/2335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 200 (OVERLAPS) 8/1659 variables, 4/2339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/1659 variables, 8/2347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/1659 variables, 0/2347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 203 (OVERLAPS) 37/1696 variables, 24/2371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/1696 variables, 16/2387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/1696 variables, 5/2392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1696 variables, 0/2392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 207 (OVERLAPS) 4/1700 variables, 4/2396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/1700 variables, 4/2400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/1700 variables, 4/2404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/1700 variables, 0/2404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 211 (OVERLAPS) 36/1736 variables, 20/2424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/1736 variables, 20/2444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/1736 variables, 6/2450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/1736 variables, 0/2450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 215 (OVERLAPS) 4/1740 variables, 4/2454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/1740 variables, 4/2458 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/1740 variables, 4/2462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/1740 variables, 0/2462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 219 (OVERLAPS) 8/1748 variables, 4/2466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/1748 variables, 8/2474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/1748 variables, 0/2474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 222 (OVERLAPS) 34/1782 variables, 22/2496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 223 (INCLUDED_ONLY) 0/1782 variables, 14/2510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/1782 variables, 4/2514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/1782 variables, 0/2514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 226 (OVERLAPS) 4/1786 variables, 4/2518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 227 (INCLUDED_ONLY) 0/1786 variables, 4/2522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/1786 variables, 4/2526 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/1786 variables, 0/2526 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 230 (OVERLAPS) 36/1822 variables, 20/2546 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 231 (INCLUDED_ONLY) 0/1822 variables, 20/2566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/1822 variables, 6/2572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/1822 variables, 0/2572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 234 (OVERLAPS) 4/1826 variables, 4/2576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 235 (INCLUDED_ONLY) 0/1826 variables, 4/2580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/1826 variables, 4/2584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/1826 variables, 0/2584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 238 (OVERLAPS) 8/1834 variables, 4/2588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 239 (INCLUDED_ONLY) 0/1834 variables, 8/2596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/1834 variables, 0/2596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 241 (OVERLAPS) 34/1868 variables, 22/2618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/1868 variables, 14/2632 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 243 (INCLUDED_ONLY) 0/1868 variables, 4/2636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/1868 variables, 0/2636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 245 (OVERLAPS) 4/1872 variables, 4/2640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 246 (INCLUDED_ONLY) 0/1872 variables, 4/2644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 247 (INCLUDED_ONLY) 0/1872 variables, 4/2648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/1872 variables, 0/2648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 249 (OVERLAPS) 36/1908 variables, 20/2668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 250 (INCLUDED_ONLY) 0/1908 variables, 20/2688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 251 (INCLUDED_ONLY) 0/1908 variables, 6/2694 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/1908 variables, 0/2694 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 253 (OVERLAPS) 4/1912 variables, 4/2698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/1912 variables, 4/2702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 255 (INCLUDED_ONLY) 0/1912 variables, 4/2706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/1912 variables, 0/2706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 257 (OVERLAPS) 8/1920 variables, 4/2710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 258 (INCLUDED_ONLY) 0/1920 variables, 8/2718 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 259 (INCLUDED_ONLY) 0/1920 variables, 0/2718 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 260 (OVERLAPS) 34/1954 variables, 22/2740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 261 (INCLUDED_ONLY) 0/1954 variables, 14/2754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 262 (INCLUDED_ONLY) 0/1954 variables, 4/2758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 263 (INCLUDED_ONLY) 0/1954 variables, 0/2758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 264 (OVERLAPS) 4/1958 variables, 4/2762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 265 (INCLUDED_ONLY) 0/1958 variables, 4/2766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/1958 variables, 4/2770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 267 (INCLUDED_ONLY) 0/1958 variables, 0/2770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 268 (OVERLAPS) 36/1994 variables, 20/2790 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/1994 variables, 20/2810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 270 (INCLUDED_ONLY) 0/1994 variables, 6/2816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 271 (INCLUDED_ONLY) 0/1994 variables, 0/2816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 272 (OVERLAPS) 4/1998 variables, 4/2820 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 273 (INCLUDED_ONLY) 0/1998 variables, 4/2824 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 274 (INCLUDED_ONLY) 0/1998 variables, 4/2828 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 275 (INCLUDED_ONLY) 0/1998 variables, 0/2828 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 276 (OVERLAPS) 8/2006 variables, 4/2832 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 277 (INCLUDED_ONLY) 0/2006 variables, 8/2840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/2006 variables, 0/2840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 279 (OVERLAPS) 34/2040 variables, 22/2862 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 280 (INCLUDED_ONLY) 0/2040 variables, 14/2876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/2040 variables, 4/2880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 282 (INCLUDED_ONLY) 0/2040 variables, 0/2880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 283 (OVERLAPS) 4/2044 variables, 4/2884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/2044 variables, 4/2888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 285 (INCLUDED_ONLY) 0/2044 variables, 4/2892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 286 (INCLUDED_ONLY) 0/2044 variables, 0/2892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 287 (OVERLAPS) 36/2080 variables, 20/2912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 288 (INCLUDED_ONLY) 0/2080 variables, 20/2932 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 289 (INCLUDED_ONLY) 0/2080 variables, 6/2938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/2080 variables, 0/2938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 291 (OVERLAPS) 4/2084 variables, 4/2942 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 292 (INCLUDED_ONLY) 0/2084 variables, 4/2946 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/2084 variables, 4/2950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/2084 variables, 0/2950 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 295 (OVERLAPS) 8/2092 variables, 4/2954 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 296 (INCLUDED_ONLY) 0/2092 variables, 8/2962 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/2092 variables, 0/2962 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 298 (OVERLAPS) 30/2122 variables, 22/2984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 299 (INCLUDED_ONLY) 0/2122 variables, 14/2998 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 300 (INCLUDED_ONLY) 0/2122 variables, 4/3002 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 301 (INCLUDED_ONLY) 0/2122 variables, 0/3002 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 302 (OVERLAPS) 4/2126 variables, 4/3006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 303 (INCLUDED_ONLY) 0/2126 variables, 4/3010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 304 (INCLUDED_ONLY) 0/2126 variables, 4/3014 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/2126 variables, 0/3014 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 306 (OVERLAPS) 12/2138 variables, 8/3022 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 307 (INCLUDED_ONLY) 0/2138 variables, 8/3030 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5021ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 30 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1243/1243 places, 895/895 transitions.
RANDOM walk for 40000 steps (8 resets) in 1102 ms. (36 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 363 ms. (109 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 350 ms. (113 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 48504 steps, run visited all 3 properties in 770 ms. (steps per millisecond=62 )
Probabilistic random walk after 48504 steps, saw 47765 distinct states, run finished after 771 ms. (steps per millisecond=62 ) properties seen :3
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p1)), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 13 factoid took 301 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 801 ms.
Product exploration explored 100000 steps with 0 reset in 1003 ms.
Built C files in :
/tmp/ltsmin14299533390040626960
[2024-05-29 23:08:31] [INFO ] Computing symmetric may disable matrix : 895 transitions.
[2024-05-29 23:08:31] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:08:31] [INFO ] Computing symmetric may enable matrix : 895 transitions.
[2024-05-29 23:08:31] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:08:31] [INFO ] Computing Do-Not-Accords matrix : 895 transitions.
[2024-05-29 23:08:31] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:08:31] [INFO ] Built C files in 153ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14299533390040626960
Running compilation step : cd /tmp/ltsmin14299533390040626960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2984 ms.
Running link step : cd /tmp/ltsmin14299533390040626960;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin14299533390040626960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18093721432588454551.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 26 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2024-05-29 23:08:46] [INFO ] Invariant cache hit.
[2024-05-29 23:08:46] [INFO ] Implicit Places using invariants in 610 ms returned []
[2024-05-29 23:08:46] [INFO ] Invariant cache hit.
[2024-05-29 23:08:47] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
[2024-05-29 23:08:47] [INFO ] Redundant transitions in 14 ms returned []
Running 893 sub problems to find dead transitions.
[2024-05-29 23:08:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1241 variables, 1241/1241 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1241 variables, 546/1787 constraints. Problems are: Problem set: 0 solved, 893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1241/2138 variables, and 1787 constraints, problems are : Problem set: 0 solved, 893 unsolved in 30019 ms.
Refiners :[Domain max(s): 1241/1243 constraints, Positive P Invariants (semi-flows): 546/548 constraints, State Equation: 0/1243 constraints, PredecessorRefiner: 893/893 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 893 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1241 variables, 1241/1241 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1241 variables, 546/1787 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1241 variables, 0/1787 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 3 (OVERLAPS) 2/1243 variables, 2/1789 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1243 variables, 2/1791 constraints. Problems are: Problem set: 0 solved, 893 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 1)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 1)
(s99 0)
(s100 1)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 1)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 1)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 1)
(s147 0)
(s148 1)
(s149 0)
(s150 1)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 0)
(s175 1)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 1)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 1)
(s197 0)
(s198 1)
(s199 0)
(s200 1)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 1)
(s222 0)
(s223 1)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 1)
(s234 1)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 1)
(s245 0)
(s246 1)
(s247 0)
(s248 1)
(s249 0)
(s250 1)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 1)
(s259 1)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 1)
(s272 0)
(s273 1)
(s274 0)
(s275 1)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 1)
(s282 0)
(s283 1)
(s284 1)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 1)
(s297 0)
(s298 1)
(s299 0)
(s300 1)
(s301 0)
(s302 1)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 1)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 1)
(s322 0)
(s323 1)
(s324 0)
(s325 1)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 1)
(s334 1)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 1)
(s345 0)
(s346 1)
(s347 0)
(s348 1)
(s349 0)
(s350 1)
(s351 0)
(s352 1)
(s353 0)
(s354 0)
(s355 0)
(s356 1)
(s357 0)
(s358 1)
(s359 1)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 1)
(s370 0)
(s371 1)
(s372 0)
(s373 1)
(s374 0)
(s375 1)
(s376 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 1)
(s384 1)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 1)
(s395 0)
(s396 1)
(s397 0)
(s398 1)
(s399 0)
(s400 1)
(s401 0)
(s402 1)
(s403 0)
(s404 0)
(s405 0)
(s406 1)
(s407 0)
(s408 1)
(s409 1)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 1)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 1)
(s420 0)
(s421 1)
(s422 0)
(s423 1)
(s424 0)
(s425 1)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 0)
(s431 1)
(s432 0)
(s433 1)
(s434 1)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 1)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 1)
(s445 0)
(s446 1)
(s447 0)
(s448 1)
(s449 0)
(s450 1)
(s451 0)
(s452 1)
(s453 0)
(s454 0)
(s455 0)
(s456 1)
(s457 0)
(s458 1)
(s459 1)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 1)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 1)
(s470 0)
(s471 1)
(s472 0)
(s473 1)
(s474 0)
(s475 1)
(s476 0)
(s477 1)
(s478 0)
(s479 0)
(s480 0)
(s481 1)
(s482 0)
(s483 1)
(s484 1)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 1)
(s495 0)
(s496 1)
(s497 0)
(s498 1)
(s499 0)
(s500 1)
(s501 0)
(s502 1)
(s503 0)
(s504 0)
(s505 0)
(s506 1)
(s507 0)
(s508 1)
(s509 1)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 1)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 1)
(s520 0)
(s521 1)
(s522 0)
(s523 1)
(s524 0)
(s525 1)
(s526 0)
(s527 1)
(s528 0)
(s529 0)
(s530 0)
(s531 1)
(s532 0)
(s533 1)
(s534 1)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 1)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 1)
(s545 0)
(s546 1)
(s547 0)
(s548 1)
(s549 0)
(s550 1)
(s551 0)
(s552 0)
(s553 1)
(s554 1)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 1)
(s561 0)
(s562 0)
(s563 1)
(s564 0)
(s565 0)
(s566 1)
(s567 1)
(s568 0)
(s569 0)
(s570 1)
(s571 1)
(s572 0)
(s573 0)
(s574 1)
(s575 1)
(s576 0)
(s577 1)
(s578 0)
(s579 1)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 1)
(s586 0)
(s587 1)
(s588 0)
(s589 0)
(s590 1)
(s591 0)
(s592 1)
(s593 0)
(s594 0)
(s595 1)
(s596 1)
(s597 0)
(s598 0)
(s599 1)
(s600 0)
(s601 1)
(s602 1)
(s603 0)
(s604 1)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 1)
(s611 0)
(s612 1)
(s613 0)
(s614 0)
(s615 1)
(s616 0)
(s617 1)
(s618 0)
(s619 0)
(s620 1)
(s621 1)
(s622 0)
(s623 0)
(s624 1)
(s625 0)
(s626 1)
(s627 1)
(s628 0)
(s629 1)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 1)
(s636 0)
(s637 1)
(s638 0)
(s639 0)
(s640 1)
(s641 0)
(s642 1)
(s643 0)
(s644 0)
(s645 1)
(s646 1)
(s647 0)
(s648 0)
(s649 1)
(s650 0)
(s651 1)
(s652 1)
(s653 0)
(s654 1)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 1)
(s661 0)
(s662 1)
(s663 0)
(s664 0)
(s665 1)
(s666 0)
(s667 1)
(s668 0)
(s669 0)
(s670 1)
(s671 1)
(s672 0)
(s673 0)
(s674 1)
(s675 0)
(s676 1)
(s677 1)
(s678 0)
(s679 1)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 1)
(s686 0)
(s687 1)
(s688 0)
(s689 0)
(s690 1)
(s691 0)
(s692 1)
(s693 0)
(s694 0)
(s695 1)
(s696 1)
(s697 0)
(s698 0)
(s699 1)
(s700 0)
(s701 1)
(s702 1)
(s703 0)
(s704 1)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 1)
(s711 0)
(s712 1)
(s713 0)
(s714 0)
(s715 1)
(s716 0)
(s717 1)
(s718 0)
(s719 0)
(s720 1)
(s721 1)
(s722 0)
(s723 0)
(s724 1)
(s725 0)
(s726 1)
(s727 1)
(s728 0)
(s729 1)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 1)
(s736 0)
(s737 1)
(s738 0)
(s739 0)
(s740 1)
(s741 0)
(s742 1)
(s743 0)
(s744 0)
(s745 1)
(s746 1)
(s747 0)
(s748 0)
(s749 1)
(s750 0)
(s751 1)
(s752 1)
(s753 0)
(s754 1)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 1)
(s761 0)
(s762 1)
(s763 0)
(s764 0)
(s765 1)
(s766 0)
(s767 1)
(s768 0)
(s769 0)
(s770 1)
(s771 1)
(s772 0)
(s773 0)
(s774 1)
(s775 0)
(s776 1)
(s777 1)
(s778 0)
(s779 1)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 1)
(s786 0)
(s787 1)
(s788 0)
(s789 0)
(s790 1)
(s791 0)
(s792 1)
(s793 0)
(s794 0)
(s795 1)
(s796 1)
(s797 0)
(s798 0)
(s799 1)
(s800 0)
(s801 1)
(s802 1)
(s803 0)
(s804 1)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 1)
(s811 0)
(s812 1)
(s813 0)
(s814 0)
(s815 1)
(s816 0)
(s817 1)
(s818 0)
(s819 0)
(s820 1)
(s821 1)
(s822 0)
(s823 0)
(s824 1)
(s825 0)
(s826 1)
(s827 1)
(s828 0)
(s829 1)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 1)
(s836 0)
(s837 1)
(s838 0)
(s839 0)
(s840 1)
(s841 0)
(s842 1)
(s843 0)
(s844 0)
(s845 1)
(s846 1)
(s847 0)
(s848 0)
(s849 1)
(s850 0)
(s851 1)
(s852 1)
(s853 0)
(s854 1)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 1)
(s861 0)
(s862 1)
(s863 0)
(s864 0)
(s865 1)
(s866 0)
(s867 1)
(s868 0)
(s869 0)
(s870 1)
(s871 1)
(s872 0)
(s873 0)
(s874 1)
(s875 0)
(s876 1)
(s877 1)
(s878 0)
(s879 1)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 1)
(s886 0)
(s887 1)
(s888 0)
(s889 0)
(s890 1)
(s891 0)
(s892 1)
(s893 0)
(s894 0)
(s895 1)
(s896 1)
(s897 0)
(s898 0)
(s899 1)
(s900 0)
(s901 1)
(s902 1)
(s903 0)
(s904 1)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 1)
(s911 0)
(s912 1)
(s913 0)
(s914 0)
(s915 1)
(s916 0)
(s917 1)
(s918 0)
(s919 0)
(s920 1)
(s921 1)
(s922 0)
(s923 0)
(s924 1)
(s925 0)
(s926 1)
(s927 1)
(s928 0)
(s929 1)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 1)
(s936 0)
(s937 1)
(s938 0)
(s939 0)
(s940 timeout
1)
(s941 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1243/2138 variables, and 1791 constraints, problems are : Problem set: 0 solved, 893 unsolved in 30030 ms.
Refiners :[Domain max(s): 1243/1243 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1243 constraints, PredecessorRefiner: 0/893 constraints, Known Traps: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 893 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62059 ms. Remains : 1243/1243 places, 895/895 transitions.
Built C files in :
/tmp/ltsmin6155115548312961572
[2024-05-29 23:09:48] [INFO ] Computing symmetric may disable matrix : 895 transitions.
[2024-05-29 23:09:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:09:48] [INFO ] Computing symmetric may enable matrix : 895 transitions.
[2024-05-29 23:09:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:09:48] [INFO ] Computing Do-Not-Accords matrix : 895 transitions.
[2024-05-29 23:09:48] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:09:48] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6155115548312961572
Running compilation step : cd /tmp/ltsmin6155115548312961572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6155115548312961572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6155115548312961572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 23:09:51] [INFO ] Flatten gal took : 61 ms
[2024-05-29 23:09:51] [INFO ] Flatten gal took : 49 ms
[2024-05-29 23:09:51] [INFO ] Time to serialize gal into /tmp/LTL17554150283240356267.gal : 31 ms
[2024-05-29 23:09:51] [INFO ] Time to serialize properties into /tmp/LTL3353599400529606663.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17554150283240356267.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4577560758318469828.hoa' '-atoms' '/tmp/LTL3353599400529606663.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3353599400529606663.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4577560758318469828.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 23:10:06] [INFO ] Flatten gal took : 32 ms
[2024-05-29 23:10:06] [INFO ] Flatten gal took : 31 ms
[2024-05-29 23:10:06] [INFO ] Time to serialize gal into /tmp/LTL13355443660793307717.gal : 6 ms
[2024-05-29 23:10:06] [INFO ] Time to serialize properties into /tmp/LTL9822096743743541207.ltl : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13355443660793307717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9822096743743541207.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(p995==0)"))||((X("(p224==0)"))U((X(G("(p224==0)")))||((X("(p224==0)"))&&(G("(p995==0)")))))))))
Formula 0 simplified : G(F!"(p995==0)" & F!"(p224==0)" & FG(F!"(p995==0)" | X!"(p224==0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 23:10:21] [INFO ] Flatten gal took : 29 ms
[2024-05-29 23:10:21] [INFO ] Applying decomposition
[2024-05-29 23:10:21] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6972916091713082145.txt' '-o' '/tmp/graph6972916091713082145.bin' '-w' '/tmp/graph6972916091713082145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6972916091713082145.bin' '-l' '-1' '-v' '-w' '/tmp/graph6972916091713082145.weights' '-q' '0' '-e' '0.001'
[2024-05-29 23:10:22] [INFO ] Decomposing Gal with order
[2024-05-29 23:10:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 23:10:22] [INFO ] Removed a total of 149 redundant transitions.
[2024-05-29 23:10:22] [INFO ] Flatten gal took : 125 ms
[2024-05-29 23:10:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 32 ms.
[2024-05-29 23:10:22] [INFO ] Time to serialize gal into /tmp/LTL18048311344554491122.gal : 31 ms
[2024-05-29 23:10:22] [INFO ] Time to serialize properties into /tmp/LTL15726124112725085576.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18048311344554491122.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15726124112725085576.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(i18.u317.p995==0)"))||((X("(i3.i0.i0.i1.u71.p224==0)"))U((X(G("(i3.i0.i0.i1.u71.p224==0)")))||((X("(i3.i0.i0.i1.u71.p224==...194
Formula 0 simplified : G(F!"(i18.u317.p995==0)" & F!"(i3.i0.i0.i1.u71.p224==0)" & FG(F!"(i18.u317.p995==0)" | X!"(i3.i0.i0.i1.u71.p224==0)"))
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-050A-LTLFireability-05 finished in 216723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 86 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2024-05-29 23:10:37] [INFO ] Computed 551 invariants in 3 ms
[2024-05-29 23:10:38] [INFO ] Implicit Places using invariants in 753 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 755 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 40 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2024-05-29 23:10:38] [INFO ] Computed 550 invariants in 7 ms
[2024-05-29 23:10:39] [INFO ] Implicit Places using invariants in 657 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 659 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 46 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2024-05-29 23:10:39] [INFO ] Computed 548 invariants in 8 ms
[2024-05-29 23:10:39] [INFO ] Implicit Places using invariants in 684 ms returned []
[2024-05-29 23:10:39] [INFO ] Invariant cache hit.
[2024-05-29 23:10:41] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1981 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3567 ms. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-06
Product exploration explored 100000 steps with 142 reset in 816 ms.
Product exploration explored 100000 steps with 131 reset in 992 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2052 steps (0 resets) in 34 ms. (58 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 32 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2024-05-29 23:10:43] [INFO ] Invariant cache hit.
[2024-05-29 23:10:44] [INFO ] Implicit Places using invariants in 911 ms returned []
[2024-05-29 23:10:44] [INFO ] Invariant cache hit.
[2024-05-29 23:10:45] [INFO ] Implicit Places using invariants and state equation in 1255 ms returned []
Implicit Place search using SMT with State Equation took 2188 ms to find 0 implicit places.
[2024-05-29 23:10:45] [INFO ] Redundant transitions in 11 ms returned []
Running 895 sub problems to find dead transitions.
[2024-05-29 23:10:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1243 variables, 1243/1243 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1243 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 2 (OVERLAPS) 1/1244 variables, 548/1791 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1244 variables, 1/1792 constraints. Problems are: Problem set: 0 solved, 895 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1244/2140 variables, and 1792 constraints, problems are : Problem set: 0 solved, 895 unsolved in 30022 ms.
Refiners :[Domain max(s): 1244/1244 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1244 constraints, PredecessorRefiner: 895/895 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 895 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1243 variables, 1243/1243 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1243 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 2 (OVERLAPS) 1/1244 variables, 548/1791 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1244 variables, 1/1792 constraints. Problems are: Problem set: 0 solved, 895 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 1244/2140 variables, and 1792 constraints, problems are : Problem set: 0 solved, 895 unsolved in 30028 ms.
Refiners :[Domain max(s): 1244/1244 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1244 constraints, PredecessorRefiner: 0/895 constraints, Known Traps: 0/0 constraints]
After SMT, in 60244ms problems are : Problem set: 0 solved, 895 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62496 ms. Remains : 1244/1244 places, 896/896 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1281 steps (0 resets) in 25 ms. (49 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 144 reset in 769 ms.
Product exploration explored 100000 steps with 142 reset in 936 ms.
Built C files in :
/tmp/ltsmin15197664351664500451
[2024-05-29 23:11:48] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2024-05-29 23:11:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:11:48] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2024-05-29 23:11:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:11:48] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2024-05-29 23:11:48] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:11:48] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15197664351664500451
Running compilation step : cd /tmp/ltsmin15197664351664500451;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2984 ms.
Running link step : cd /tmp/ltsmin15197664351664500451;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin15197664351664500451;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14658872416882180256.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 25 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2024-05-29 23:12:03] [INFO ] Invariant cache hit.
[2024-05-29 23:12:03] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-05-29 23:12:03] [INFO ] Invariant cache hit.
[2024-05-29 23:12:05] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1975 ms to find 0 implicit places.
[2024-05-29 23:12:05] [INFO ] Redundant transitions in 12 ms returned []
Running 895 sub problems to find dead transitions.
[2024-05-29 23:12:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1243 variables, 1243/1243 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1243 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 2 (OVERLAPS) 1/1244 variables, 548/1791 constraints. Problems are: Problem set: 0 solved, 895 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1244 variables, 1/1792 constraints. Problems are: Problem set: 0 solved, 895 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1244/2140 variables, and 1792 constraints, problems are : Problem set: 0 solved, 895 unsolved in 30028 ms.
Refiners :[Domain max(s): 1244/1244 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1244 constraints, PredecessorRefiner: 895/895 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 895 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1243 variables, 1243/1243 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1243 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 2 (OVERLAPS) 1/1244 variables, 548/1791 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1244 variables, 1/1792 constraints. Problems are: Problem set: 0 solved, 895 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1244/2140 variables, and 1792 constraints, problems are : Problem set: 0 solved, 895 unsolved in 30017 ms.
Refiners :[Domain max(s): 1244/1244 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1244 constraints, PredecessorRefiner: 0/895 constraints, Known Traps: 0/0 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 895 unsolved
Search for dead transitions found 0 dead transitions in 60243ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62266 ms. Remains : 1244/1244 places, 896/896 transitions.
Built C files in :
/tmp/ltsmin17792607697333940470
[2024-05-29 23:13:05] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2024-05-29 23:13:05] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:13:05] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2024-05-29 23:13:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:13:05] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2024-05-29 23:13:05] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:13:05] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17792607697333940470
Running compilation step : cd /tmp/ltsmin17792607697333940470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2931 ms.
Running link step : cd /tmp/ltsmin17792607697333940470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin17792607697333940470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased912598920583415542.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 23:13:20] [INFO ] Flatten gal took : 42 ms
[2024-05-29 23:13:20] [INFO ] Flatten gal took : 42 ms
[2024-05-29 23:13:20] [INFO ] Time to serialize gal into /tmp/LTL14362748380222159101.gal : 6 ms
[2024-05-29 23:13:20] [INFO ] Time to serialize properties into /tmp/LTL12494387589840850577.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14362748380222159101.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3739215740905492775.hoa' '-atoms' '/tmp/LTL12494387589840850577.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12494387589840850577.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3739215740905492775.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 23:13:35] [INFO ] Flatten gal took : 39 ms
[2024-05-29 23:13:35] [INFO ] Flatten gal took : 39 ms
[2024-05-29 23:13:35] [INFO ] Time to serialize gal into /tmp/LTL15895617990685354332.gal : 5 ms
[2024-05-29 23:13:35] [INFO ] Time to serialize properties into /tmp/LTL16889498641542375743.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15895617990685354332.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16889498641542375743.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p1105==0)||(p1122==0))&&((p82==0)||(p84==0)))"))))
Formula 0 simplified : FG!"(((p1105==0)||(p1122==0))&&((p82==0)||(p84==0)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 23:13:50] [INFO ] Flatten gal took : 37 ms
[2024-05-29 23:13:50] [INFO ] Applying decomposition
[2024-05-29 23:13:50] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8745505632648619429.txt' '-o' '/tmp/graph8745505632648619429.bin' '-w' '/tmp/graph8745505632648619429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8745505632648619429.bin' '-l' '-1' '-v' '-w' '/tmp/graph8745505632648619429.weights' '-q' '0' '-e' '0.001'
[2024-05-29 23:13:51] [INFO ] Decomposing Gal with order
[2024-05-29 23:13:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 23:13:51] [INFO ] Removed a total of 149 redundant transitions.
[2024-05-29 23:13:51] [INFO ] Flatten gal took : 86 ms
[2024-05-29 23:13:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 168 ms.
[2024-05-29 23:13:51] [INFO ] Time to serialize gal into /tmp/LTL14991418379685054240.gal : 15 ms
[2024-05-29 23:13:51] [INFO ] Time to serialize properties into /tmp/LTL9986948021509981575.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14991418379685054240.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9986948021509981575.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i20.u354.p1105==0)||(i20.u358.p1122==0))&&((i1.u26.p82==0)||(i1.u26.p84==0)))"))))
Formula 0 simplified : FG!"(((i20.u354.p1105==0)||(i20.u358.p1122==0))&&((i1.u26.p82==0)||(i1.u26.p84==0)))"
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-050A-LTLFireability-06 finished in 209082 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)))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 17 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2024-05-29 23:14:06] [INFO ] Computed 551 invariants in 5 ms
[2024-05-29 23:14:07] [INFO ] Implicit Places using invariants in 669 ms returned []
[2024-05-29 23:14:07] [INFO ] Invariant cache hit.
[2024-05-29 23:14:08] [INFO ] Implicit Places using invariants and state equation in 1255 ms returned []
Implicit Place search using SMT with State Equation took 1928 ms to find 0 implicit places.
Running 901 sub problems to find dead transitions.
[2024-05-29 23:14:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2155 variables, and 1252 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30017 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 901/901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 901 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30054 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/901 constraints, Known Traps: 0/0 constraints]
After SMT, in 60284ms problems are : Problem set: 0 solved, 901 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Finished structural reductions in LTL mode , in 1 iterations and 62241 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 842 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-07 finished in 63164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p2)||p1)&&p0))))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 59 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2024-05-29 23:15:09] [INFO ] Computed 551 invariants in 2 ms
[2024-05-29 23:15:10] [INFO ] Implicit Places using invariants in 830 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 842 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 29 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2024-05-29 23:15:10] [INFO ] Computed 550 invariants in 3 ms
[2024-05-29 23:15:11] [INFO ] Implicit Places using invariants in 650 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 677 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 42 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2024-05-29 23:15:11] [INFO ] Computed 548 invariants in 4 ms
[2024-05-29 23:15:12] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-05-29 23:15:12] [INFO ] Invariant cache hit.
[2024-05-29 23:15:13] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3506 ms. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 791 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-08 finished in 4389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((G(p0) U p1))))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 18 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2024-05-29 23:15:14] [INFO ] Computed 551 invariants in 6 ms
[2024-05-29 23:15:14] [INFO ] Implicit Places using invariants in 673 ms returned []
[2024-05-29 23:15:14] [INFO ] Invariant cache hit.
[2024-05-29 23:15:16] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 1933 ms to find 0 implicit places.
Running 901 sub problems to find dead transitions.
[2024-05-29 23:15:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 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 1252/2155 variables, and 1252 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30024 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 901/901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 901 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30022 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/901 constraints, Known Traps: 0/0 constraints]
After SMT, in 60254ms problems are : Problem set: 0 solved, 901 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Finished structural reductions in LTL mode , in 1 iterations and 62215 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-13
Product exploration explored 100000 steps with 174 reset in 792 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-13 finished in 63115 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(X(F(p1)))))&&X(p2)))'
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 23 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2024-05-29 23:16:17] [INFO ] Invariant cache hit.
[2024-05-29 23:16:17] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-29 23:16:17] [INFO ] Invariant cache hit.
[2024-05-29 23:16:19] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 1904 ms to find 0 implicit places.
Running 901 sub problems to find dead transitions.
[2024-05-29 23:16:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 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 1252/2155 variables, and 1252 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30018 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 901/901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 901 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30032 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/901 constraints, Known Traps: 0/0 constraints]
After SMT, in 60256ms problems are : Problem set: 0 solved, 901 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Finished structural reductions in LTL mode , in 1 iterations and 62193 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-14
Product exploration explored 100000 steps with 8 reset in 767 ms.
Stack based approach found an accepted trace after 134 steps with 0 reset with depth 135 and stack size 135 in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-14 finished in 63154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(!p0)&&F(p1))||G(!p0)))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 48 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2024-05-29 23:17:20] [INFO ] Computed 551 invariants in 7 ms
[2024-05-29 23:17:21] [INFO ] Implicit Places using invariants in 686 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 688 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 28 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2024-05-29 23:17:21] [INFO ] Computed 550 invariants in 3 ms
[2024-05-29 23:17:21] [INFO ] Implicit Places using invariants in 687 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 688 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 45 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2024-05-29 23:17:21] [INFO ] Computed 548 invariants in 6 ms
[2024-05-29 23:17:22] [INFO ] Implicit Places using invariants in 673 ms returned []
[2024-05-29 23:17:22] [INFO ] Invariant cache hit.
[2024-05-29 23:17:23] [INFO ] Implicit Places using invariants and state equation in 1251 ms returned []
Implicit Place search using SMT with State Equation took 1928 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3427 ms. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 89 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 841 ms.
Product exploration explored 100000 steps with 0 reset in 979 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, (AND p0 (NOT p1)), p0]
RANDOM walk for 40000 steps (8 resets) in 684 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 393 ms. (101 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 551 ms. (72 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 433 ms. (92 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 461 ms. (86 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 23020 steps, run visited all 4 properties in 529 ms. (steps per millisecond=43 )
Probabilistic random walk after 23020 steps, saw 22480 distinct states, run finished after 532 ms. (steps per millisecond=43 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 241 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[p0, (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 133 ms :[p0, (AND p0 (NOT p1)), p0]
Support contains 4 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 29 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2024-05-29 23:17:27] [INFO ] Invariant cache hit.
[2024-05-29 23:17:28] [INFO ] Implicit Places using invariants in 669 ms returned []
[2024-05-29 23:17:28] [INFO ] Invariant cache hit.
[2024-05-29 23:17:29] [INFO ] Implicit Places using invariants and state equation in 1284 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
[2024-05-29 23:17:29] [INFO ] Redundant transitions in 15 ms returned []
Running 895 sub problems to find dead transitions.
[2024-05-29 23:17:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1243 variables, 1243/1243 constraints. Problems are: Problem set: 0 solved, 895 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1243/2140 variables, and 1243 constraints, problems are : Problem set: 0 solved, 895 unsolved in 30029 ms.
Refiners :[Domain max(s): 1243/1244 constraints, Positive P Invariants (semi-flows): 0/548 constraints, State Equation: 0/1244 constraints, PredecessorRefiner: 895/895 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 895 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1243 variables, 1243/1243 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1243 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 2 (OVERLAPS) 1/1244 variables, 548/1791 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1244 variables, 1/1792 constraints. Problems are: Problem set: 0 solved, 895 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 1244/2140 variables, and 1792 constraints, problems are : Problem set: 0 solved, 895 unsolved in 30018 ms.
Refiners :[Domain max(s): 1244/1244 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1244 constraints, PredecessorRefiner: 0/895 constraints, Known Traps: 0/0 constraints]
After SMT, in 60249ms problems are : Problem set: 0 solved, 895 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62265 ms. Remains : 1244/1244 places, 896/896 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[p0, (AND p0 (NOT p1)), p0]
RANDOM walk for 35345 steps (7 resets) in 1509 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 199 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[p0, (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 95 ms :[p0, (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 105 ms :[p0, (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 0 reset in 772 ms.
Product exploration explored 100000 steps with 0 reset in 979 ms.
Built C files in :
/tmp/ltsmin15187048198946984422
[2024-05-29 23:18:33] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2024-05-29 23:18:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:18:33] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2024-05-29 23:18:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:18:33] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2024-05-29 23:18:33] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:18:33] [INFO ] Built C files in 155ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15187048198946984422
Running compilation step : cd /tmp/ltsmin15187048198946984422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2964 ms.
Running link step : cd /tmp/ltsmin15187048198946984422;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin15187048198946984422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18015760653139322738.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 24 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2024-05-29 23:18:48] [INFO ] Invariant cache hit.
[2024-05-29 23:18:48] [INFO ] Implicit Places using invariants in 640 ms returned []
[2024-05-29 23:18:48] [INFO ] Invariant cache hit.
[2024-05-29 23:18:50] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 1910 ms to find 0 implicit places.
[2024-05-29 23:18:50] [INFO ] Redundant transitions in 13 ms returned []
Running 895 sub problems to find dead transitions.
[2024-05-29 23:18:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1243 variables, 1243/1243 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1243 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 2 (OVERLAPS) 1/1244 variables, 548/1791 constraints. Problems are: Problem set: 0 solved, 895 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1244 variables, 1/1792 constraints. Problems are: Problem set: 0 solved, 895 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1244/2140 variables, and 1792 constraints, problems are : Problem set: 0 solved, 895 unsolved in 30031 ms.
Refiners :[Domain max(s): 1244/1244 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1244 constraints, PredecessorRefiner: 895/895 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 895 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1243 variables, 1243/1243 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1243 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 2 (OVERLAPS) 1/1244 variables, 548/1791 constraints. Problems are: Problem set: 0 solved, 895 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1244 variables, 1/1792 constraints. Problems are: Problem set: 0 solved, 895 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1244/2140 variables, and 1792 constraints, problems are : Problem set: 0 solved, 895 unsolved in 30023 ms.
Refiners :[Domain max(s): 1244/1244 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1244 constraints, PredecessorRefiner: 0/895 constraints, Known Traps: 0/0 constraints]
After SMT, in 60265ms problems are : Problem set: 0 solved, 895 unsolved
Search for dead transitions found 0 dead transitions in 60272ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62227 ms. Remains : 1244/1244 places, 896/896 transitions.
Built C files in :
/tmp/ltsmin510430087486167637
[2024-05-29 23:19:50] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2024-05-29 23:19:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:19:50] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2024-05-29 23:19:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:19:50] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2024-05-29 23:19:50] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:19:50] [INFO ] Built C files in 140ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin510430087486167637
Running compilation step : cd /tmp/ltsmin510430087486167637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin510430087486167637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin510430087486167637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 23:19:53] [INFO ] Flatten gal took : 37 ms
[2024-05-29 23:19:53] [INFO ] Flatten gal took : 35 ms
[2024-05-29 23:19:53] [INFO ] Time to serialize gal into /tmp/LTL16974994248801204185.gal : 5 ms
[2024-05-29 23:19:53] [INFO ] Time to serialize properties into /tmp/LTL15294486320809253570.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16974994248801204185.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15300928296823353673.hoa' '-atoms' '/tmp/LTL15294486320809253570.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15294486320809253570.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15300928296823353673.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 23:20:08] [INFO ] Flatten gal took : 40 ms
[2024-05-29 23:20:08] [INFO ] Flatten gal took : 36 ms
[2024-05-29 23:20:08] [INFO ] Time to serialize gal into /tmp/LTL2558556750106246082.gal : 10 ms
[2024-05-29 23:20:08] [INFO ] Time to serialize properties into /tmp/LTL14728773718416732647.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2558556750106246082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14728773718416732647.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((p628==0)||(p651==0))"))||((X("((p628==0)||(p651==0))"))&&(F("((p729==1)&&(p748==1))")))))))
Formula 0 simplified : G(F!"((p628==0)||(p651==0))" & F(G!"((p729==1)&&(p748==1))" | G!"((p628==0)||(p651==0))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 23:20:23] [INFO ] Flatten gal took : 35 ms
[2024-05-29 23:20:23] [INFO ] Applying decomposition
[2024-05-29 23:20:23] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14881864804319912248.txt' '-o' '/tmp/graph14881864804319912248.bin' '-w' '/tmp/graph14881864804319912248.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14881864804319912248.bin' '-l' '-1' '-v' '-w' '/tmp/graph14881864804319912248.weights' '-q' '0' '-e' '0.001'
[2024-05-29 23:20:23] [INFO ] Decomposing Gal with order
[2024-05-29 23:20:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 23:20:24] [INFO ] Removed a total of 149 redundant transitions.
[2024-05-29 23:20:24] [INFO ] Flatten gal took : 67 ms
[2024-05-29 23:20:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 110 ms.
[2024-05-29 23:20:24] [INFO ] Time to serialize gal into /tmp/LTL9909768938492832625.gal : 30 ms
[2024-05-29 23:20:24] [INFO ] Time to serialize properties into /tmp/LTL2975504558110860647.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9909768938492832625.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2975504558110860647.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i11.i2.i0.u201.p628==0)||(i11.i2.i0.u208.p651==0))"))||((X("((i11.i2.i0.u201.p628==0)||(i11.i2.i0.u208.p651==0))"))&&(F("...215
Formula 0 simplified : G(F!"((i11.i2.i0.u201.p628==0)||(i11.i2.i0.u208.p651==0))" & F(G!"((i13.i0.i0.u233.p729==1)&&(i13.i0.i0.u238.p748==1))" | G!"((i11.i...203
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-050A-LTLFireability-15 finished in 198968 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(p1) U ((X(p1)&&G(p2))||X(G(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(!p0)&&F(p1))||G(!p0)))))'
[2024-05-29 23:20:39] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12014726698993025535
[2024-05-29 23:20:39] [INFO ] Computing symmetric may disable matrix : 902 transitions.
[2024-05-29 23:20:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:20:39] [INFO ] Computing symmetric may enable matrix : 902 transitions.
[2024-05-29 23:20:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:20:40] [INFO ] Applying decomposition
[2024-05-29 23:20:40] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph573442988772980319.txt' '-o' '/tmp/graph573442988772980319.bin' '-w' '/tmp/graph573442988772980319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph573442988772980319.bin' '-l' '-1' '-v' '-w' '/tmp/graph573442988772980319.weights' '-q' '0' '-e' '0.001'
[2024-05-29 23:20:40] [INFO ] Decomposing Gal with order
[2024-05-29 23:20:40] [INFO ] Computing Do-Not-Accords matrix : 902 transitions.
[2024-05-29 23:20:40] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:20:40] [INFO ] Built C files in 176ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12014726698993025535
Running compilation step : cd /tmp/ltsmin12014726698993025535;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 23:20:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 23:20:40] [INFO ] Removed a total of 150 redundant transitions.
[2024-05-29 23:20:40] [INFO ] Flatten gal took : 104 ms
[2024-05-29 23:20:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 61 ms.
[2024-05-29 23:20:40] [INFO ] Time to serialize gal into /tmp/LTLFireability16780284529969611688.gal : 33 ms
[2024-05-29 23:20:40] [INFO ] Time to serialize properties into /tmp/LTLFireability8659385629625647598.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16780284529969611688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8659385629625647598.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G(F((G("(i19.u317.p995==0)"))||((X("(i3.u71.p224!=1)"))U(((X("(i3.u71.p224!=1)"))&&(G("(i19.u317.p995!=1)")))||(X(G("(i3.u71.p224!=...167
Formula 0 simplified : G(F!"(i19.u317.p995==0)" & F!"(i3.u71.p224!=1)" & FG(X!"(i3.u71.p224!=1)" | F!"(i19.u317.p995!=1)"))
Compilation finished in 3191 ms.
Running link step : cd /tmp/ltsmin12014726698993025535;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin12014726698993025535;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(X((LTLAPp1==true)) U ((X((LTLAPp1==true))&&[]((LTLAPp2==true)))||X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.126: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.126: LTL layer: formula: [](<>(([]((LTLAPp0==true))||(X((LTLAPp1==true)) U ((X((LTLAPp1==true))&&[]((LTLAPp2==true)))||X([]((LTLAPp1==true))))))))
pins2lts-mc-linux64( 3/ 8), 0.126: "[](<>(([]((LTLAPp0==true))||(X((LTLAPp1==true)) U ((X((LTLAPp1==true))&&[]((LTLAPp2==true)))||X([]((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.127: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.129: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.132: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.137: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.150: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.153: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.157: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.157: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.453: There are 909 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.453: State length is 1254, there are 956 groups
pins2lts-mc-linux64( 0/ 8), 0.453: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.453: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.453: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.453: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.536: [Blue] ~67 levels ~960 states ~3616 transitions
pins2lts-mc-linux64( 1/ 8), 0.622: [Blue] ~142 levels ~1920 states ~8976 transitions
pins2lts-mc-linux64( 1/ 8), 0.761: [Blue] ~279 levels ~3840 states ~18496 transitions
pins2lts-mc-linux64( 1/ 8), 1.045: [Blue] ~558 levels ~7680 states ~40032 transitions
pins2lts-mc-linux64( 1/ 8), 1.556: [Blue] ~1125 levels ~15360 states ~86032 transitions
pins2lts-mc-linux64( 1/ 8), 2.450: [Blue] ~2293 levels ~30720 states ~186032 transitions
pins2lts-mc-linux64( 1/ 8), 4.122: [Blue] ~4622 levels ~61440 states ~399376 transitions
pins2lts-mc-linux64( 7/ 8), 7.520: [Blue] ~9185 levels ~122880 states ~797984 transitions
pins2lts-mc-linux64( 1/ 8), 13.455: [Blue] ~18373 levels ~245760 states ~1757344 transitions
pins2lts-mc-linux64( 1/ 8), 24.474: [Blue] ~44952 levels ~491520 states ~3459888 transitions
pins2lts-mc-linux64( 5/ 8), 46.469: [Blue] ~100600 levels ~983040 states ~6123792 transitions
pins2lts-mc-linux64( 5/ 8), 91.985: [Blue] ~222704 levels ~1966080 states ~12611160 transitions
pins2lts-mc-linux64( 7/ 8), 132.531: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 132.793:
pins2lts-mc-linux64( 0/ 8), 132.793: Explored 2724607 states 20485925 transitions, fanout: 7.519
pins2lts-mc-linux64( 0/ 8), 132.793: Total exploration time 132.320 sec (132.080 sec minimum, 132.238 sec on average)
pins2lts-mc-linux64( 0/ 8), 132.793: States per second: 20591, Transitions per second: 154821
pins2lts-mc-linux64( 0/ 8), 132.793:
pins2lts-mc-linux64( 0/ 8), 132.793: State space has 10388315 states, 748244 are accepting
pins2lts-mc-linux64( 0/ 8), 132.793: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 132.793: blue states: 2724607 (26.23%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 132.793: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 132.793: all-red states: 748264 (7.20%), bogus 14 (0.00%)
pins2lts-mc-linux64( 0/ 8), 132.793:
pins2lts-mc-linux64( 0/ 8), 132.793: Total memory used for local state coloring: 30.0MB
pins2lts-mc-linux64( 0/ 8), 132.793:
pins2lts-mc-linux64( 0/ 8), 132.793: Queue width: 8B, total height: 1966515, memory: 15.00MB
pins2lts-mc-linux64( 0/ 8), 132.793: Tree memory: 335.3MB, 33.8 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 132.793: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 132.793: Stored 970 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 132.793: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 132.793: Est. total memory use: 350.3MB (~1039.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12014726698993025535;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(X((LTLAPp1==true)) U ((X((LTLAPp1==true))&&[]((LTLAPp2==true)))||X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12014726698993025535;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(X((LTLAPp1==true)) U ((X((LTLAPp1==true))&&[]((LTLAPp2==true)))||X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
4 unique states visited
3 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
8769 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,87.8229,1294628,1,0,2.45624e+06,1458,6535,6.43981e+06,132,14181,2290282
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-050A-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F("(((i21.u354.p1105!=1)||(i21.u358.p1122!=1))&&((i1.u26.p82!=1)||(i1.u26.p84!=1)))"))))
Formula 1 simplified : FG!"(((i21.u354.p1105!=1)||(i21.u358.p1122!=1))&&((i1.u26.p82!=1)||(i1.u26.p84!=1)))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,87.8582,1294628,1,0,2.45624e+06,1458,6612,6.43981e+06,135,14181,2291329
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-050A-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(((X(!("((i11.u201.p628==1)&&(i11.u208.p651==1))")))&&(F("((i13.u233.p729==1)&&(i13.u238.p748==1))")))||(G(!("((i11.u201.p628==1...185
Formula 2 simplified : G(F"((i11.u201.p628==1)&&(i11.u208.p651==1))" & F(G!"((i13.u233.p729==1)&&(i13.u238.p748==1))" | G"((i11.u201.p628==1)&&(i11.u208.p6...165
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1399 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,101.847,1702316,1,0,3.50702e+06,1458,6686,9.07116e+06,136,14181,2780757
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-050A-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1380616 ms.
BK_STOP 1717025030110
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-050A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-050A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683761600676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050A.tgz
mv ShieldPPPt-PT-050A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;