About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.775 | 3272609.00 | 3937637.00 | 8334.60 | 1 ? ? 1 1 1 1 1 1 1 1 1 1 ? 1 1 | 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.r246-tall-171654350800053.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 MultiCrashLeafsetExtension-PT-S16C08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654350800053
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 06:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 06:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.3M 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716577229052
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 19:00:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 19:00:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 19:00:30] [INFO ] Load time of PNML (sax parser for PT used): 421 ms
[2024-05-24 19:00:30] [INFO ] Transformed 6876 places.
[2024-05-24 19:00:30] [INFO ] Transformed 9571 transitions.
[2024-05-24 19:00:30] [INFO ] Parsed PT model containing 6876 places and 9571 transitions and 35518 arcs in 594 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-24 19:00:31] [INFO ] Flow matrix only has 9299 transitions (discarded 272 similar events)
// Phase 1: matrix 9299 rows 6876 cols
[2024-05-24 19:00:31] [INFO ] Computed 649 invariants in 638 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[17, 51, 1, 51, 51, 17, 17, 1, 17, 51, 17, 17, 1, 1, 51, 51]
RANDOM walk for 10000 steps (120 resets) in 137 ms. (72 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140008 steps (476 resets) in 567 ms. (246 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1] Max Struct:[17, 51, 1, 51, 51, 17, 17, 17, 51, 17, 17, 1, 51, 51]
[2024-05-24 19:00:32] [INFO ] Flow matrix only has 9299 transitions (discarded 272 similar events)
[2024-05-24 19:00:32] [INFO ] Invariant cache hit.
[2024-05-24 19:00:33] [INFO ] [Real]Absence check using 54 positive place invariants in 122 ms returned sat
[2024-05-24 19:00:33] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 186 ms returned unsat
[2024-05-24 19:00:34] [INFO ] [Real]Absence check using 54 positive place invariants in 103 ms returned sat
[2024-05-24 19:00:34] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 225 ms returned sat
[2024-05-24 19:00:38] [INFO ] [Real]Absence check using state equation in 3998 ms returned unknown
[2024-05-24 19:00:39] [INFO ] [Real]Absence check using 54 positive place invariants in 103 ms returned sat
[2024-05-24 19:00:39] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 224 ms returned sat
[2024-05-24 19:00:42] [INFO ] [Real]Absence check using state equation in 2583 ms returned sat
[2024-05-24 19:00:42] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:00:42] [INFO ] [Real]Added 2722 Read/Feed constraints in 207 ms returned sat
[2024-05-24 19:00:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:00:44] [INFO ] [Nat]Absence check using 54 positive place invariants in 105 ms returned sat
[2024-05-24 19:00:44] [INFO ] [Nat]Absence check using 54 positive and 595 generalized place invariants in 235 ms returned sat
[2024-05-24 19:00:46] [INFO ] [Nat]Absence check using state equation in 2606 ms returned sat
[2024-05-24 19:00:47] [INFO ] [Nat]Added 2722 Read/Feed constraints in 263 ms returned sat
[2024-05-24 19:00:57] [INFO ] Deduced a trap composed of 719 places in 9765 ms of which 344 ms to minimize.
[2024-05-24 19:00:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 19:00:58] [INFO ] [Real]Absence check using 54 positive place invariants in 131 ms returned sat
[2024-05-24 19:00:58] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 168 ms returned unsat
[2024-05-24 19:00:59] [INFO ] [Real]Absence check using 54 positive place invariants in 106 ms returned sat
[2024-05-24 19:00:59] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 163 ms returned unsat
[2024-05-24 19:01:00] [INFO ] [Real]Absence check using 54 positive place invariants in 102 ms returned sat
[2024-05-24 19:01:00] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 220 ms returned sat
[2024-05-24 19:01:04] [INFO ] [Real]Absence check using state equation in 3994 ms returned unknown
[2024-05-24 19:01:05] [INFO ] [Real]Absence check using 54 positive place invariants in 99 ms returned sat
[2024-05-24 19:01:05] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 169 ms returned unsat
[2024-05-24 19:01:06] [INFO ] [Real]Absence check using 54 positive place invariants in 103 ms returned sat
[2024-05-24 19:01:06] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 161 ms returned unsat
[2024-05-24 19:01:07] [INFO ] [Real]Absence check using 54 positive place invariants in 106 ms returned sat
[2024-05-24 19:01:07] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 210 ms returned sat
[2024-05-24 19:01:11] [INFO ] [Real]Absence check using state equation in 4018 ms returned unknown
[2024-05-24 19:01:12] [INFO ] [Real]Absence check using 54 positive place invariants in 98 ms returned sat
[2024-05-24 19:01:12] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 154 ms returned unsat
[2024-05-24 19:01:12] [INFO ] [Real]Absence check using 54 positive place invariants in 97 ms returned sat
[2024-05-24 19:01:13] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 152 ms returned unsat
[2024-05-24 19:01:13] [INFO ] [Real]Absence check using 54 positive place invariants in 99 ms returned sat
[2024-05-24 19:01:14] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 220 ms returned sat
[2024-05-24 19:01:16] [INFO ] [Real]Absence check using state equation in 2460 ms returned sat
[2024-05-24 19:01:16] [INFO ] [Real]Added 2722 Read/Feed constraints in 175 ms returned sat
[2024-05-24 19:01:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:01:17] [INFO ] [Nat]Absence check using 54 positive place invariants in 100 ms returned sat
[2024-05-24 19:01:18] [INFO ] [Nat]Absence check using 54 positive and 595 generalized place invariants in 231 ms returned sat
[2024-05-24 19:01:20] [INFO ] [Nat]Absence check using state equation in 2468 ms returned sat
[2024-05-24 19:01:20] [INFO ] [Nat]Added 2722 Read/Feed constraints in 194 ms returned sat
[2024-05-24 19:01:30] [INFO ] Deduced a trap composed of 86 places in 9757 ms of which 49 ms to minimize.
[2024-05-24 19:01:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 19:01:31] [INFO ] [Real]Absence check using 54 positive place invariants in 97 ms returned sat
[2024-05-24 19:01:31] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 218 ms returned sat
[2024-05-24 19:01:35] [INFO ] [Real]Absence check using state equation in 4051 ms returned unknown
[2024-05-24 19:01:36] [INFO ] [Real]Absence check using 54 positive place invariants in 97 ms returned sat
[2024-05-24 19:01:36] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 171 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1] Max Struct:[1, 51, 1, 1, 1, 17, 1, 1, 51, 1, 1, 1, 51, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[51, 1, 17, 51, 1, 51]
Support contains 6 out of 6876 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Graph (complete) has 21033 edges and 6876 vertex of which 6840 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.47 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2172 transitions
Trivial Post-agglo rules discarded 2172 transitions
Performed 2172 trivial Post agglomeration. Transition count delta: 2172
Iterating post reduction 0 with 2172 rules applied. Total rules applied 2173 place count 6840 transition count 7399
Reduce places removed 2172 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 2175 rules applied. Total rules applied 4348 place count 4668 transition count 7396
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 4351 place count 4665 transition count 7396
Performed 272 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 272 Pre rules applied. Total rules applied 4351 place count 4665 transition count 7124
Deduced a syphon composed of 272 places in 6 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 3 with 544 rules applied. Total rules applied 4895 place count 4393 transition count 7124
Discarding 1900 places :
Symmetric choice reduction at 3 with 1900 rule applications. Total rules 6795 place count 2493 transition count 5224
Iterating global reduction 3 with 1900 rules applied. Total rules applied 8695 place count 2493 transition count 5224
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 8695 place count 2493 transition count 5212
Deduced a syphon composed of 12 places in 15 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 8719 place count 2481 transition count 5212
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 8953 place count 2247 transition count 3340
Iterating global reduction 3 with 234 rules applied. Total rules applied 9187 place count 2247 transition count 3340
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 46 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 9221 place count 2230 transition count 3323
Free-agglomeration rule (complex) applied 163 times.
Iterating global reduction 3 with 163 rules applied. Total rules applied 9384 place count 2230 transition count 4798
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 3 with 163 rules applied. Total rules applied 9547 place count 2067 transition count 4798
Partial Free-agglomeration rule applied 68 times.
Drop transitions (Partial Free agglomeration) removed 68 transitions
Iterating global reduction 4 with 68 rules applied. Total rules applied 9615 place count 2067 transition count 4798
Applied a total of 9615 rules in 3101 ms. Remains 2067 /6876 variables (removed 4809) and now considering 4798/9571 (removed 4773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3112 ms. Remains : 2067/6876 places, 4798/9571 transitions.
[2024-05-24 19:01:39] [INFO ] Flow matrix only has 4401 transitions (discarded 397 similar events)
// Phase 1: matrix 4401 rows 2067 cols
[2024-05-24 19:01:39] [INFO ] Computed 613 invariants in 70 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[2, 1, 1, 2, 1, 2]
RANDOM walk for 1000000 steps (20076 resets) in 18009 ms. (55 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000004 steps (19392 resets) in 20736 ms. (241 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[2, 1, 2, 1, 2]
[2024-05-24 19:02:18] [INFO ] Flow matrix only has 4401 transitions (discarded 397 similar events)
[2024-05-24 19:02:18] [INFO ] Invariant cache hit.
[2024-05-24 19:02:18] [INFO ] [Real]Absence check using 33 positive place invariants in 36 ms returned sat
[2024-05-24 19:02:19] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 99 ms returned sat
[2024-05-24 19:02:20] [INFO ] [Real]Absence check using state equation in 1266 ms returned sat
[2024-05-24 19:02:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:02:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 39 ms returned sat
[2024-05-24 19:02:20] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 99 ms returned sat
[2024-05-24 19:02:22] [INFO ] [Nat]Absence check using state equation in 1334 ms returned sat
[2024-05-24 19:02:22] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:02:23] [INFO ] [Nat]Added 2722 Read/Feed constraints in 977 ms returned sat
[2024-05-24 19:02:24] [INFO ] Deduced a trap composed of 224 places in 1726 ms of which 16 ms to minimize.
[2024-05-24 19:02:27] [INFO ] Deduced a trap composed of 379 places in 1791 ms of which 15 ms to minimize.
[2024-05-24 19:02:30] [INFO ] Deduced a trap composed of 376 places in 1778 ms of which 13 ms to minimize.
[2024-05-24 19:02:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 7351 ms
[2024-05-24 19:02:30] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2701 transitions) in 448 ms.
[2024-05-24 19:02:32] [INFO ] Added : 17 causal constraints over 4 iterations in 1841 ms. Result :sat
Minimization took 5246 ms.
[2024-05-24 19:02:37] [INFO ] [Real]Absence check using 33 positive place invariants in 36 ms returned sat
[2024-05-24 19:02:37] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 97 ms returned sat
[2024-05-24 19:02:39] [INFO ] [Real]Absence check using state equation in 1357 ms returned sat
[2024-05-24 19:02:40] [INFO ] [Real]Added 2722 Read/Feed constraints in 634 ms returned sat
[2024-05-24 19:02:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:02:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-24 19:02:40] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 95 ms returned sat
[2024-05-24 19:02:41] [INFO ] [Nat]Absence check using state equation in 1323 ms returned sat
[2024-05-24 19:02:43] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2181 ms returned sat
[2024-05-24 19:02:45] [INFO ] Deduced a trap composed of 380 places in 1719 ms of which 14 ms to minimize.
[2024-05-24 19:02:47] [INFO ] Deduced a trap composed of 225 places in 1975 ms of which 16 ms to minimize.
[2024-05-24 19:02:50] [INFO ] Deduced a trap composed of 250 places in 1957 ms of which 14 ms to minimize.
[2024-05-24 19:02:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6225 ms
[2024-05-24 19:02:51] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2701 transitions) in 890 ms.
[2024-05-24 19:02:52] [INFO ] Added : 23 causal constraints over 5 iterations in 2275 ms. Result :sat
Minimization took 5057 ms.
[2024-05-24 19:02:57] [INFO ] [Real]Absence check using 33 positive place invariants in 42 ms returned sat
[2024-05-24 19:02:57] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 30 ms returned unsat
[2024-05-24 19:02:58] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-24 19:02:58] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 99 ms returned sat
[2024-05-24 19:02:59] [INFO ] [Real]Absence check using state equation in 1446 ms returned sat
[2024-05-24 19:02:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:02:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-24 19:03:00] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 94 ms returned sat
[2024-05-24 19:03:01] [INFO ] [Nat]Absence check using state equation in 1435 ms returned sat
[2024-05-24 19:03:03] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2350 ms returned sat
[2024-05-24 19:03:05] [INFO ] Deduced a trap composed of 401 places in 1726 ms of which 13 ms to minimize.
[2024-05-24 19:03:08] [INFO ] Deduced a trap composed of 445 places in 1681 ms of which 16 ms to minimize.
[2024-05-24 19:03:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4740 ms
[2024-05-24 19:03:08] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2701 transitions) in 293 ms.
[2024-05-24 19:03:10] [INFO ] Added : 23 causal constraints over 5 iterations in 1649 ms. Result :sat
Minimization took 5425 ms.
[2024-05-24 19:03:15] [INFO ] [Real]Absence check using 33 positive place invariants in 36 ms returned sat
[2024-05-24 19:03:15] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 101 ms returned sat
[2024-05-24 19:03:17] [INFO ] [Real]Absence check using state equation in 1339 ms returned sat
[2024-05-24 19:03:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:03:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 36 ms returned sat
[2024-05-24 19:03:17] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 102 ms returned sat
[2024-05-24 19:03:19] [INFO ] [Nat]Absence check using state equation in 1309 ms returned sat
[2024-05-24 19:03:20] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1330 ms returned sat
[2024-05-24 19:03:22] [INFO ] Deduced a trap composed of 295 places in 1754 ms of which 15 ms to minimize.
[2024-05-24 19:03:24] [INFO ] Deduced a trap composed of 298 places in 1723 ms of which 14 ms to minimize.
[2024-05-24 19:03:27] [INFO ] Deduced a trap composed of 353 places in 1723 ms of which 13 ms to minimize.
[2024-05-24 19:03:29] [INFO ] Deduced a trap composed of 387 places in 1694 ms of which 13 ms to minimize.
[2024-05-24 19:03:32] [INFO ] Deduced a trap composed of 362 places in 1741 ms of which 14 ms to minimize.
[2024-05-24 19:03:34] [INFO ] Deduced a trap composed of 276 places in 1713 ms of which 13 ms to minimize.
[2024-05-24 19:03:37] [INFO ] Deduced a trap composed of 307 places in 1685 ms of which 13 ms to minimize.
[2024-05-24 19:03:42] [INFO ] Deduced a trap composed of 274 places in 1944 ms of which 15 ms to minimize.
[2024-05-24 19:03:45] [INFO ] Deduced a trap composed of 260 places in 1640 ms of which 21 ms to minimize.
[2024-05-24 19:03:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 26460 ms
[2024-05-24 19:03:47] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2701 transitions) in 290 ms.
[2024-05-24 19:03:48] [INFO ] Added : 19 causal constraints over 4 iterations in 1551 ms. Result :sat
Minimization took 5049 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[2, 1, 1, 1, 2]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 1, 2]
Support contains 4 out of 2067 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2067/2067 places, 4798/4798 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2067 transition count 4797
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2066 transition count 4797
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2066 transition count 4795
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 2064 transition count 4795
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 2062 transition count 4793
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 2062 transition count 4793
Applied a total of 10 rules in 412 ms. Remains 2062 /2067 variables (removed 5) and now considering 4793/4798 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 2062/2067 places, 4793/4798 transitions.
[2024-05-24 19:03:53] [INFO ] Flow matrix only has 4396 transitions (discarded 397 similar events)
// Phase 1: matrix 4396 rows 2062 cols
[2024-05-24 19:03:53] [INFO ] Computed 613 invariants in 73 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 1, 2]
RANDOM walk for 1000000 steps (20077 resets) in 17899 ms. (55 steps per ms)
BEST_FIRST walk for 4000004 steps (15514 resets) in 17398 ms. (229 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1] Max Struct:[2, 1, 1, 2]
[2024-05-24 19:04:29] [INFO ] Flow matrix only has 4396 transitions (discarded 397 similar events)
[2024-05-24 19:04:29] [INFO ] Invariant cache hit.
[2024-05-24 19:04:29] [INFO ] [Real]Absence check using 33 positive place invariants in 52 ms returned sat
[2024-05-24 19:04:29] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 108 ms returned sat
[2024-05-24 19:04:30] [INFO ] [Real]Absence check using state equation in 1289 ms returned sat
[2024-05-24 19:04:31] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:04:31] [INFO ] [Real]Added 2722 Read/Feed constraints in 476 ms returned sat
[2024-05-24 19:04:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:04:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 36 ms returned sat
[2024-05-24 19:04:31] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 92 ms returned sat
[2024-05-24 19:04:33] [INFO ] [Nat]Absence check using state equation in 1223 ms returned sat
[2024-05-24 19:04:35] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1899 ms returned sat
[2024-05-24 19:04:36] [INFO ] Deduced a trap composed of 266 places in 1705 ms of which 14 ms to minimize.
[2024-05-24 19:04:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2795 ms
[2024-05-24 19:04:38] [INFO ] Computed and/alt/rep : 1680/4435/1680 causal constraints (skipped 2699 transitions) in 305 ms.
[2024-05-24 19:04:39] [INFO ] Added : 18 causal constraints over 4 iterations in 1571 ms. Result :sat
Minimization took 5179 ms.
[2024-05-24 19:04:44] [INFO ] [Real]Absence check using 33 positive place invariants in 46 ms returned sat
[2024-05-24 19:04:45] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 95 ms returned sat
[2024-05-24 19:04:46] [INFO ] [Real]Absence check using state equation in 1148 ms returned sat
[2024-05-24 19:04:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:04:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 36 ms returned sat
[2024-05-24 19:04:46] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 93 ms returned sat
[2024-05-24 19:04:47] [INFO ] [Nat]Absence check using state equation in 1076 ms returned sat
[2024-05-24 19:04:49] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2042 ms returned sat
[2024-05-24 19:04:51] [INFO ] Deduced a trap composed of 395 places in 1779 ms of which 19 ms to minimize.
[2024-05-24 19:04:53] [INFO ] Deduced a trap composed of 232 places in 1919 ms of which 14 ms to minimize.
[2024-05-24 19:04:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4102 ms
[2024-05-24 19:04:54] [INFO ] Computed and/alt/rep : 1680/4435/1680 causal constraints (skipped 2699 transitions) in 282 ms.
[2024-05-24 19:04:55] [INFO ] Added : 23 causal constraints over 5 iterations in 2061 ms. Result :sat
Minimization took 5084 ms.
[2024-05-24 19:05:01] [INFO ] [Real]Absence check using 33 positive place invariants in 38 ms returned sat
[2024-05-24 19:05:01] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 108 ms returned sat
[2024-05-24 19:05:02] [INFO ] [Real]Absence check using state equation in 1262 ms returned sat
[2024-05-24 19:05:02] [INFO ] [Real]Added 2722 Read/Feed constraints in 260 ms returned sat
[2024-05-24 19:05:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:05:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 38 ms returned sat
[2024-05-24 19:05:03] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 105 ms returned sat
[2024-05-24 19:05:04] [INFO ] [Nat]Absence check using state equation in 1335 ms returned sat
[2024-05-24 19:05:08] [INFO ] [Nat]Added 2722 Read/Feed constraints in 3580 ms returned sat
[2024-05-24 19:05:10] [INFO ] Deduced a trap composed of 284 places in 1891 ms of which 14 ms to minimize.
[2024-05-24 19:05:12] [INFO ] Deduced a trap composed of 274 places in 1937 ms of which 14 ms to minimize.
[2024-05-24 19:05:14] [INFO ] Deduced a trap composed of 301 places in 1712 ms of which 14 ms to minimize.
[2024-05-24 19:05:16] [INFO ] Deduced a trap composed of 276 places in 1935 ms of which 13 ms to minimize.
[2024-05-24 19:05:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 8156 ms
[2024-05-24 19:05:16] [INFO ] Computed and/alt/rep : 1680/4435/1680 causal constraints (skipped 2699 transitions) in 284 ms.
[2024-05-24 19:05:18] [INFO ] Added : 26 causal constraints over 6 iterations in 1894 ms. Result :sat
Minimization took 4988 ms.
[2024-05-24 19:05:23] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-24 19:05:23] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 25 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1] Max Struct:[2, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Support contains 3 out of 2062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2062/2062 places, 4793/4793 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2062 transition count 4792
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2061 transition count 4792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 2060 transition count 4791
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 2060 transition count 4791
Applied a total of 4 rules in 391 ms. Remains 2060 /2062 variables (removed 2) and now considering 4791/4793 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 2060/2062 places, 4791/4793 transitions.
[2024-05-24 19:05:24] [INFO ] Flow matrix only has 4394 transitions (discarded 397 similar events)
// Phase 1: matrix 4394 rows 2060 cols
[2024-05-24 19:05:24] [INFO ] Computed 613 invariants in 68 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
RANDOM walk for 1000000 steps (20078 resets) in 17560 ms. (56 steps per ms)
BEST_FIRST walk for 3000003 steps (11634 resets) in 12358 ms. (242 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
[2024-05-24 19:05:54] [INFO ] Flow matrix only has 4394 transitions (discarded 397 similar events)
[2024-05-24 19:05:54] [INFO ] Invariant cache hit.
[2024-05-24 19:05:54] [INFO ] [Real]Absence check using 33 positive place invariants in 38 ms returned sat
[2024-05-24 19:05:54] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 95 ms returned sat
[2024-05-24 19:05:55] [INFO ] [Real]Absence check using state equation in 1203 ms returned sat
[2024-05-24 19:05:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:05:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 41 ms returned sat
[2024-05-24 19:05:56] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 111 ms returned sat
[2024-05-24 19:05:57] [INFO ] [Nat]Absence check using state equation in 1138 ms returned sat
[2024-05-24 19:05:57] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:05:58] [INFO ] [Nat]Added 2722 Read/Feed constraints in 858 ms returned sat
[2024-05-24 19:05:59] [INFO ] Deduced a trap composed of 222 places in 1656 ms of which 13 ms to minimize.
[2024-05-24 19:06:02] [INFO ] Deduced a trap composed of 369 places in 1718 ms of which 14 ms to minimize.
[2024-05-24 19:06:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 5249 ms
[2024-05-24 19:06:03] [INFO ] Computed and/alt/rep : 1679/4433/1679 causal constraints (skipped 2698 transitions) in 306 ms.
[2024-05-24 19:06:05] [INFO ] Added : 18 causal constraints over 4 iterations in 1626 ms. Result :sat
Minimization took 5739 ms.
[2024-05-24 19:06:11] [INFO ] [Real]Absence check using 33 positive place invariants in 39 ms returned sat
[2024-05-24 19:06:11] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 101 ms returned sat
[2024-05-24 19:06:12] [INFO ] [Real]Absence check using state equation in 1253 ms returned sat
[2024-05-24 19:06:13] [INFO ] [Real]Added 2722 Read/Feed constraints in 549 ms returned sat
[2024-05-24 19:06:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:06:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 40 ms returned sat
[2024-05-24 19:06:13] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 98 ms returned sat
[2024-05-24 19:06:14] [INFO ] [Nat]Absence check using state equation in 1162 ms returned sat
[2024-05-24 19:06:16] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1521 ms returned sat
[2024-05-24 19:06:17] [INFO ] Deduced a trap composed of 392 places in 1665 ms of which 12 ms to minimize.
[2024-05-24 19:06:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1925 ms
[2024-05-24 19:06:18] [INFO ] Computed and/alt/rep : 1679/4433/1679 causal constraints (skipped 2698 transitions) in 296 ms.
[2024-05-24 19:06:19] [INFO ] Added : 23 causal constraints over 5 iterations in 1761 ms. Result :sat
Minimization took 5310 ms.
[2024-05-24 19:06:25] [INFO ] [Real]Absence check using 33 positive place invariants in 38 ms returned sat
[2024-05-24 19:06:25] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 100 ms returned sat
[2024-05-24 19:06:26] [INFO ] [Real]Absence check using state equation in 1143 ms returned sat
[2024-05-24 19:06:27] [INFO ] [Real]Added 2722 Read/Feed constraints in 308 ms returned sat
[2024-05-24 19:06:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:06:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 40 ms returned sat
[2024-05-24 19:06:27] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 97 ms returned sat
[2024-05-24 19:06:28] [INFO ] [Nat]Absence check using state equation in 1208 ms returned sat
[2024-05-24 19:06:31] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2576 ms returned sat
[2024-05-24 19:06:32] [INFO ] Deduced a trap composed of 238 places in 1531 ms of which 13 ms to minimize.
[2024-05-24 19:06:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1774 ms
[2024-05-24 19:06:33] [INFO ] Computed and/alt/rep : 1679/4433/1679 causal constraints (skipped 2698 transitions) in 277 ms.
[2024-05-24 19:06:34] [INFO ] Added : 19 causal constraints over 4 iterations in 1422 ms. Result :sat
Minimization took 5095 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Support contains 3 out of 2060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2060/2060 places, 4791/4791 transitions.
Applied a total of 0 rules in 155 ms. Remains 2060 /2060 variables (removed 0) and now considering 4791/4791 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 2060/2060 places, 4791/4791 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2060/2060 places, 4791/4791 transitions.
Applied a total of 0 rules in 151 ms. Remains 2060 /2060 variables (removed 0) and now considering 4791/4791 (removed 0) transitions.
[2024-05-24 19:06:39] [INFO ] Flow matrix only has 4394 transitions (discarded 397 similar events)
[2024-05-24 19:06:39] [INFO ] Invariant cache hit.
[2024-05-24 19:06:44] [INFO ] Implicit Places using invariants in 4956 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 21, 27, 35, 45, 57, 71, 86, 100, 101, 102, 103, 104, 105, 106, 107, 108, 120, 130, 138, 144, 148, 150, 169, 175, 177, 178, 179, 180, 181, 182, 183, 184, 185, 187, 191, 197, 205, 215, 227, 240, 252, 253, 254, 255, 256, 257, 258, 259, 260, 270, 278, 284, 288, 290, 292, 311, 317, 319, 320, 321, 322, 323, 324, 325, 327, 330, 332, 336, 342, 350, 360, 371, 381, 382, 383, 384, 385, 386, 387, 388, 389, 397, 403, 407, 409, 411, 413, 432, 438, 440, 441, 442, 443, 444, 445, 446, 447, 448, 450, 452, 454, 458, 464, 472, 481, 489, 490, 491, 492, 493, 494, 495, 496, 497, 503, 507, 509, 511, 513, 515, 534, 540, 542, 543, 544, 545, 546, 547, 548, 549, 550, 552, 554, 556, 558, 562, 568, 575, 581, 582, 583, 584, 585, 586, 587, 588, 589, 593, 595, 597, 599, 601, 603, 622, 628, 630, 631, 632, 633, 634, 635, 636, 637, 638, 640, 642, 644, 646, 648, 652, 657, 661, 662, 663, 664, 665, 666, 667, 668, 669, 671, 673, 675, 677, 679, 681, 700, 706, 708, 709, 710, 711, 712, 713, 714, 715, 716, 718, 720, 722, 724, 726, 728, 731, 733, 734, 735, 736, 737, 738, 739, 740, 741, 743, 745, 747, 749, 751, 753, 772, 778, 780, 781, 782, 783, 784, 785, 786, 787, 788, 790, 792, 794, 796, 798, 800, 802, 804, 805, 806, 807, 808, 809, 810, 811, 812, 814, 816, 818, 820, 822, 824, 843, 845, 848, 850, 851, 852, 853, 854, 855, 856, 857, 858, 860, 862, 864, 866, 868, 870, 872, 874, 875, 876, 877, 878, 879, 880, 881, 882, 884, 886, 888, 890, 892, 894, 913, 919, 921, 922, 923, 924, 925, 926, 927, 928, 929, 931, 933, 935, 937, 939, 941, 943, 945, 946, 947, 948, 949, 950, 951, 952, 953, 955, 957, 959, 961, 963, 965, 984, 990, 992, 993, 994, 995, 996, 997, 998, 999, 1000, 1002, 1004, 1006, 1008, 1010, 1012, 1014, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1027, 1029, 1031, 1033, 1035, 1037, 1056, 1062, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1072, 1074, 1076, 1078, 1080, 1082, 1084, 1088, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1105, 1107, 1109, 1111, 1113, 1115, 1134, 1140, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1152, 1154, 1156, 1158, 1160, 1164, 1170, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1191, 1195, 1197, 1199, 1201, 1203, 1222, 1228, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1240, 1242, 1244, 1246, 1250, 1256, 1264, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1289, 1295, 1299, 1302, 1304, 1306, 1325, 1331, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1343, 1345, 1347, 1351, 1357, 1365, 1375, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1404, 1412, 1418, 1422, 1424, 1426, 1445, 1451, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1463, 1465, 1469, 1475, 1483, 1493, 1505, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1538, 1548, 1556, 1562, 1566, 1568, 1587, 1589, 1592, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1602, 1604, 1608, 1614, 1622, 1632, 1644, 1658, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1681, 1695, 1707, 1717, 1725, 1731, 1735, 1754]
[2024-05-24 19:06:44] [INFO ] Actually due to overlaps returned [169, 311, 432, 534, 622, 700, 772, 843, 913, 984, 1056, 1134, 1222, 1325, 1445, 1587, 1754, 4, 9, 10, 11, 12, 13, 14, 15, 16, 100, 101, 102, 103, 104, 105, 106, 107, 177, 178, 179, 180, 181, 182, 183, 184, 252, 253, 254, 255, 256, 257, 258, 259, 319, 320, 321, 322, 323, 324, 325, 381, 382, 383, 384, 385, 386, 387, 388, 440, 441, 442, 443, 444, 445, 446, 447, 489, 490, 491, 492, 493, 494, 495, 496, 542, 543, 544, 545, 546, 547, 548, 549, 581, 582, 583, 584, 585, 586, 587, 588, 630, 631, 632, 633, 634, 635, 636, 637, 661, 662, 663, 664, 665, 666, 667, 668, 708, 709, 710, 711, 712, 713, 714, 715, 733, 734, 735, 736, 737, 738, 739, 740, 780, 781, 782, 783, 784, 785, 786, 787, 804, 805, 806, 807, 808, 809, 810, 811, 845, 850, 851, 852, 853, 854, 855, 856, 857, 874, 875, 876, 877, 878, 879, 880, 881, 921, 922, 923, 924, 925, 926, 927, 928, 945, 946, 947, 948, 949, 950, 951, 952, 992, 993, 994, 995, 996, 997, 998, 999, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1589, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680]
Discarding 291 places :
Implicit Place search using SMT only with invariants took 4976 ms to find 291 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1769/2060 places, 4791/4791 transitions.
Discarding 255 places :
Symmetric choice reduction at 0 with 255 rule applications. Total rules 255 place count 1514 transition count 4536
Iterating global reduction 0 with 255 rules applied. Total rules applied 510 place count 1514 transition count 4536
Discarding 255 places :
Symmetric choice reduction at 0 with 255 rule applications. Total rules 765 place count 1259 transition count 4281
Iterating global reduction 0 with 255 rules applied. Total rules applied 1020 place count 1259 transition count 4281
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1023 place count 1259 transition count 4278
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1026 place count 1256 transition count 4278
Applied a total of 1026 rules in 359 ms. Remains 1256 /1769 variables (removed 513) and now considering 4278/4791 (removed 513) transitions.
[2024-05-24 19:06:45] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 1256 cols
[2024-05-24 19:06:45] [INFO ] Computed 322 invariants in 32 ms
[2024-05-24 19:06:47] [INFO ] Implicit Places using invariants in 2635 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 156, 158, 160, 164, 170, 178, 188, 200, 213, 225, 235, 243, 249, 253, 255, 257, 265, 268, 271, 273, 277, 283, 291, 301, 312, 322, 330, 336, 340, 342, 344, 346, 355, 357, 359, 361, 363, 367, 373, 381, 390, 398, 404, 408, 410, 412, 414, 416, 424, 426, 428, 430, 432, 434, 438, 444, 451, 457, 461, 463, 465, 467, 469, 471, 479, 481, 483, 485, 487, 489, 491, 495, 500, 504, 506, 508, 510, 512, 514, 516, 524, 526, 528, 530, 532, 534, 536, 538, 541, 543, 545, 547, 549, 551, 553, 555, 563, 565, 567, 569, 571, 573, 575, 577, 579, 581, 583, 585, 587, 589, 591, 593, 599, 601, 603, 605, 607, 609, 611, 613, 615, 617, 619, 621, 623, 625, 627, 629, 636, 638, 640, 642, 644, 646, 648, 650, 652, 654, 656, 658, 660, 662, 664, 666, 674, 676, 678, 680, 682, 684, 686, 688, 690, 693, 695, 697, 699, 701, 703, 705, 713, 715, 717, 719, 721, 723, 725, 727, 731, 736, 740, 742, 744, 746, 748, 750, 758, 760, 762, 764, 766, 768, 770, 774, 780, 787, 793, 797, 799, 801, 803, 805, 813, 815, 817, 819, 821, 823, 827, 833, 841, 850, 858, 864, 868, 871, 873, 875, 883, 885, 887, 889, 891, 895, 901, 909, 919, 930, 940, 948, 954, 958, 960, 962, 970, 972, 974, 976, 980, 986, 994, 1004, 1016, 1029, 1041, 1051, 1059, 1065, 1069, 1071, 1077, 1079, 1081, 1085, 1091, 1099, 1109, 1121, 1135, 1150, 1164, 1176, 1186, 1194, 1200, 1204]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 2644 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 984/2060 places, 4278/4791 transitions.
Applied a total of 0 rules in 118 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8267 ms. Remains : 984/2060 places, 4278/4791 transitions.
[2024-05-24 19:06:48] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 984 cols
[2024-05-24 19:06:48] [INFO ] Computed 50 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
RANDOM walk for 1000000 steps (21032 resets) in 16643 ms. (60 steps per ms)
BEST_FIRST walk for 3000003 steps (9037 resets) in 9841 ms. (304 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
[2024-05-24 19:07:14] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:07:14] [INFO ] Invariant cache hit.
[2024-05-24 19:07:14] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:07:14] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:07:15] [INFO ] [Real]Absence check using state equation in 903 ms returned sat
[2024-05-24 19:07:15] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:07:15] [INFO ] [Real]Added 2722 Read/Feed constraints in 266 ms returned sat
[2024-05-24 19:07:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:07:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-24 19:07:16] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:07:17] [INFO ] [Nat]Absence check using state equation in 964 ms returned sat
[2024-05-24 19:07:17] [INFO ] [Nat]Added 2722 Read/Feed constraints in 703 ms returned sat
[2024-05-24 19:07:18] [INFO ] Deduced a trap composed of 171 places in 517 ms of which 7 ms to minimize.
[2024-05-24 19:07:19] [INFO ] Deduced a trap composed of 174 places in 524 ms of which 6 ms to minimize.
[2024-05-24 19:07:20] [INFO ] Deduced a trap composed of 185 places in 530 ms of which 6 ms to minimize.
[2024-05-24 19:07:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2610 ms
[2024-05-24 19:07:20] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 254 ms.
[2024-05-24 19:07:21] [INFO ] Added : 15 causal constraints over 3 iterations in 857 ms. Result :sat
Minimization took 5353 ms.
[2024-05-24 19:07:26] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 19:07:26] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:07:27] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2024-05-24 19:07:27] [INFO ] [Real]Added 2722 Read/Feed constraints in 279 ms returned sat
[2024-05-24 19:07:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:07:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:07:28] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-24 19:07:28] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2024-05-24 19:07:30] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1304 ms returned sat
[2024-05-24 19:07:30] [INFO ] Deduced a trap composed of 197 places in 494 ms of which 6 ms to minimize.
[2024-05-24 19:07:31] [INFO ] Deduced a trap composed of 69 places in 600 ms of which 7 ms to minimize.
[2024-05-24 19:07:32] [INFO ] Deduced a trap composed of 80 places in 596 ms of which 6 ms to minimize.
[2024-05-24 19:07:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2068 ms
[2024-05-24 19:07:32] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 248 ms.
[2024-05-24 19:07:33] [INFO ] Added : 21 causal constraints over 5 iterations in 1115 ms. Result :sat
Minimization took 5487 ms.
[2024-05-24 19:07:39] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2024-05-24 19:07:39] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 5 ms returned sat
[2024-05-24 19:07:39] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2024-05-24 19:07:40] [INFO ] [Real]Added 2722 Read/Feed constraints in 250 ms returned sat
[2024-05-24 19:07:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:07:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:07:40] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:07:41] [INFO ] [Nat]Absence check using state equation in 847 ms returned sat
[2024-05-24 19:07:42] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1144 ms returned sat
[2024-05-24 19:07:42] [INFO ] Deduced a trap composed of 164 places in 514 ms of which 6 ms to minimize.
[2024-05-24 19:07:43] [INFO ] Deduced a trap composed of 83 places in 619 ms of which 5 ms to minimize.
[2024-05-24 19:07:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1422 ms
[2024-05-24 19:07:44] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 360 ms.
[2024-05-24 19:07:44] [INFO ] Added : 13 causal constraints over 4 iterations in 1138 ms. Result :sat
Minimization took 5344 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Support contains 3 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 129 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 984/984 places, 4278/4278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 123 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
[2024-05-24 19:07:50] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:07:50] [INFO ] Invariant cache hit.
[2024-05-24 19:07:51] [INFO ] Implicit Places using invariants in 1218 ms returned []
[2024-05-24 19:07:51] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:07:51] [INFO ] Invariant cache hit.
[2024-05-24 19:07:52] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:08:22] [INFO ] Performed 696/984 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:08:32] [INFO ] Implicit Places using invariants and state equation in 40755 ms returned []
Implicit Place search using SMT with State Equation took 41981 ms to find 0 implicit places.
[2024-05-24 19:08:32] [INFO ] Redundant transitions in 272 ms returned []
Running 4216 sub problems to find dead transitions.
[2024-05-24 19:08:32] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:08:32] [INFO ] Invariant cache hit.
[2024-05-24 19:08:32] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/982 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4216 unsolved
SMT process timed out in 57098ms, After SMT, problems are : Problem set: 0 solved, 4216 unsolved
Search for dead transitions found 0 dead transitions in 57166ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99579 ms. Remains : 984/984 places, 4278/4278 transitions.
RANDOM walk for 40000 steps (840 resets) in 2177 ms. (18 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (121 resets) in 275 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (120 resets) in 455 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (120 resets) in 284 ms. (140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (118 resets) in 250 ms. (159 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (119 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
[2024-05-24 19:09:31] [INFO ] Flatten gal took : 521 ms
BEST_FIRST walk for 40004 steps (120 resets) in 280 ms. (142 steps per ms) remains 6/6 properties
[2024-05-24 19:09:31] [INFO ] Flatten gal took : 231 ms
[2024-05-24 19:09:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12349759728375136800.gal : 108 ms
[2024-05-24 19:09:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5746119805254637142.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12349759728375136800.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5746119805254637142.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5746119805254637142.prop.
Interrupted probabilistic random walk after 51566 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 6
Probabilistic random walk after 51566 steps, saw 21785 distinct states, run finished after 3012 ms. (steps per millisecond=17 ) properties seen :0
[2024-05-24 19:09:34] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:09:34] [INFO ] Invariant cache hit.
[2024-05-24 19:09:34] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 884/887 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :40 after 41
[2024-05-24 19:09:35] [INFO ] Deduced a trap composed of 100 places in 553 ms of which 6 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :41 after 42
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :42 after 43
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :49 after 52
[2024-05-24 19:09:35] [INFO ] Deduced a trap composed of 90 places in 513 ms of which 6 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :52 after 66
[2024-05-24 19:09:36] [INFO ] Deduced a trap composed of 232 places in 587 ms of which 6 ms to minimize.
[2024-05-24 19:09:37] [INFO ] Deduced a trap composed of 83 places in 576 ms of which 6 ms to minimize.
[2024-05-24 19:09:37] [INFO ] Deduced a trap composed of 221 places in 583 ms of which 6 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :66 after 92
[2024-05-24 19:09:38] [INFO ] Deduced a trap composed of 132 places in 595 ms of which 7 ms to minimize.
[2024-05-24 19:09:38] [INFO ] Deduced a trap composed of 83 places in 583 ms of which 6 ms to minimize.
[2024-05-24 19:09:39] [INFO ] Deduced a trap composed of 84 places in 585 ms of which 6 ms to minimize.
SMT process timed out in 5372ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 115 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 984/984 places, 4278/4278 transitions.
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :92 after 172
RANDOM walk for 40000 steps (839 resets) in 1261 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (119 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (121 resets) in 227 ms. (175 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (117 resets) in 421 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (118 resets) in 360 ms. (110 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (119 resets) in 445 ms. (89 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (118 resets) in 500 ms. (79 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 51238 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 6
Probabilistic random walk after 51238 steps, saw 21652 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
[2024-05-24 19:09:43] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:09:43] [INFO ] Invariant cache hit.
[2024-05-24 19:09:43] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 884/887 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 19:09:44] [INFO ] Deduced a trap composed of 100 places in 583 ms of which 5 ms to minimize.
[2024-05-24 19:09:45] [INFO ] Deduced a trap composed of 90 places in 562 ms of which 5 ms to minimize.
[2024-05-24 19:09:45] [INFO ] Deduced a trap composed of 232 places in 562 ms of which 6 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :172 after 489
[2024-05-24 19:09:46] [INFO ] Deduced a trap composed of 83 places in 551 ms of which 6 ms to minimize.
[2024-05-24 19:09:47] [INFO ] Deduced a trap composed of 221 places in 591 ms of which 7 ms to minimize.
[2024-05-24 19:09:47] [INFO ] Deduced a trap composed of 132 places in 590 ms of which 5 ms to minimize.
[2024-05-24 19:09:48] [INFO ] Deduced a trap composed of 83 places in 563 ms of which 6 ms to minimize.
[2024-05-24 19:09:48] [INFO ] Deduced a trap composed of 84 places in 561 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MAX0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 35/940 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 28/968 variables, 28/42 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/968 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 16/984 variables, 16/58 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/984 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3881/4865 variables, 984/1042 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4865 variables, 2722/3764 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4865 variables, 0/3764 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/4865 variables, 0/3764 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4865/4865 variables, and 3764 constraints, problems are : Problem set: 1 solved, 5 unsolved in 7666 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 984/984 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 884/887 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 19:09:52] [INFO ] Deduced a trap composed of 257 places in 551 ms of which 6 ms to minimize.
[2024-05-24 19:09:52] [INFO ] Deduced a trap composed of 90 places in 549 ms of which 7 ms to minimize.
[2024-05-24 19:09:54] [INFO ] Deduced a trap composed of 115 places in 1043 ms of which 17 ms to minimize.
[2024-05-24 19:09:55] [INFO ] Deduced a trap composed of 84 places in 1400 ms of which 9 ms to minimize.
[2024-05-24 19:09:56] [INFO ] Deduced a trap composed of 224 places in 1072 ms of which 14 ms to minimize.
[2024-05-24 19:09:58] [INFO ] Deduced a trap composed of 83 places in 1778 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 6/17 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 35/940 variables, 3/20 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 19:10:00] [INFO ] Deduced a trap composed of 5 places in 1192 ms of which 12 ms to minimize.
[2024-05-24 19:10:01] [INFO ] Deduced a trap composed of 27 places in 1140 ms of which 15 ms to minimize.
[2024-05-24 19:10:02] [INFO ] Deduced a trap composed of 63 places in 628 ms of which 6 ms to minimize.
[2024-05-24 19:10:02] [INFO ] Deduced a trap composed of 61 places in 603 ms of which 6 ms to minimize.
[2024-05-24 19:10:03] [INFO ] Deduced a trap composed of 60 places in 620 ms of which 6 ms to minimize.
[2024-05-24 19:10:03] [INFO ] Deduced a trap composed of 64 places in 620 ms of which 6 ms to minimize.
[2024-05-24 19:10:04] [INFO ] Deduced a trap composed of 64 places in 624 ms of which 5 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :489 after 1335
[2024-05-24 19:10:05] [INFO ] Deduced a trap composed of 72 places in 615 ms of which 5 ms to minimize.
[2024-05-24 19:10:05] [INFO ] Deduced a trap composed of 75 places in 617 ms of which 6 ms to minimize.
[2024-05-24 19:10:06] [INFO ] Deduced a trap composed of 75 places in 603 ms of which 6 ms to minimize.
[2024-05-24 19:10:07] [INFO ] Deduced a trap composed of 59 places in 605 ms of which 5 ms to minimize.
[2024-05-24 19:10:07] [INFO ] Deduced a trap composed of 130 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:10:08] [INFO ] Deduced a trap composed of 141 places in 601 ms of which 6 ms to minimize.
[2024-05-24 19:10:09] [INFO ] Deduced a trap composed of 103 places in 595 ms of which 5 ms to minimize.
[2024-05-24 19:10:09] [INFO ] Deduced a trap composed of 77 places in 621 ms of which 6 ms to minimize.
[2024-05-24 19:10:10] [INFO ] Deduced a trap composed of 57 places in 604 ms of which 6 ms to minimize.
[2024-05-24 19:10:10] [INFO ] Deduced a trap composed of 72 places in 590 ms of which 5 ms to minimize.
[2024-05-24 19:10:11] [INFO ] Deduced a trap composed of 68 places in 601 ms of which 6 ms to minimize.
[2024-05-24 19:10:12] [INFO ] Deduced a trap composed of 60 places in 617 ms of which 6 ms to minimize.
[2024-05-24 19:10:12] [INFO ] Deduced a trap composed of 60 places in 605 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/940 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 19:10:13] [INFO ] Deduced a trap composed of 70 places in 604 ms of which 6 ms to minimize.
[2024-05-24 19:10:14] [INFO ] Deduced a trap composed of 74 places in 607 ms of which 6 ms to minimize.
[2024-05-24 19:10:14] [INFO ] Deduced a trap composed of 83 places in 603 ms of which 6 ms to minimize.
[2024-05-24 19:10:15] [INFO ] Deduced a trap composed of 66 places in 631 ms of which 5 ms to minimize.
[2024-05-24 19:10:15] [INFO ] Deduced a trap composed of 69 places in 612 ms of which 6 ms to minimize.
[2024-05-24 19:10:16] [INFO ] Deduced a trap composed of 74 places in 634 ms of which 5 ms to minimize.
[2024-05-24 19:10:17] [INFO ] Deduced a trap composed of 58 places in 615 ms of which 7 ms to minimize.
[2024-05-24 19:10:17] [INFO ] Deduced a trap composed of 57 places in 605 ms of which 5 ms to minimize.
[2024-05-24 19:10:18] [INFO ] Deduced a trap composed of 74 places in 600 ms of which 6 ms to minimize.
[2024-05-24 19:10:19] [INFO ] Deduced a trap composed of 73 places in 560 ms of which 6 ms to minimize.
[2024-05-24 19:10:19] [INFO ] Deduced a trap composed of 86 places in 555 ms of which 6 ms to minimize.
[2024-05-24 19:10:20] [INFO ] Deduced a trap composed of 75 places in 578 ms of which 6 ms to minimize.
[2024-05-24 19:10:20] [INFO ] Deduced a trap composed of 63 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:10:21] [INFO ] Deduced a trap composed of 58 places in 571 ms of which 6 ms to minimize.
Detected timeout of ITS tools.
[2024-05-24 19:10:21] [INFO ] Flatten gal took : 164 ms
[2024-05-24 19:10:21] [INFO ] Applying decomposition
[2024-05-24 19:10:21] [INFO ] Deduced a trap composed of 62 places in 573 ms of which 6 ms to minimize.
[2024-05-24 19:10:22] [INFO ] Flatten gal took : 163 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/graph4947195083640699222.txt' '-o' '/tmp/graph4947195083640699222.bin' '-w' '/tmp/graph4947195083640699222.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4947195083640699222.bin' '-l' '-1' '-v' '-w' '/tmp/graph4947195083640699222.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:10:22] [INFO ] Decomposing Gal with order
[2024-05-24 19:10:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:10:22] [INFO ] Deduced a trap composed of 81 places in 618 ms of which 6 ms to minimize.
[2024-05-24 19:10:23] [INFO ] Deduced a trap composed of 69 places in 590 ms of which 5 ms to minimize.
[2024-05-24 19:10:23] [INFO ] Deduced a trap composed of 84 places in 582 ms of which 6 ms to minimize.
[2024-05-24 19:10:24] [INFO ] Removed a total of 8125 redundant transitions.
[2024-05-24 19:10:24] [INFO ] Flatten gal took : 1370 ms
[2024-05-24 19:10:24] [INFO ] Deduced a trap composed of 92 places in 572 ms of which 6 ms to minimize.
[2024-05-24 19:10:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2774 labels/synchronizations in 328 ms.
[2024-05-24 19:10:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14144631994935565652.gal : 104 ms
[2024-05-24 19:10:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3903156435516603645.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14144631994935565652.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3903156435516603645.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2024-05-24 19:10:25] [INFO ] Deduced a trap composed of 88 places in 585 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 20/60 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Loading property file /tmp/ReachabilityCardinality3903156435516603645.prop.
[2024-05-24 19:10:25] [INFO ] Deduced a trap composed of 27 places in 523 ms of which 5 ms to minimize.
[2024-05-24 19:10:26] [INFO ] Deduced a trap composed of 46 places in 556 ms of which 6 ms to minimize.
[2024-05-24 19:10:26] [INFO ] Deduced a trap composed of 63 places in 525 ms of which 6 ms to minimize.
[2024-05-24 19:10:27] [INFO ] Deduced a trap composed of 148 places in 552 ms of which 6 ms to minimize.
[2024-05-24 19:10:27] [INFO ] Deduced a trap composed of 70 places in 643 ms of which 7 ms to minimize.
[2024-05-24 19:10:28] [INFO ] Deduced a trap composed of 57 places in 548 ms of which 6 ms to minimize.
[2024-05-24 19:10:29] [INFO ] Deduced a trap composed of 89 places in 656 ms of which 6 ms to minimize.
[2024-05-24 19:10:29] [INFO ] Deduced a trap composed of 94 places in 681 ms of which 5 ms to minimize.
[2024-05-24 19:10:30] [INFO ] Deduced a trap composed of 88 places in 542 ms of which 6 ms to minimize.
[2024-05-24 19:10:31] [INFO ] Deduced a trap composed of 76 places in 574 ms of which 6 ms to minimize.
[2024-05-24 19:10:31] [INFO ] Deduced a trap composed of 76 places in 594 ms of which 5 ms to minimize.
[2024-05-24 19:10:32] [INFO ] Deduced a trap composed of 214 places in 513 ms of which 6 ms to minimize.
[2024-05-24 19:10:32] [INFO ] Deduced a trap composed of 105 places in 509 ms of which 6 ms to minimize.
[2024-05-24 19:10:33] [INFO ] Deduced a trap composed of 76 places in 530 ms of which 5 ms to minimize.
[2024-05-24 19:10:33] [INFO ] Deduced a trap composed of 172 places in 531 ms of which 5 ms to minimize.
[2024-05-24 19:10:34] [INFO ] Deduced a trap composed of 171 places in 532 ms of which 6 ms to minimize.
[2024-05-24 19:10:34] [INFO ] Deduced a trap composed of 172 places in 542 ms of which 5 ms to minimize.
[2024-05-24 19:10:35] [INFO ] Deduced a trap composed of 172 places in 515 ms of which 6 ms to minimize.
[2024-05-24 19:10:36] [INFO ] Deduced a trap composed of 173 places in 543 ms of which 6 ms to minimize.
[2024-05-24 19:10:36] [INFO ] Deduced a trap composed of 86 places in 541 ms of which 6 ms to minimize.
SMT process timed out in 52838ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 114 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 984/984 places, 4278/4278 transitions.
RANDOM walk for 40000 steps (839 resets) in 2258 ms. (17 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (116 resets) in 423 ms. (94 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (118 resets) in 383 ms. (104 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (118 resets) in 384 ms. (103 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (121 resets) in 369 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (118 resets) in 384 ms. (103 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 53496 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 5
Probabilistic random walk after 53496 steps, saw 22598 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
[2024-05-24 19:10:40] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:10:40] [INFO ] Invariant cache hit.
[2024-05-24 19:10:40] [INFO ] State equation strengthened by 2722 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 884/887 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/940 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:10:41] [INFO ] Deduced a trap composed of 78 places in 554 ms of which 6 ms to minimize.
[2024-05-24 19:10:42] [INFO ] Deduced a trap composed of 80 places in 671 ms of which 6 ms to minimize.
[2024-05-24 19:10:43] [INFO ] Deduced a trap composed of 76 places in 659 ms of which 7 ms to minimize.
[2024-05-24 19:10:43] [INFO ] Deduced a trap composed of 82 places in 637 ms of which 6 ms to minimize.
[2024-05-24 19:10:44] [INFO ] Deduced a trap composed of 82 places in 658 ms of which 6 ms to minimize.
[2024-05-24 19:10:45] [INFO ] Deduced a trap composed of 5 places in 650 ms of which 5 ms to minimize.
[2024-05-24 19:10:45] [INFO ] Deduced a trap composed of 46 places in 627 ms of which 6 ms to minimize.
[2024-05-24 19:10:46] [INFO ] Deduced a trap composed of 46 places in 634 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/940 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 28/968 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/968 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 16/984 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/984 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3881/4865 variables, 984/1042 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4865 variables, 2722/3764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4865 variables, 0/3764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/4865 variables, 0/3764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4865/4865 variables, and 3764 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7863 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 984/984 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 884/887 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:10:49] [INFO ] Deduced a trap composed of 257 places in 601 ms of which 6 ms to minimize.
[2024-05-24 19:10:50] [INFO ] Deduced a trap composed of 132 places in 593 ms of which 6 ms to minimize.
[2024-05-24 19:10:50] [INFO ] Deduced a trap composed of 83 places in 595 ms of which 6 ms to minimize.
[2024-05-24 19:10:51] [INFO ] Deduced a trap composed of 224 places in 594 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 35/940 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:10:52] [INFO ] Deduced a trap composed of 64 places in 614 ms of which 6 ms to minimize.
[2024-05-24 19:10:53] [INFO ] Deduced a trap composed of 83 places in 613 ms of which 6 ms to minimize.
[2024-05-24 19:10:53] [INFO ] Deduced a trap composed of 76 places in 615 ms of which 5 ms to minimize.
[2024-05-24 19:10:54] [INFO ] Deduced a trap composed of 74 places in 619 ms of which 6 ms to minimize.
[2024-05-24 19:10:54] [INFO ] Deduced a trap composed of 27 places in 615 ms of which 6 ms to minimize.
[2024-05-24 19:10:55] [INFO ] Deduced a trap composed of 71 places in 613 ms of which 6 ms to minimize.
[2024-05-24 19:10:56] [INFO ] Deduced a trap composed of 79 places in 617 ms of which 6 ms to minimize.
[2024-05-24 19:10:56] [INFO ] Deduced a trap composed of 76 places in 614 ms of which 5 ms to minimize.
[2024-05-24 19:10:57] [INFO ] Deduced a trap composed of 72 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:10:58] [INFO ] Deduced a trap composed of 82 places in 620 ms of which 7 ms to minimize.
[2024-05-24 19:10:58] [INFO ] Deduced a trap composed of 95 places in 620 ms of which 6 ms to minimize.
[2024-05-24 19:10:59] [INFO ] Deduced a trap composed of 46 places in 605 ms of which 7 ms to minimize.
[2024-05-24 19:10:59] [INFO ] Deduced a trap composed of 73 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:11:00] [INFO ] Deduced a trap composed of 89 places in 635 ms of which 8 ms to minimize.
[2024-05-24 19:11:01] [INFO ] Deduced a trap composed of 84 places in 593 ms of which 5 ms to minimize.
[2024-05-24 19:11:01] [INFO ] Deduced a trap composed of 88 places in 585 ms of which 6 ms to minimize.
[2024-05-24 19:11:02] [INFO ] Deduced a trap composed of 86 places in 636 ms of which 6 ms to minimize.
[2024-05-24 19:11:03] [INFO ] Deduced a trap composed of 86 places in 582 ms of which 6 ms to minimize.
[2024-05-24 19:11:03] [INFO ] Deduced a trap composed of 75 places in 588 ms of which 6 ms to minimize.
[2024-05-24 19:11:04] [INFO ] Deduced a trap composed of 78 places in 595 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/940 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:11:04] [INFO ] Deduced a trap composed of 173 places in 590 ms of which 6 ms to minimize.
[2024-05-24 19:11:05] [INFO ] Deduced a trap composed of 63 places in 586 ms of which 8 ms to minimize.
[2024-05-24 19:11:06] [INFO ] Deduced a trap composed of 76 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:11:06] [INFO ] Deduced a trap composed of 79 places in 597 ms of which 7 ms to minimize.
[2024-05-24 19:11:07] [INFO ] Deduced a trap composed of 76 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:11:08] [INFO ] Deduced a trap composed of 87 places in 598 ms of which 5 ms to minimize.
[2024-05-24 19:11:08] [INFO ] Deduced a trap composed of 84 places in 600 ms of which 6 ms to minimize.
[2024-05-24 19:11:09] [INFO ] Deduced a trap composed of 143 places in 641 ms of which 6 ms to minimize.
[2024-05-24 19:11:09] [INFO ] Deduced a trap composed of 137 places in 574 ms of which 6 ms to minimize.
[2024-05-24 19:11:10] [INFO ] Deduced a trap composed of 163 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:11:11] [INFO ] Deduced a trap composed of 84 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:11:11] [INFO ] Deduced a trap composed of 82 places in 588 ms of which 6 ms to minimize.
[2024-05-24 19:11:12] [INFO ] Deduced a trap composed of 88 places in 604 ms of which 6 ms to minimize.
[2024-05-24 19:11:12] [INFO ] Deduced a trap composed of 65 places in 585 ms of which 6 ms to minimize.
[2024-05-24 19:11:13] [INFO ] Deduced a trap composed of 78 places in 583 ms of which 6 ms to minimize.
[2024-05-24 19:11:14] [INFO ] Deduced a trap composed of 63 places in 579 ms of which 6 ms to minimize.
[2024-05-24 19:11:14] [INFO ] Deduced a trap composed of 76 places in 588 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2024-05-24 19:11:15] [INFO ] Deduced a trap composed of 76 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:11:15] [INFO ] Deduced a trap composed of 83 places in 624 ms of which 6 ms to minimize.
[2024-05-24 19:11:16] [INFO ] Deduced a trap composed of 75 places in 643 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:11:17] [INFO ] Deduced a trap composed of 64 places in 604 ms of which 6 ms to minimize.
[2024-05-24 19:11:17] [INFO ] Deduced a trap composed of 72 places in 636 ms of which 6 ms to minimize.
[2024-05-24 19:11:18] [INFO ] Deduced a trap composed of 114 places in 628 ms of which 6 ms to minimize.
[2024-05-24 19:11:19] [INFO ] Deduced a trap composed of 80 places in 631 ms of which 6 ms to minimize.
[2024-05-24 19:11:19] [INFO ] Deduced a trap composed of 76 places in 633 ms of which 6 ms to minimize.
[2024-05-24 19:11:20] [INFO ] Deduced a trap composed of 60 places in 622 ms of which 6 ms to minimize.
[2024-05-24 19:11:21] [INFO ] Deduced a trap composed of 73 places in 641 ms of which 7 ms to minimize.
[2024-05-24 19:11:21] [INFO ] Deduced a trap composed of 69 places in 644 ms of which 6 ms to minimize.
[2024-05-24 19:11:22] [INFO ] Deduced a trap composed of 90 places in 649 ms of which 6 ms to minimize.
[2024-05-24 19:11:23] [INFO ] Deduced a trap composed of 73 places in 648 ms of which 6 ms to minimize.
[2024-05-24 19:11:23] [INFO ] Deduced a trap composed of 27 places in 681 ms of which 6 ms to minimize.
[2024-05-24 19:11:24] [INFO ] Deduced a trap composed of 70 places in 675 ms of which 7 ms to minimize.
[2024-05-24 19:11:25] [INFO ] Deduced a trap composed of 89 places in 631 ms of which 6 ms to minimize.
[2024-05-24 19:11:25] [INFO ] Deduced a trap composed of 96 places in 656 ms of which 6 ms to minimize.
[2024-05-24 19:11:26] [INFO ] Deduced a trap composed of 72 places in 615 ms of which 6 ms to minimize.
[2024-05-24 19:11:27] [INFO ] Deduced a trap composed of 63 places in 625 ms of which 6 ms to minimize.
[2024-05-24 19:11:27] [INFO ] Deduced a trap composed of 86 places in 637 ms of which 6 ms to minimize.
[2024-05-24 19:11:28] [INFO ] Deduced a trap composed of 77 places in 645 ms of which 6 ms to minimize.
[2024-05-24 19:11:29] [INFO ] Deduced a trap composed of 57 places in 634 ms of which 6 ms to minimize.
[2024-05-24 19:11:29] [INFO ] Deduced a trap composed of 86 places in 645 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/940 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:11:30] [INFO ] Deduced a trap composed of 109 places in 551 ms of which 6 ms to minimize.
[2024-05-24 19:11:31] [INFO ] Deduced a trap composed of 88 places in 614 ms of which 6 ms to minimize.
[2024-05-24 19:11:31] [INFO ] Deduced a trap composed of 120 places in 657 ms of which 6 ms to minimize.
[2024-05-24 19:11:32] [INFO ] Deduced a trap composed of 118 places in 678 ms of which 6 ms to minimize.
[2024-05-24 19:11:33] [INFO ] Deduced a trap composed of 70 places in 661 ms of which 7 ms to minimize.
[2024-05-24 19:11:33] [INFO ] Deduced a trap composed of 82 places in 639 ms of which 6 ms to minimize.
[2024-05-24 19:11:34] [INFO ] Deduced a trap composed of 93 places in 651 ms of which 6 ms to minimize.
[2024-05-24 19:11:35] [INFO ] Deduced a trap composed of 120 places in 571 ms of which 6 ms to minimize.
[2024-05-24 19:11:35] [INFO ] Deduced a trap composed of 74 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:11:36] [INFO ] Deduced a trap composed of 63 places in 638 ms of which 5 ms to minimize.
[2024-05-24 19:11:37] [INFO ] Deduced a trap composed of 92 places in 666 ms of which 6 ms to minimize.
[2024-05-24 19:11:37] [INFO ] Deduced a trap composed of 84 places in 660 ms of which 6 ms to minimize.
[2024-05-24 19:11:38] [INFO ] Deduced a trap composed of 113 places in 627 ms of which 6 ms to minimize.
[2024-05-24 19:11:39] [INFO ] Deduced a trap composed of 78 places in 643 ms of which 7 ms to minimize.
[2024-05-24 19:11:39] [INFO ] Deduced a trap composed of 75 places in 656 ms of which 6 ms to minimize.
[2024-05-24 19:11:40] [INFO ] Deduced a trap composed of 88 places in 622 ms of which 6 ms to minimize.
[2024-05-24 19:11:41] [INFO ] Deduced a trap composed of 95 places in 631 ms of which 5 ms to minimize.
[2024-05-24 19:11:41] [INFO ] Deduced a trap composed of 181 places in 517 ms of which 6 ms to minimize.
[2024-05-24 19:11:42] [INFO ] Deduced a trap composed of 127 places in 544 ms of which 6 ms to minimize.
[2024-05-24 19:11:42] [INFO ] Deduced a trap composed of 115 places in 619 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/940 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:11:43] [INFO ] Deduced a trap composed of 104 places in 615 ms of which 6 ms to minimize.
[2024-05-24 19:11:44] [INFO ] Deduced a trap composed of 85 places in 628 ms of which 6 ms to minimize.
[2024-05-24 19:11:44] [INFO ] Deduced a trap composed of 86 places in 630 ms of which 6 ms to minimize.
[2024-05-24 19:11:45] [INFO ] Deduced a trap composed of 76 places in 649 ms of which 6 ms to minimize.
[2024-05-24 19:11:46] [INFO ] Deduced a trap composed of 83 places in 652 ms of which 6 ms to minimize.
[2024-05-24 19:11:46] [INFO ] Deduced a trap composed of 194 places in 556 ms of which 6 ms to minimize.
[2024-05-24 19:11:47] [INFO ] Deduced a trap composed of 82 places in 618 ms of which 6 ms to minimize.
[2024-05-24 19:11:48] [INFO ] Deduced a trap composed of 115 places in 649 ms of which 5 ms to minimize.
[2024-05-24 19:11:48] [INFO ] Deduced a trap composed of 71 places in 693 ms of which 7 ms to minimize.
[2024-05-24 19:11:49] [INFO ] Deduced a trap composed of 153 places in 505 ms of which 6 ms to minimize.
[2024-05-24 19:11:49] [INFO ] Deduced a trap composed of 84 places in 637 ms of which 6 ms to minimize.
[2024-05-24 19:11:50] [INFO ] Deduced a trap composed of 156 places in 592 ms of which 6 ms to minimize.
[2024-05-24 19:11:51] [INFO ] Deduced a trap composed of 93 places in 644 ms of which 6 ms to minimize.
[2024-05-24 19:11:51] [INFO ] Deduced a trap composed of 221 places in 491 ms of which 6 ms to minimize.
[2024-05-24 19:11:52] [INFO ] Deduced a trap composed of 68 places in 643 ms of which 5 ms to minimize.
[2024-05-24 19:11:53] [INFO ] Deduced a trap composed of 67 places in 635 ms of which 5 ms to minimize.
[2024-05-24 19:11:53] [INFO ] Deduced a trap composed of 73 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:11:54] [INFO ] Deduced a trap composed of 95 places in 573 ms of which 6 ms to minimize.
[2024-05-24 19:11:54] [INFO ] Deduced a trap composed of 95 places in 672 ms of which 6 ms to minimize.
[2024-05-24 19:11:55] [INFO ] Deduced a trap composed of 95 places in 649 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/940 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:11:56] [INFO ] Deduced a trap composed of 80 places in 653 ms of which 6 ms to minimize.
[2024-05-24 19:11:57] [INFO ] Deduced a trap composed of 88 places in 656 ms of which 6 ms to minimize.
[2024-05-24 19:11:57] [INFO ] Deduced a trap composed of 85 places in 645 ms of which 6 ms to minimize.
[2024-05-24 19:11:58] [INFO ] Deduced a trap composed of 93 places in 637 ms of which 6 ms to minimize.
[2024-05-24 19:11:59] [INFO ] Deduced a trap composed of 89 places in 644 ms of which 6 ms to minimize.
[2024-05-24 19:11:59] [INFO ] Deduced a trap composed of 95 places in 591 ms of which 6 ms to minimize.
[2024-05-24 19:12:00] [INFO ] Deduced a trap composed of 102 places in 633 ms of which 6 ms to minimize.
[2024-05-24 19:12:00] [INFO ] Deduced a trap composed of 109 places in 630 ms of which 7 ms to minimize.
[2024-05-24 19:12:01] [INFO ] Deduced a trap composed of 101 places in 603 ms of which 6 ms to minimize.
[2024-05-24 19:12:02] [INFO ] Deduced a trap composed of 95 places in 596 ms of which 6 ms to minimize.
[2024-05-24 19:12:02] [INFO ] Deduced a trap composed of 71 places in 615 ms of which 6 ms to minimize.
[2024-05-24 19:12:03] [INFO ] Deduced a trap composed of 65 places in 598 ms of which 6 ms to minimize.
[2024-05-24 19:12:04] [INFO ] Deduced a trap composed of 65 places in 577 ms of which 5 ms to minimize.
SMT process timed out in 83133ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 125 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 984/984 places, 4278/4278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 124 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
[2024-05-24 19:12:04] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:12:04] [INFO ] Invariant cache hit.
[2024-05-24 19:12:05] [INFO ] Implicit Places using invariants in 1300 ms returned []
[2024-05-24 19:12:05] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:12:05] [INFO ] Invariant cache hit.
[2024-05-24 19:12:06] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:12:36] [INFO ] Performed 673/984 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:12:47] [INFO ] Implicit Places using invariants and state equation in 42049 ms returned []
Implicit Place search using SMT with State Equation took 43353 ms to find 0 implicit places.
[2024-05-24 19:12:47] [INFO ] Redundant transitions in 212 ms returned []
Running 4216 sub problems to find dead transitions.
[2024-05-24 19:12:47] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:12:47] [INFO ] Invariant cache hit.
[2024-05-24 19:12:48] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/982 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4216 unsolved
SMT process timed out in 61690ms, After SMT, problems are : Problem set: 0 solved, 4216 unsolved
Search for dead transitions found 0 dead transitions in 61733ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105454 ms. Remains : 984/984 places, 4278/4278 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2]
[2024-05-24 19:13:49] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:13:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 10000 steps (210 resets) in 184 ms. (54 steps per ms)
BEST_FIRST walk for 10000 steps (30 resets) in 35 ms. (277 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2024-05-24 19:13:49] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:13:49] [INFO ] Invariant cache hit.
[2024-05-24 19:13:50] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-24 19:13:50] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:13:50] [INFO ] [Real]Absence check using state equation in 922 ms returned sat
[2024-05-24 19:13:51] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:13:51] [INFO ] [Real]Added 2722 Read/Feed constraints in 283 ms returned sat
[2024-05-24 19:13:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:13:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:13:51] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:13:52] [INFO ] [Nat]Absence check using state equation in 902 ms returned sat
[2024-05-24 19:13:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 19:13:53] [INFO ] [Nat]Added 2722 Read/Feed constraints in 978 ms returned sat
[2024-05-24 19:13:54] [INFO ] Deduced a trap composed of 171 places in 551 ms of which 6 ms to minimize.
[2024-05-24 19:13:54] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1140 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2]
Support contains 1 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 984 transition count 4277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 983 transition count 4277
Applied a total of 2 rules in 252 ms. Remains 983 /984 variables (removed 1) and now considering 4277/4278 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 983/984 places, 4277/4278 transitions.
[2024-05-24 19:13:55] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2024-05-24 19:13:55] [INFO ] Computed 50 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 1000000 steps (21030 resets) in 16993 ms. (58 steps per ms)
BEST_FIRST walk for 1000001 steps (3018 resets) in 3167 ms. (315 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2024-05-24 19:14:15] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:14:15] [INFO ] Invariant cache hit.
[2024-05-24 19:14:15] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 19:14:15] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 11 ms returned sat
[2024-05-24 19:14:16] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2024-05-24 19:14:16] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:14:16] [INFO ] [Real]Added 2722 Read/Feed constraints in 266 ms returned sat
[2024-05-24 19:14:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:14:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-24 19:14:16] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:14:17] [INFO ] [Nat]Absence check using state equation in 1045 ms returned sat
[2024-05-24 19:14:18] [INFO ] [Nat]Added 2722 Read/Feed constraints in 642 ms returned sat
[2024-05-24 19:14:19] [INFO ] Deduced a trap composed of 135 places in 542 ms of which 7 ms to minimize.
[2024-05-24 19:14:20] [INFO ] Deduced a trap composed of 168 places in 545 ms of which 6 ms to minimize.
[2024-05-24 19:14:20] [INFO ] Deduced a trap composed of 201 places in 542 ms of which 6 ms to minimize.
[2024-05-24 19:14:21] [INFO ] Deduced a trap composed of 173 places in 544 ms of which 6 ms to minimize.
[2024-05-24 19:14:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3665 ms
[2024-05-24 19:14:22] [INFO ] Computed and/alt/rep : 1342/1949/1342 causal constraints (skipped 2475 transitions) in 229 ms.
[2024-05-24 19:14:23] [INFO ] Added : 14 causal constraints over 3 iterations in 873 ms. Result :sat
Minimization took 5894 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2]
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 118 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 983/983 places, 4277/4277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 115 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
[2024-05-24 19:14:29] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:14:29] [INFO ] Invariant cache hit.
[2024-05-24 19:14:30] [INFO ] Implicit Places using invariants in 1323 ms returned []
[2024-05-24 19:14:30] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:14:30] [INFO ] Invariant cache hit.
[2024-05-24 19:14:31] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:15:01] [INFO ] Performed 725/983 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:15:13] [INFO ] Implicit Places using invariants and state equation in 42614 ms returned []
Implicit Place search using SMT with State Equation took 43939 ms to find 0 implicit places.
[2024-05-24 19:15:13] [INFO ] Redundant transitions in 211 ms returned []
Running 4215 sub problems to find dead transitions.
[2024-05-24 19:15:13] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:15:13] [INFO ] Invariant cache hit.
[2024-05-24 19:15:13] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4215 unsolved
SMT process timed out in 61435ms, After SMT, problems are : Problem set: 0 solved, 4215 unsolved
Search for dead transitions found 0 dead transitions in 61474ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105763 ms. Remains : 983/983 places, 4277/4277 transitions.
[2024-05-24 19:16:15] [INFO ] Flatten gal took : 187 ms
[2024-05-24 19:16:15] [INFO ] Flatten gal took : 158 ms
[2024-05-24 19:16:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15403366210247849091.gal : 24 ms
[2024-05-24 19:16:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15687086666187338909.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15403366210247849091.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15687086666187338909.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (840 resets) in 1522 ms. (26 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (118 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (118 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality15687086666187338909.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 42
Interrupted probabilistic random walk after 60881 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 60881 steps, saw 25690 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 19:16:18] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:16:18] [INFO ] Invariant cache hit.
[2024-05-24 19:16:18] [INFO ] State equation strengthened by 2722 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 43
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 884/888 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 52
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :52 after 66
[2024-05-24 19:16:19] [INFO ] Deduced a trap composed of 77 places in 591 ms of which 7 ms to minimize.
[2024-05-24 19:16:19] [INFO ] Deduced a trap composed of 65 places in 622 ms of which 6 ms to minimize.
[2024-05-24 19:16:20] [INFO ] Deduced a trap composed of 58 places in 580 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :66 after 92
[2024-05-24 19:16:21] [INFO ] Deduced a trap composed of 73 places in 625 ms of which 6 ms to minimize.
[2024-05-24 19:16:21] [INFO ] Deduced a trap composed of 63 places in 653 ms of which 7 ms to minimize.
[2024-05-24 19:16:22] [INFO ] Deduced a trap composed of 56 places in 627 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
[2024-05-24 19:16:23] [INFO ] Deduced a trap composed of 57 places in 600 ms of which 6 ms to minimize.
[2024-05-24 19:16:23] [INFO ] Deduced a trap composed of 65 places in 621 ms of which 5 ms to minimize.
SMT process timed out in 5289ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 126 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 983/983 places, 4277/4277 transitions.
RANDOM walk for 40000 steps (840 resets) in 941 ms. (42 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (117 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 66662 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 66662 steps, saw 28109 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 19:16:27] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:16:27] [INFO ] Invariant cache hit.
[2024-05-24 19:16:27] [INFO ] State equation strengthened by 2722 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 884/888 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/967 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/983 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3879/4862 variables, 983/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 489
At refinement iteration 14 (INCLUDED_ONLY) 0/4862 variables, 2722/3755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4862 variables, 0/3755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4862 variables, 0/3755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4862/4862 variables, and 3755 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1465 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 983/983 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 884/888 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:16:29] [INFO ] Deduced a trap composed of 5 places in 624 ms of which 6 ms to minimize.
[2024-05-24 19:16:30] [INFO ] Deduced a trap composed of 27 places in 614 ms of which 5 ms to minimize.
[2024-05-24 19:16:30] [INFO ] Deduced a trap composed of 63 places in 630 ms of which 5 ms to minimize.
[2024-05-24 19:16:30] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/967 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/967 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 16/983 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/983 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3879/4862 variables, 983/1037 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4862 variables, 2722/3759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4862 variables, 1/3760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:16:33] [INFO ] Deduced a trap composed of 201 places in 529 ms of which 7 ms to minimize.
[2024-05-24 19:16:34] [INFO ] Deduced a trap composed of 173 places in 550 ms of which 6 ms to minimize.
[2024-05-24 19:16:35] [INFO ] Deduced a trap composed of 184 places in 552 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4862 variables, 3/3763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4862 variables, 0/3763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/4862 variables, 0/3763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4862/4862 variables, and 3763 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7317 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 983/983 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 8821ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 121 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 983/983 places, 4277/4277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 119 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
[2024-05-24 19:16:36] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:16:36] [INFO ] Invariant cache hit.
[2024-05-24 19:16:37] [INFO ] Implicit Places using invariants in 1275 ms returned []
[2024-05-24 19:16:37] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:16:37] [INFO ] Invariant cache hit.
[2024-05-24 19:16:38] [INFO ] State equation strengthened by 2722 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :489 after 1335
Detected timeout of ITS tools.
[2024-05-24 19:17:05] [INFO ] Flatten gal took : 118 ms
[2024-05-24 19:17:05] [INFO ] Applying decomposition
[2024-05-24 19:17:05] [INFO ] Flatten gal took : 120 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/graph14913467412712803863.txt' '-o' '/tmp/graph14913467412712803863.bin' '-w' '/tmp/graph14913467412712803863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14913467412712803863.bin' '-l' '-1' '-v' '-w' '/tmp/graph14913467412712803863.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:17:05] [INFO ] Decomposing Gal with order
[2024-05-24 19:17:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:17:06] [INFO ] Removed a total of 8294 redundant transitions.
[2024-05-24 19:17:06] [INFO ] Flatten gal took : 447 ms
[2024-05-24 19:17:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 2668 labels/synchronizations in 145 ms.
[2024-05-24 19:17:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7862817891571616629.gal : 35 ms
[2024-05-24 19:17:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17719792479396045341.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7862817891571616629.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17719792479396045341.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17719792479396045341.prop.
[2024-05-24 19:17:08] [INFO ] Performed 670/983 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:17:22] [INFO ] Implicit Places using invariants and state equation in 45000 ms returned []
Implicit Place search using SMT with State Equation took 46281 ms to find 0 implicit places.
[2024-05-24 19:17:22] [INFO ] Redundant transitions in 218 ms returned []
Running 4215 sub problems to find dead transitions.
[2024-05-24 19:17:22] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:17:22] [INFO ] Invariant cache hit.
[2024-05-24 19:17:22] [INFO ] State equation strengthened by 2722 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4215 unsolved
SMT process timed out in 62459ms, After SMT, problems are : Problem set: 0 solved, 4215 unsolved
Search for dead transitions found 0 dead transitions in 62500ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109140 ms. Remains : 983/983 places, 4277/4277 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[2]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01 in 275725 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:18:25] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 984 cols
[2024-05-24 19:18:25] [INFO ] Computed 50 invariants in 32 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (210 resets) in 171 ms. (58 steps per ms)
BEST_FIRST walk for 10001 steps (30 resets) in 31 ms. (312 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:18:25] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:18:25] [INFO ] Invariant cache hit.
[2024-05-24 19:18:25] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:18:25] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:18:26] [INFO ] [Real]Absence check using state equation in 803 ms returned sat
[2024-05-24 19:18:26] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:18:26] [INFO ] [Real]Added 2722 Read/Feed constraints in 287 ms returned sat
[2024-05-24 19:18:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:18:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:18:27] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-24 19:18:27] [INFO ] [Nat]Absence check using state equation in 778 ms returned sat
[2024-05-24 19:18:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 19:18:29] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1130 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 984 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node15ThinksNode14ShouldBeNodeMasterToReplaceNode4) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4276/4276 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 983 transition count 4274
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 983 transition count 4272
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 981 transition count 4272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 980 transition count 4271
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 980 transition count 4271
Applied a total of 7 rules in 297 ms. Remains 980 /984 variables (removed 4) and now considering 4271/4276 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 980/984 places, 4271/4276 transitions.
[2024-05-24 19:18:29] [INFO ] Flow matrix only has 3873 transitions (discarded 398 similar events)
// Phase 1: matrix 3873 rows 980 cols
[2024-05-24 19:18:29] [INFO ] Computed 50 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21029 resets) in 16995 ms. (58 steps per ms)
BEST_FIRST walk for 1000000 steps (3021 resets) in 3173 ms. (315 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:18:49] [INFO ] Flow matrix only has 3873 transitions (discarded 398 similar events)
[2024-05-24 19:18:49] [INFO ] Invariant cache hit.
[2024-05-24 19:18:49] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 19:18:49] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:18:50] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2024-05-24 19:18:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:18:50] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:18:50] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 9 ms returned sat
[2024-05-24 19:18:51] [INFO ] [Nat]Absence check using state equation in 772 ms returned sat
[2024-05-24 19:18:51] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2024-05-24 19:18:53] [INFO ] [Nat]Added 2720 Read/Feed constraints in 1680 ms returned sat
[2024-05-24 19:18:53] [INFO ] Computed and/alt/rep : 1335/1930/1335 causal constraints (skipped 2476 transitions) in 236 ms.
[2024-05-24 19:18:54] [INFO ] Added : 22 causal constraints over 5 iterations in 1135 ms. Result :sat
Minimization took 6635 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 980 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 980/980 places, 4271/4271 transitions.
Applied a total of 0 rules in 129 ms. Remains 980 /980 variables (removed 0) and now considering 4271/4271 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 980/980 places, 4271/4271 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 980/980 places, 4271/4271 transitions.
Applied a total of 0 rules in 123 ms. Remains 980 /980 variables (removed 0) and now considering 4271/4271 (removed 0) transitions.
[2024-05-24 19:19:01] [INFO ] Flow matrix only has 3873 transitions (discarded 398 similar events)
[2024-05-24 19:19:01] [INFO ] Invariant cache hit.
[2024-05-24 19:19:02] [INFO ] Implicit Places using invariants in 1246 ms returned [234]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1250 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 979/980 places, 4271/4271 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 978 transition count 4270
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 978 transition count 4270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 977 transition count 4269
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 977 transition count 4269
Applied a total of 4 rules in 196 ms. Remains 977 /979 variables (removed 2) and now considering 4269/4271 (removed 2) transitions.
[2024-05-24 19:19:02] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
// Phase 1: matrix 3871 rows 977 cols
[2024-05-24 19:19:02] [INFO ] Computed 49 invariants in 34 ms
[2024-05-24 19:19:04] [INFO ] Implicit Places using invariants in 1346 ms returned []
[2024-05-24 19:19:04] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:19:04] [INFO ] Invariant cache hit.
[2024-05-24 19:19:05] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2024-05-24 19:19:36] [INFO ] Performed 559/977 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2024-05-24 19:19:58] [INFO ] Implicit Places using invariants and state equation in 54111 ms returned []
Implicit Place search using SMT with State Equation took 55463 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 977/980 places, 4269/4271 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 57033 ms. Remains : 977/980 places, 4269/4271 transitions.
[2024-05-24 19:19:58] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:19:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21027 resets) in 17047 ms. (58 steps per ms)
BEST_FIRST walk for 1000001 steps (3007 resets) in 3148 ms. (317 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:20:18] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:20:18] [INFO ] Invariant cache hit.
[2024-05-24 19:20:18] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-24 19:20:18] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-24 19:20:19] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2024-05-24 19:20:19] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2024-05-24 19:20:20] [INFO ] [Real]Added 2720 Read/Feed constraints in 405 ms returned sat
[2024-05-24 19:20:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:20:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:20:20] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-24 19:20:21] [INFO ] [Nat]Absence check using state equation in 850 ms returned sat
[2024-05-24 19:20:22] [INFO ] [Nat]Added 2720 Read/Feed constraints in 1374 ms returned sat
[2024-05-24 19:20:23] [INFO ] Deduced a trap composed of 235 places in 506 ms of which 6 ms to minimize.
[2024-05-24 19:20:23] [INFO ] Deduced a trap composed of 90 places in 600 ms of which 6 ms to minimize.
[2024-05-24 19:20:24] [INFO ] Deduced a trap composed of 94 places in 612 ms of which 6 ms to minimize.
[2024-05-24 19:20:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2101 ms
[2024-05-24 19:20:24] [INFO ] Computed and/alt/rep : 1334/1922/1334 causal constraints (skipped 2475 transitions) in 224 ms.
[2024-05-24 19:20:25] [INFO ] Added : 19 causal constraints over 4 iterations in 1000 ms. Result :sat
Minimization took 6613 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 136 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 977/977 places, 4269/4269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 123 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
[2024-05-24 19:20:32] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:20:32] [INFO ] Invariant cache hit.
[2024-05-24 19:20:33] [INFO ] Implicit Places using invariants in 1292 ms returned []
[2024-05-24 19:20:33] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:20:33] [INFO ] Invariant cache hit.
[2024-05-24 19:20:34] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2024-05-24 19:21:05] [INFO ] Performed 560/977 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:21:23] [INFO ] Implicit Places using invariants and state equation in 50002 ms returned []
Implicit Place search using SMT with State Equation took 51299 ms to find 0 implicit places.
[2024-05-24 19:21:23] [INFO ] Redundant transitions in 214 ms returned []
Running 4207 sub problems to find dead transitions.
[2024-05-24 19:21:24] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:21:24] [INFO ] Invariant cache hit.
[2024-05-24 19:21:24] [INFO ] State equation strengthened by 2720 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/974 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4207 unsolved
SMT process timed out in 64241ms, After SMT, problems are : Problem set: 0 solved, 4207 unsolved
Search for dead transitions found 0 dead transitions in 64279ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115937 ms. Remains : 977/977 places, 4269/4269 transitions.
[2024-05-24 19:22:28] [INFO ] Flatten gal took : 115 ms
[2024-05-24 19:22:28] [INFO ] Flatten gal took : 117 ms
[2024-05-24 19:22:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4172594431735660577.gal : 32 ms
[2024-05-24 19:22:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1128330105105605915.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4172594431735660577.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1128330105105605915.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (840 resets) in 1071 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (115 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (119 resets) in 377 ms. (105 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality1128330105105605915.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 42
Interrupted probabilistic random walk after 62101 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 62101 steps, saw 26209 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 19:22:31] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:22:31] [INFO ] Invariant cache hit.
[2024-05-24 19:22:31] [INFO ] State equation strengthened by 2720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 43
At refinement iteration 1 (OVERLAPS) 880/881 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 53
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :53 after 69
[2024-05-24 19:22:32] [INFO ] Deduced a trap composed of 80 places in 588 ms of which 5 ms to minimize.
[2024-05-24 19:22:33] [INFO ] Deduced a trap composed of 98 places in 578 ms of which 6 ms to minimize.
[2024-05-24 19:22:33] [INFO ] Deduced a trap composed of 157 places in 573 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :69 after 92
[2024-05-24 19:22:34] [INFO ] Deduced a trap composed of 227 places in 587 ms of which 6 ms to minimize.
[2024-05-24 19:22:35] [INFO ] Deduced a trap composed of 111 places in 581 ms of which 7 ms to minimize.
[2024-05-24 19:22:35] [INFO ] Deduced a trap composed of 122 places in 577 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
[2024-05-24 19:22:36] [INFO ] Deduced a trap composed of 224 places in 579 ms of which 6 ms to minimize.
[2024-05-24 19:22:36] [INFO ] Deduced a trap composed of 133 places in 605 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 899/4848 variables, and 11 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/31 constraints, Generalized P Invariants (flows): 0/18 constraints, State Equation: 0/977 constraints, ReadFeed: 0/2720 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 880/881 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:22:38] [INFO ] Deduced a trap composed of 300 places in 1057 ms of which 17 ms to minimize.
[2024-05-24 19:22:39] [INFO ] Deduced a trap composed of 81 places in 1020 ms of which 15 ms to minimize.
[2024-05-24 19:22:40] [INFO ] Deduced a trap composed of 144 places in 1013 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/933 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:22:40] [INFO ] Deduced a trap composed of 5 places in 506 ms of which 5 ms to minimize.
[2024-05-24 19:22:41] [INFO ] Deduced a trap composed of 140 places in 510 ms of which 6 ms to minimize.
[2024-05-24 19:22:41] [INFO ] Deduced a trap composed of 46 places in 476 ms of which 5 ms to minimize.
[2024-05-24 19:22:42] [INFO ] Deduced a trap composed of 27 places in 523 ms of which 5 ms to minimize.
SMT process timed out in 10562ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 116 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 977/977 places, 4269/4269 transitions.
SDD proceeding with computation,2 properties remain. new max is 2048
RANDOM walk for 40000 steps (841 resets) in 1528 ms. (26 steps per ms) remains 2/2 properties
SDD size :172 after 489
BEST_FIRST walk for 40004 steps (118 resets) in 278 ms. (143 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (118 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 63600 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 63600 steps, saw 26824 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-24 19:22:46] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:22:46] [INFO ] Invariant cache hit.
[2024-05-24 19:22:46] [INFO ] State equation strengthened by 2720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 880/881 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:22:46] [INFO ] Deduced a trap composed of 80 places in 529 ms of which 5 ms to minimize.
[2024-05-24 19:22:47] [INFO ] Deduced a trap composed of 98 places in 536 ms of which 6 ms to minimize.
[2024-05-24 19:22:47] [INFO ] Deduced a trap composed of 157 places in 533 ms of which 5 ms to minimize.
[2024-05-24 19:22:48] [INFO ] Deduced a trap composed of 227 places in 536 ms of which 6 ms to minimize.
[2024-05-24 19:22:49] [INFO ] Deduced a trap composed of 111 places in 537 ms of which 5 ms to minimize.
[2024-05-24 19:22:49] [INFO ] Deduced a trap composed of 122 places in 534 ms of which 5 ms to minimize.
[2024-05-24 19:22:50] [INFO ] Deduced a trap composed of 224 places in 528 ms of which 6 ms to minimize.
[2024-05-24 19:22:50] [INFO ] Deduced a trap composed of 133 places in 536 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/933 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/933 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/961 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/961 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/977 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/977 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3871/4848 variables, 977/1034 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4848 variables, 2720/3754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4848 variables, 0/3754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4848 variables, 0/3754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4848/4848 variables, and 3754 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6306 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 977/977 constraints, ReadFeed: 2720/2720 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 880/881 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:22:53] [INFO ] Deduced a trap composed of 300 places in 539 ms of which 6 ms to minimize.
[2024-05-24 19:22:53] [INFO ] Deduced a trap composed of 81 places in 533 ms of which 6 ms to minimize.
[2024-05-24 19:22:54] [INFO ] Deduced a trap composed of 144 places in 533 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/933 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:22:54] [INFO ] Deduced a trap composed of 5 places in 477 ms of which 6 ms to minimize.
[2024-05-24 19:22:55] [INFO ] Deduced a trap composed of 140 places in 483 ms of which 5 ms to minimize.
[2024-05-24 19:22:55] [INFO ] Deduced a trap composed of 46 places in 471 ms of which 5 ms to minimize.
[2024-05-24 19:22:56] [INFO ] Deduced a trap composed of 27 places in 508 ms of which 6 ms to minimize.
[2024-05-24 19:22:56] [INFO ] Deduced a trap composed of 57 places in 497 ms of which 6 ms to minimize.
[2024-05-24 19:22:57] [INFO ] Deduced a trap composed of 139 places in 477 ms of which 6 ms to minimize.
[2024-05-24 19:22:57] [INFO ] Deduced a trap composed of 141 places in 476 ms of which 6 ms to minimize.
[2024-05-24 19:22:58] [INFO ] Deduced a trap composed of 46 places in 469 ms of which 5 ms to minimize.
[2024-05-24 19:22:58] [INFO ] Deduced a trap composed of 161 places in 474 ms of which 5 ms to minimize.
[2024-05-24 19:22:59] [INFO ] Deduced a trap composed of 77 places in 566 ms of which 5 ms to minimize.
[2024-05-24 19:23:00] [INFO ] Deduced a trap composed of 82 places in 566 ms of which 5 ms to minimize.
[2024-05-24 19:23:00] [INFO ] Deduced a trap composed of 70 places in 561 ms of which 5 ms to minimize.
[2024-05-24 19:23:01] [INFO ] Deduced a trap composed of 75 places in 560 ms of which 5 ms to minimize.
[2024-05-24 19:23:01] [INFO ] Deduced a trap composed of 85 places in 473 ms of which 6 ms to minimize.
[2024-05-24 19:23:02] [INFO ] Deduced a trap composed of 46 places in 465 ms of which 5 ms to minimize.
[2024-05-24 19:23:02] [INFO ] Deduced a trap composed of 176 places in 482 ms of which 6 ms to minimize.
[2024-05-24 19:23:03] [INFO ] Deduced a trap composed of 71 places in 467 ms of which 5 ms to minimize.
[2024-05-24 19:23:03] [INFO ] Deduced a trap composed of 88 places in 475 ms of which 5 ms to minimize.
[2024-05-24 19:23:04] [INFO ] Deduced a trap composed of 62 places in 472 ms of which 5 ms to minimize.
[2024-05-24 19:23:04] [INFO ] Deduced a trap composed of 75 places in 496 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/933 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:23:05] [INFO ] Deduced a trap composed of 187 places in 474 ms of which 6 ms to minimize.
[2024-05-24 19:23:05] [INFO ] Deduced a trap composed of 187 places in 483 ms of which 6 ms to minimize.
[2024-05-24 19:23:06] [INFO ] Deduced a trap composed of 92 places in 489 ms of which 6 ms to minimize.
[2024-05-24 19:23:06] [INFO ] Deduced a trap composed of 118 places in 468 ms of which 6 ms to minimize.
[2024-05-24 19:23:07] [INFO ] Deduced a trap composed of 66 places in 564 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :489 after 1335
[2024-05-24 19:23:07] [INFO ] Deduced a trap composed of 71 places in 563 ms of which 5 ms to minimize.
[2024-05-24 19:23:08] [INFO ] Deduced a trap composed of 63 places in 555 ms of which 5 ms to minimize.
[2024-05-24 19:23:08] [INFO ] Deduced a trap composed of 74 places in 561 ms of which 5 ms to minimize.
[2024-05-24 19:23:09] [INFO ] Deduced a trap composed of 64 places in 566 ms of which 6 ms to minimize.
[2024-05-24 19:23:10] [INFO ] Deduced a trap composed of 76 places in 553 ms of which 5 ms to minimize.
[2024-05-24 19:23:10] [INFO ] Deduced a trap composed of 92 places in 475 ms of which 5 ms to minimize.
[2024-05-24 19:23:11] [INFO ] Deduced a trap composed of 97 places in 560 ms of which 5 ms to minimize.
[2024-05-24 19:23:11] [INFO ] Deduced a trap composed of 69 places in 555 ms of which 6 ms to minimize.
[2024-05-24 19:23:12] [INFO ] Deduced a trap composed of 106 places in 602 ms of which 6 ms to minimize.
[2024-05-24 19:23:13] [INFO ] Deduced a trap composed of 85 places in 609 ms of which 6 ms to minimize.
[2024-05-24 19:23:13] [INFO ] Deduced a trap composed of 83 places in 613 ms of which 6 ms to minimize.
[2024-05-24 19:23:14] [INFO ] Deduced a trap composed of 97 places in 609 ms of which 6 ms to minimize.
[2024-05-24 19:23:14] [INFO ] Deduced a trap composed of 154 places in 514 ms of which 5 ms to minimize.
[2024-05-24 19:23:15] [INFO ] Deduced a trap composed of 85 places in 517 ms of which 6 ms to minimize.
[2024-05-24 19:23:15] [INFO ] Deduced a trap composed of 95 places in 587 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/933 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:23:16] [INFO ] Deduced a trap composed of 81 places in 587 ms of which 6 ms to minimize.
[2024-05-24 19:23:17] [INFO ] Deduced a trap composed of 85 places in 590 ms of which 6 ms to minimize.
[2024-05-24 19:23:17] [INFO ] Deduced a trap composed of 72 places in 602 ms of which 6 ms to minimize.
[2024-05-24 19:23:18] [INFO ] Deduced a trap composed of 82 places in 632 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2024-05-24 19:23:18] [INFO ] Flatten gal took : 111 ms
[2024-05-24 19:23:18] [INFO ] Applying decomposition
[2024-05-24 19:23:18] [INFO ] Flatten gal took : 112 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/graph3983136968540661894.txt' '-o' '/tmp/graph3983136968540661894.bin' '-w' '/tmp/graph3983136968540661894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3983136968540661894.bin' '-l' '-1' '-v' '-w' '/tmp/graph3983136968540661894.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:23:19] [INFO ] Decomposing Gal with order
[2024-05-24 19:23:19] [INFO ] Deduced a trap composed of 74 places in 605 ms of which 5 ms to minimize.
[2024-05-24 19:23:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:23:19] [INFO ] Removed a total of 8235 redundant transitions.
[2024-05-24 19:23:19] [INFO ] Flatten gal took : 466 ms
[2024-05-24 19:23:19] [INFO ] Deduced a trap composed of 73 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:23:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 2692 labels/synchronizations in 149 ms.
[2024-05-24 19:23:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9931254024048708831.gal : 117 ms
[2024-05-24 19:23:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11792724397084462060.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9931254024048708831.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11792724397084462060.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11792724397084462060.prop.
[2024-05-24 19:23:20] [INFO ] Deduced a trap composed of 85 places in 908 ms of which 6 ms to minimize.
[2024-05-24 19:23:21] [INFO ] Deduced a trap composed of 86 places in 580 ms of which 5 ms to minimize.
[2024-05-24 19:23:21] [INFO ] Deduced a trap composed of 103 places in 490 ms of which 5 ms to minimize.
[2024-05-24 19:23:22] [INFO ] Deduced a trap composed of 70 places in 578 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 217
[2024-05-24 19:23:22] [INFO ] Deduced a trap composed of 77 places in 584 ms of which 6 ms to minimize.
[2024-05-24 19:23:23] [INFO ] Deduced a trap composed of 72 places in 588 ms of which 6 ms to minimize.
[2024-05-24 19:23:24] [INFO ] Deduced a trap composed of 219 places in 498 ms of which 6 ms to minimize.
[2024-05-24 19:23:24] [INFO ] Deduced a trap composed of 204 places in 492 ms of which 5 ms to minimize.
[2024-05-24 19:23:25] [INFO ] Deduced a trap composed of 213 places in 488 ms of which 6 ms to minimize.
[2024-05-24 19:23:25] [INFO ] Deduced a trap composed of 76 places in 583 ms of which 6 ms to minimize.
[2024-05-24 19:23:26] [INFO ] Deduced a trap composed of 246 places in 505 ms of which 5 ms to minimize.
[2024-05-24 19:23:26] [INFO ] Deduced a trap composed of 209 places in 475 ms of which 6 ms to minimize.
[2024-05-24 19:23:27] [INFO ] Deduced a trap composed of 113 places in 482 ms of which 6 ms to minimize.
[2024-05-24 19:23:27] [INFO ] Deduced a trap composed of 84 places in 574 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/933 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:23:28] [INFO ] Deduced a trap composed of 64 places in 557 ms of which 5 ms to minimize.
[2024-05-24 19:23:28] [INFO ] Deduced a trap composed of 80 places in 557 ms of which 5 ms to minimize.
[2024-05-24 19:23:29] [INFO ] Deduced a trap composed of 62 places in 546 ms of which 6 ms to minimize.
[2024-05-24 19:23:30] [INFO ] Deduced a trap composed of 111 places in 570 ms of which 6 ms to minimize.
[2024-05-24 19:23:30] [INFO ] Deduced a trap composed of 70 places in 557 ms of which 6 ms to minimize.
[2024-05-24 19:23:31] [INFO ] Deduced a trap composed of 157 places in 465 ms of which 6 ms to minimize.
[2024-05-24 19:23:31] [INFO ] Deduced a trap composed of 145 places in 468 ms of which 6 ms to minimize.
[2024-05-24 19:23:32] [INFO ] Deduced a trap composed of 80 places in 555 ms of which 5 ms to minimize.
[2024-05-24 19:23:32] [INFO ] Deduced a trap composed of 70 places in 567 ms of which 6 ms to minimize.
[2024-05-24 19:23:33] [INFO ] Deduced a trap composed of 72 places in 599 ms of which 6 ms to minimize.
[2024-05-24 19:23:34] [INFO ] Deduced a trap composed of 88 places in 556 ms of which 5 ms to minimize.
[2024-05-24 19:23:34] [INFO ] Deduced a trap composed of 71 places in 559 ms of which 5 ms to minimize.
[2024-05-24 19:23:35] [INFO ] Deduced a trap composed of 72 places in 563 ms of which 5 ms to minimize.
[2024-05-24 19:23:35] [INFO ] Deduced a trap composed of 78 places in 558 ms of which 5 ms to minimize.
[2024-05-24 19:23:36] [INFO ] Deduced a trap composed of 71 places in 592 ms of which 6 ms to minimize.
[2024-05-24 19:23:36] [INFO ] Deduced a trap composed of 88 places in 550 ms of which 6 ms to minimize.
[2024-05-24 19:23:37] [INFO ] Deduced a trap composed of 87 places in 557 ms of which 5 ms to minimize.
SMT process timed out in 51429ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 120 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 977/977 places, 4269/4269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 126 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
[2024-05-24 19:23:37] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:23:37] [INFO ] Invariant cache hit.
[2024-05-24 19:23:39] [INFO ] Implicit Places using invariants in 1245 ms returned []
[2024-05-24 19:23:39] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:23:39] [INFO ] Invariant cache hit.
[2024-05-24 19:23:39] [INFO ] State equation strengthened by 2720 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :217 after 1993
Detected timeout of ITS tools.
[2024-05-24 19:24:10] [INFO ] Performed 559/977 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:24:30] [INFO ] Implicit Places using invariants and state equation in 51394 ms returned []
Implicit Place search using SMT with State Equation took 52640 ms to find 0 implicit places.
[2024-05-24 19:24:30] [INFO ] Redundant transitions in 210 ms returned []
Running 4207 sub problems to find dead transitions.
[2024-05-24 19:24:30] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:24:30] [INFO ] Invariant cache hit.
[2024-05-24 19:24:30] [INFO ] State equation strengthened by 2720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/974 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4207 unsolved
SMT process timed out in 61007ms, After SMT, problems are : Problem set: 0 solved, 4207 unsolved
Search for dead transitions found 0 dead transitions in 61052ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114051 ms. Remains : 977/977 places, 4269/4269 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02 in 426317 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:25:31] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 984 cols
[2024-05-24 19:25:31] [INFO ] Computed 50 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (209 resets) in 179 ms. (55 steps per ms)
BEST_FIRST walk for 10001 steps (31 resets) in 35 ms. (277 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:25:31] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:25:31] [INFO ] Invariant cache hit.
[2024-05-24 19:25:32] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:25:32] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 5 ms returned sat
[2024-05-24 19:25:32] [INFO ] [Real]Absence check using state equation in 845 ms returned sat
[2024-05-24 19:25:33] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:25:33] [INFO ] [Real]Added 2722 Read/Feed constraints in 251 ms returned sat
[2024-05-24 19:25:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:25:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 19:25:33] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:25:34] [INFO ] [Nat]Absence check using state equation in 759 ms returned sat
[2024-05-24 19:25:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 19:25:35] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1137 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 984 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node13ThinksNode4ShouldBeNodeMasterToReplaceNode12) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4276/4276 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 984 transition count 4275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 983 transition count 4275
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 982 transition count 4274
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 982 transition count 4274
Applied a total of 4 rules in 299 ms. Remains 982 /984 variables (removed 2) and now considering 4274/4276 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 982/984 places, 4274/4276 transitions.
[2024-05-24 19:25:35] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 982 cols
[2024-05-24 19:25:35] [INFO ] Computed 50 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21029 resets) in 16649 ms. (60 steps per ms)
BEST_FIRST walk for 1000001 steps (3017 resets) in 3075 ms. (325 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:25:55] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2024-05-24 19:25:55] [INFO ] Invariant cache hit.
[2024-05-24 19:25:55] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned sat
[2024-05-24 19:25:55] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 5 ms returned sat
[2024-05-24 19:25:56] [INFO ] [Real]Absence check using state equation in 883 ms returned sat
[2024-05-24 19:25:56] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2024-05-24 19:25:56] [INFO ] [Real]Added 2721 Read/Feed constraints in 331 ms returned sat
[2024-05-24 19:25:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:25:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:25:57] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 6 ms returned sat
[2024-05-24 19:25:58] [INFO ] [Nat]Absence check using state equation in 983 ms returned sat
[2024-05-24 19:25:59] [INFO ] [Nat]Added 2721 Read/Feed constraints in 1383 ms returned sat
[2024-05-24 19:26:00] [INFO ] Deduced a trap composed of 228 places in 540 ms of which 6 ms to minimize.
[2024-05-24 19:26:00] [INFO ] Deduced a trap composed of 92 places in 576 ms of which 6 ms to minimize.
[2024-05-24 19:26:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1409 ms
[2024-05-24 19:26:01] [INFO ] Computed and/alt/rep : 1339/1936/1339 causal constraints (skipped 2476 transitions) in 243 ms.
[2024-05-24 19:26:03] [INFO ] Deduced a trap composed of 84 places in 564 ms of which 6 ms to minimize.
[2024-05-24 19:26:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 788 ms
[2024-05-24 19:26:03] [INFO ] Added : 23 causal constraints over 7 iterations in 2452 ms. Result :sat
Minimization took 6389 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 982 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4274/4274 transitions.
Applied a total of 0 rules in 130 ms. Remains 982 /982 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 982/982 places, 4274/4274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4274/4274 transitions.
Applied a total of 0 rules in 113 ms. Remains 982 /982 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2024-05-24 19:26:10] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2024-05-24 19:26:10] [INFO ] Invariant cache hit.
[2024-05-24 19:26:11] [INFO ] Implicit Places using invariants in 1263 ms returned [234]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1267 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 981/982 places, 4274/4274 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 980 transition count 4273
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 980 transition count 4273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 979 transition count 4272
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 979 transition count 4272
Applied a total of 4 rules in 198 ms. Remains 979 /981 variables (removed 2) and now considering 4272/4274 (removed 2) transitions.
[2024-05-24 19:26:11] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
// Phase 1: matrix 3875 rows 979 cols
[2024-05-24 19:26:11] [INFO ] Computed 49 invariants in 27 ms
[2024-05-24 19:26:12] [INFO ] Implicit Places using invariants in 1263 ms returned []
[2024-05-24 19:26:12] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:26:12] [INFO ] Invariant cache hit.
[2024-05-24 19:26:13] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2024-05-24 19:26:43] [INFO ] Performed 725/979 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:26:57] [INFO ] Implicit Places using invariants and state equation in 44353 ms returned []
Implicit Place search using SMT with State Equation took 45623 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 979/982 places, 4272/4274 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 47202 ms. Remains : 979/982 places, 4272/4274 transitions.
[2024-05-24 19:26:57] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:26:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21030 resets) in 17569 ms. (56 steps per ms)
BEST_FIRST walk for 1000001 steps (3014 resets) in 3276 ms. (305 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:27:17] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:27:17] [INFO ] Invariant cache hit.
[2024-05-24 19:27:18] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:27:18] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-24 19:27:19] [INFO ] [Real]Absence check using state equation in 881 ms returned sat
[2024-05-24 19:27:19] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2024-05-24 19:27:19] [INFO ] [Real]Added 2721 Read/Feed constraints in 200 ms returned sat
[2024-05-24 19:27:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:27:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:27:19] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 5 ms returned sat
[2024-05-24 19:27:20] [INFO ] [Nat]Absence check using state equation in 935 ms returned sat
[2024-05-24 19:27:21] [INFO ] [Nat]Added 2721 Read/Feed constraints in 1323 ms returned sat
[2024-05-24 19:27:22] [INFO ] Deduced a trap composed of 221 places in 499 ms of which 6 ms to minimize.
[2024-05-24 19:27:23] [INFO ] Deduced a trap composed of 84 places in 577 ms of which 5 ms to minimize.
[2024-05-24 19:27:23] [INFO ] Deduced a trap composed of 85 places in 613 ms of which 5 ms to minimize.
[2024-05-24 19:27:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2125 ms
[2024-05-24 19:27:24] [INFO ] Computed and/alt/rep : 1338/1928/1338 causal constraints (skipped 2475 transitions) in 221 ms.
[2024-05-24 19:27:24] [INFO ] Added : 18 causal constraints over 4 iterations in 969 ms. Result :sat
Minimization took 5093 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 121 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 979/979 places, 4272/4272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 123 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
[2024-05-24 19:27:30] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:27:30] [INFO ] Invariant cache hit.
[2024-05-24 19:27:31] [INFO ] Implicit Places using invariants in 1296 ms returned []
[2024-05-24 19:27:31] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:27:31] [INFO ] Invariant cache hit.
[2024-05-24 19:27:32] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2024-05-24 19:28:02] [INFO ] Performed 749/979 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:28:14] [INFO ] Implicit Places using invariants and state equation in 43390 ms returned []
Implicit Place search using SMT with State Equation took 44688 ms to find 0 implicit places.
[2024-05-24 19:28:15] [INFO ] Redundant transitions in 211 ms returned []
Running 4210 sub problems to find dead transitions.
[2024-05-24 19:28:15] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:28:15] [INFO ] Invariant cache hit.
[2024-05-24 19:28:15] [INFO ] State equation strengthened by 2721 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4210 unsolved
SMT process timed out in 63515ms, After SMT, problems are : Problem set: 0 solved, 4210 unsolved
Search for dead transitions found 0 dead transitions in 63559ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108603 ms. Remains : 979/979 places, 4272/4272 transitions.
[2024-05-24 19:29:18] [INFO ] Flatten gal took : 112 ms
[2024-05-24 19:29:18] [INFO ] Flatten gal took : 114 ms
[2024-05-24 19:29:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13938809455212380781.gal : 18 ms
[2024-05-24 19:29:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12428515505454661087.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13938809455212380781.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12428515505454661087.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (840 resets) in 1102 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (119 resets) in 263 ms. (151 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (118 resets) in 284 ms. (140 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12428515505454661087.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 42
Interrupted probabilistic random walk after 62698 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 62698 steps, saw 26458 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 19:29:22] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:29:22] [INFO ] Invariant cache hit.
[2024-05-24 19:29:22] [INFO ] State equation strengthened by 2721 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 43
At refinement iteration 3 (OVERLAPS) 18/901 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 53
[2024-05-24 19:29:23] [INFO ] Deduced a trap composed of 177 places in 590 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :53 after 69
[2024-05-24 19:29:23] [INFO ] Deduced a trap composed of 247 places in 587 ms of which 6 ms to minimize.
[2024-05-24 19:29:24] [INFO ] Deduced a trap composed of 137 places in 580 ms of which 5 ms to minimize.
[2024-05-24 19:29:24] [INFO ] Deduced a trap composed of 182 places in 596 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :69 after 92
[2024-05-24 19:29:25] [INFO ] Deduced a trap composed of 92 places in 583 ms of which 5 ms to minimize.
[2024-05-24 19:29:26] [INFO ] Deduced a trap composed of 129 places in 576 ms of which 5 ms to minimize.
[2024-05-24 19:29:26] [INFO ] Deduced a trap composed of 87 places in 589 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/935 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/963 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/963 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/979 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/979 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4854/4854 variables, and 1035 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 979/979 constraints, ReadFeed: 0/2721 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/901 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/935 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:29:28] [INFO ] Deduced a trap composed of 5 places in 458 ms of which 6 ms to minimize.
[2024-05-24 19:29:28] [INFO ] Deduced a trap composed of 46 places in 465 ms of which 6 ms to minimize.
[2024-05-24 19:29:28] [INFO ] Deduced a trap composed of 160 places in 461 ms of which 6 ms to minimize.
[2024-05-24 19:29:29] [INFO ] Deduced a trap composed of 151 places in 458 ms of which 6 ms to minimize.
[2024-05-24 19:29:29] [INFO ] Deduced a trap composed of 189 places in 460 ms of which 5 ms to minimize.
[2024-05-24 19:29:30] [INFO ] Deduced a trap composed of 153 places in 462 ms of which 5 ms to minimize.
[2024-05-24 19:29:30] [INFO ] Deduced a trap composed of 151 places in 464 ms of which 6 ms to minimize.
[2024-05-24 19:29:31] [INFO ] Deduced a trap composed of 152 places in 455 ms of which 5 ms to minimize.
[2024-05-24 19:29:31] [INFO ] Deduced a trap composed of 157 places in 472 ms of which 5 ms to minimize.
[2024-05-24 19:29:32] [INFO ] Deduced a trap composed of 140 places in 473 ms of which 7 ms to minimize.
SMT process timed out in 10062ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 127 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 979/979 places, 4272/4272 transitions.
RANDOM walk for 40000 steps (839 resets) in 1527 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (119 resets) in 291 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (119 resets) in 277 ms. (143 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 489
Interrupted probabilistic random walk after 62940 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 62940 steps, saw 26552 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 19:29:36] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:29:36] [INFO ] Invariant cache hit.
[2024-05-24 19:29:36] [INFO ] State equation strengthened by 2721 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/901 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:29:36] [INFO ] Deduced a trap composed of 177 places in 575 ms of which 6 ms to minimize.
[2024-05-24 19:29:37] [INFO ] Deduced a trap composed of 247 places in 570 ms of which 5 ms to minimize.
[2024-05-24 19:29:38] [INFO ] Deduced a trap composed of 137 places in 561 ms of which 6 ms to minimize.
[2024-05-24 19:29:38] [INFO ] Deduced a trap composed of 182 places in 571 ms of which 6 ms to minimize.
[2024-05-24 19:29:39] [INFO ] Deduced a trap composed of 92 places in 568 ms of which 6 ms to minimize.
[2024-05-24 19:29:39] [INFO ] Deduced a trap composed of 129 places in 568 ms of which 5 ms to minimize.
[2024-05-24 19:29:40] [INFO ] Deduced a trap composed of 87 places in 560 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/935 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/963 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/963 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/979 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/979 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3875/4854 variables, 979/1035 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4854 variables, 2721/3756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4854 variables, 0/3756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4854 variables, 0/3756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4854/4854 variables, and 3756 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5936 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 979/979 constraints, ReadFeed: 2721/2721 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/901 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/935 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:29:42] [INFO ] Deduced a trap composed of 5 places in 475 ms of which 6 ms to minimize.
[2024-05-24 19:29:43] [INFO ] Deduced a trap composed of 46 places in 485 ms of which 6 ms to minimize.
[2024-05-24 19:29:43] [INFO ] Deduced a trap composed of 160 places in 483 ms of which 6 ms to minimize.
[2024-05-24 19:29:44] [INFO ] Deduced a trap composed of 151 places in 467 ms of which 5 ms to minimize.
[2024-05-24 19:29:44] [INFO ] Deduced a trap composed of 189 places in 470 ms of which 5 ms to minimize.
[2024-05-24 19:29:45] [INFO ] Deduced a trap composed of 153 places in 491 ms of which 5 ms to minimize.
[2024-05-24 19:29:45] [INFO ] Deduced a trap composed of 151 places in 488 ms of which 6 ms to minimize.
[2024-05-24 19:29:46] [INFO ] Deduced a trap composed of 152 places in 474 ms of which 6 ms to minimize.
[2024-05-24 19:29:46] [INFO ] Deduced a trap composed of 157 places in 481 ms of which 6 ms to minimize.
[2024-05-24 19:29:47] [INFO ] Deduced a trap composed of 140 places in 479 ms of which 5 ms to minimize.
[2024-05-24 19:29:47] [INFO ] Deduced a trap composed of 141 places in 477 ms of which 6 ms to minimize.
[2024-05-24 19:29:48] [INFO ] Deduced a trap composed of 140 places in 470 ms of which 6 ms to minimize.
[2024-05-24 19:29:48] [INFO ] Deduced a trap composed of 150 places in 473 ms of which 6 ms to minimize.
[2024-05-24 19:29:49] [INFO ] Deduced a trap composed of 140 places in 487 ms of which 5 ms to minimize.
[2024-05-24 19:29:49] [INFO ] Deduced a trap composed of 139 places in 468 ms of which 6 ms to minimize.
[2024-05-24 19:29:50] [INFO ] Deduced a trap composed of 159 places in 474 ms of which 6 ms to minimize.
[2024-05-24 19:29:50] [INFO ] Deduced a trap composed of 173 places in 481 ms of which 6 ms to minimize.
[2024-05-24 19:29:51] [INFO ] Deduced a trap composed of 161 places in 475 ms of which 5 ms to minimize.
[2024-05-24 19:29:51] [INFO ] Deduced a trap composed of 197 places in 470 ms of which 6 ms to minimize.
[2024-05-24 19:29:52] [INFO ] Deduced a trap composed of 157 places in 478 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:29:52] [INFO ] Deduced a trap composed of 160 places in 491 ms of which 5 ms to minimize.
[2024-05-24 19:29:53] [INFO ] Deduced a trap composed of 148 places in 488 ms of which 5 ms to minimize.
[2024-05-24 19:29:53] [INFO ] Deduced a trap composed of 160 places in 480 ms of which 6 ms to minimize.
[2024-05-24 19:29:54] [INFO ] Deduced a trap composed of 46 places in 481 ms of which 6 ms to minimize.
[2024-05-24 19:29:54] [INFO ] Deduced a trap composed of 88 places in 487 ms of which 5 ms to minimize.
[2024-05-24 19:29:55] [INFO ] Deduced a trap composed of 71 places in 466 ms of which 5 ms to minimize.
[2024-05-24 19:29:55] [INFO ] Deduced a trap composed of 144 places in 476 ms of which 6 ms to minimize.
[2024-05-24 19:29:56] [INFO ] Deduced a trap composed of 205 places in 485 ms of which 6 ms to minimize.
[2024-05-24 19:29:56] [INFO ] Deduced a trap composed of 223 places in 470 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :489 after 1335
[2024-05-24 19:29:57] [INFO ] Deduced a trap composed of 208 places in 475 ms of which 6 ms to minimize.
[2024-05-24 19:29:57] [INFO ] Deduced a trap composed of 177 places in 472 ms of which 6 ms to minimize.
[2024-05-24 19:29:58] [INFO ] Deduced a trap composed of 182 places in 484 ms of which 6 ms to minimize.
[2024-05-24 19:29:58] [INFO ] Deduced a trap composed of 149 places in 472 ms of which 5 ms to minimize.
[2024-05-24 19:29:59] [INFO ] Deduced a trap composed of 155 places in 481 ms of which 6 ms to minimize.
[2024-05-24 19:29:59] [INFO ] Deduced a trap composed of 149 places in 470 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/935 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 28/963 variables, 28/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:30:00] [INFO ] Deduced a trap composed of 183 places in 535 ms of which 9 ms to minimize.
[2024-05-24 19:30:00] [INFO ] Deduced a trap composed of 72 places in 615 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/963 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/963 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 16/979 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/979 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3875/4854 variables, 979/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4854 variables, 2721/3793 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4854 variables, 2/3795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:30:04] [INFO ] Deduced a trap composed of 76 places in 652 ms of which 6 ms to minimize.
[2024-05-24 19:30:05] [INFO ] Deduced a trap composed of 420 places in 527 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4854 variables, 2/3797 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4854 variables, 0/3797 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/4854 variables, 0/3797 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4854/4854 variables, and 3797 constraints, problems are : Problem set: 0 solved, 2 unsolved in 23964 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 979/979 constraints, ReadFeed: 2721/2721 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 46/46 constraints]
After SMT, in 29937ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 121 ms.
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 118 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 979/979 places, 4272/4272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 119 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
[2024-05-24 19:30:06] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:30:06] [INFO ] Invariant cache hit.
[2024-05-24 19:30:07] [INFO ] Implicit Places using invariants in 1347 ms returned []
[2024-05-24 19:30:07] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:30:07] [INFO ] Invariant cache hit.
[2024-05-24 19:30:08] [INFO ] State equation strengthened by 2721 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-24 19:30:09] [INFO ] Flatten gal took : 107 ms
[2024-05-24 19:30:09] [INFO ] Applying decomposition
[2024-05-24 19:30:09] [INFO ] Flatten gal took : 109 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/graph5879464573506964208.txt' '-o' '/tmp/graph5879464573506964208.bin' '-w' '/tmp/graph5879464573506964208.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5879464573506964208.bin' '-l' '-1' '-v' '-w' '/tmp/graph5879464573506964208.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:30:09] [INFO ] Decomposing Gal with order
[2024-05-24 19:30:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:30:09] [INFO ] Removed a total of 8244 redundant transitions.
[2024-05-24 19:30:10] [INFO ] Flatten gal took : 439 ms
[2024-05-24 19:30:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2782 labels/synchronizations in 150 ms.
[2024-05-24 19:30:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15644505400526559573.gal : 25 ms
[2024-05-24 19:30:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10286414038842030607.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15644505400526559573.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10286414038842030607.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality10286414038842030607.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1382
[2024-05-24 19:30:38] [INFO ] Performed 806/979 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:30:50] [INFO ] Implicit Places using invariants and state equation in 42397 ms returned []
Implicit Place search using SMT with State Equation took 43748 ms to find 0 implicit places.
[2024-05-24 19:30:50] [INFO ] Redundant transitions in 214 ms returned []
Running 4210 sub problems to find dead transitions.
[2024-05-24 19:30:50] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:30:50] [INFO ] Invariant cache hit.
[2024-05-24 19:30:50] [INFO ] State equation strengthened by 2721 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4210 unsolved
SMT process timed out in 61164ms, After SMT, problems are : Problem set: 0 solved, 4210 unsolved
Search for dead transitions found 0 dead transitions in 61199ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105298 ms. Remains : 979/979 places, 4272/4272 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13 in 379886 ms.
[2024-05-24 19:31:51] [INFO ] Flatten gal took : 111 ms
[2024-05-24 19:31:51] [INFO ] Applying decomposition
[2024-05-24 19:31:51] [INFO ] Flatten gal took : 117 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/graph12480699922297148782.txt' '-o' '/tmp/graph12480699922297148782.bin' '-w' '/tmp/graph12480699922297148782.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12480699922297148782.bin' '-l' '-1' '-v' '-w' '/tmp/graph12480699922297148782.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:31:52] [INFO ] Decomposing Gal with order
[2024-05-24 19:31:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:31:52] [INFO ] Removed a total of 8296 redundant transitions.
[2024-05-24 19:31:52] [INFO ] Flatten gal took : 439 ms
[2024-05-24 19:31:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2713 labels/synchronizations in 150 ms.
[2024-05-24 19:31:52] [INFO ] Time to serialize gal into /tmp/UpperBounds6726557025158614486.gal : 27 ms
[2024-05-24 19:31:52] [INFO ] Time to serialize properties into /tmp/UpperBounds5076256708181858889.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6726557025158614486.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5076256708181858889.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds5076256708181858889.prop.
ITS-tools command line returned an error code 137
[2024-05-24 19:39:42] [INFO ] Flatten gal took : 128 ms
[2024-05-24 19:39:42] [INFO ] Time to serialize gal into /tmp/UpperBounds16863275356322519050.gal : 25 ms
[2024-05-24 19:39:42] [INFO ] Time to serialize properties into /tmp/UpperBounds961035717198530244.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16863275356322519050.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds961035717198530244.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds961035717198530244.prop.
ITS-tools command line returned an error code 137
[2024-05-24 19:46:42] [INFO ] Flatten gal took : 120 ms
[2024-05-24 19:46:42] [INFO ] Input system was already deterministic with 4278 transitions.
[2024-05-24 19:46:42] [INFO ] Transformed 984 places.
[2024-05-24 19:46:42] [INFO ] Transformed 4278 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 19:46:42] [INFO ] Time to serialize gal into /tmp/UpperBounds6404252179082663994.gal : 22 ms
[2024-05-24 19:46:42] [INFO ] Time to serialize properties into /tmp/UpperBounds78782205373383355.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6404252179082663994.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds78782205373383355.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...347
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds78782205373383355.prop.
ITS-tools command line returned an error code 137
Total runtime 3271343 ms.
BK_STOP 1716580501661
--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="MultiCrashLeafsetExtension-PT-S16C08"
export BK_EXAMINATION="UpperBounds"
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 MultiCrashLeafsetExtension-PT-S16C08, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654350800053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C08.tgz
mv MultiCrashLeafsetExtension-PT-S16C08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;