About the Execution of ITS-Tools for FunctionPointer-PT-c008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.027 | 3600000.00 | 4578443.00 | 9980.00 | ? ? 8 8 inf inf ? inf 0 0 ? 0 8 ? 8 ? | 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.r180-tall-171640603100293.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 FunctionPointer-PT-c008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603100293
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716481861196
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-23 16:31:02] [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-23 16:31:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 16:31:02] [INFO ] Load time of PNML (sax parser for PT used): 425 ms
[2024-05-23 16:31:02] [INFO ] Transformed 2826 places.
[2024-05-23 16:31:02] [INFO ] Transformed 8960 transitions.
[2024-05-23 16:31:02] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 586 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 1198 places in 46 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c008-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[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]
Current structural bounds on expressions (Before main loop) : Max Seen:[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]
[2024-05-23 16:31:03] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-23 16:31:03] [INFO ] Computed 4 invariants in 107 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
RANDOM walk for 10002 steps (2 resets) in 294 ms. (33 steps per ms)
BEST_FIRST walk for 130012 steps (29 resets) in 280 ms. (462 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 1, 1, 0, 1, 0, 5, 1, 1, 0, 2, 2] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
[2024-05-23 16:31:03] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2024-05-23 16:31:03] [INFO ] Invariant cache hit.
[2024-05-23 16:31:04] [INFO ] [Real]Absence check using 3 positive place invariants in 35 ms returned sat
[2024-05-23 16:31:04] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:31:05] [INFO ] [Real]Absence check using state equation in 824 ms returned sat
[2024-05-23 16:31:05] [INFO ] State equation strengthened by 479 read => feed constraints.
[2024-05-23 16:31:05] [INFO ] [Real]Added 479 Read/Feed constraints in 168 ms returned sat
[2024-05-23 16:31:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:31:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:05] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:31:06] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2024-05-23 16:31:06] [INFO ] [Nat]Added 479 Read/Feed constraints in 106 ms returned sat
[2024-05-23 16:31:07] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 727 ms.
[2024-05-23 16:31:07] [INFO ] Added : 2 causal constraints over 1 iterations in 1107 ms. Result :sat
Minimization took 591 ms.
[2024-05-23 16:31:08] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 16:31:09] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2024-05-23 16:31:09] [INFO ] [Real]Added 479 Read/Feed constraints in 167 ms returned sat
[2024-05-23 16:31:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:31:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:31:10] [INFO ] [Nat]Absence check using state equation in 704 ms returned sat
[2024-05-23 16:31:10] [INFO ] [Nat]Added 479 Read/Feed constraints in 100 ms returned sat
[2024-05-23 16:31:11] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 445 ms.
[2024-05-23 16:31:12] [INFO ] Deduced a trap composed of 142 places in 1198 ms of which 87 ms to minimize.
[2024-05-23 16:31:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1429 ms
[2024-05-23 16:31:13] [INFO ] Added : 2 causal constraints over 1 iterations in 2289 ms. Result :sat
Minimization took 580 ms.
[2024-05-23 16:31:13] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:31:14] [INFO ] [Real]Absence check using state equation in 753 ms returned sat
[2024-05-23 16:31:14] [INFO ] [Real]Added 479 Read/Feed constraints in 153 ms returned sat
[2024-05-23 16:31:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:31:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 16:31:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:31:15] [INFO ] [Nat]Absence check using state equation in 724 ms returned sat
[2024-05-23 16:31:16] [INFO ] [Nat]Added 479 Read/Feed constraints in 256 ms returned sat
[2024-05-23 16:31:16] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 413 ms.
[2024-05-23 16:31:17] [INFO ] Added : 1 causal constraints over 1 iterations in 739 ms. Result :sat
Minimization took 579 ms.
[2024-05-23 16:31:17] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 16:31:18] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2024-05-23 16:31:18] [INFO ] [Real]Added 479 Read/Feed constraints in 174 ms returned sat
[2024-05-23 16:31:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:31:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:31:19] [INFO ] [Nat]Absence check using state equation in 734 ms returned sat
[2024-05-23 16:31:19] [INFO ] [Nat]Added 479 Read/Feed constraints in 141 ms returned sat
[2024-05-23 16:31:21] [INFO ] Deduced a trap composed of 147 places in 1184 ms of which 12 ms to minimize.
[2024-05-23 16:31:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1363 ms
[2024-05-23 16:31:21] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 429 ms.
[2024-05-23 16:31:22] [INFO ] Added : 2 causal constraints over 1 iterations in 779 ms. Result :sat
Minimization took 579 ms.
[2024-05-23 16:31:22] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 16:31:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:31:23] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2024-05-23 16:31:23] [INFO ] [Real]Added 479 Read/Feed constraints in 181 ms returned sat
[2024-05-23 16:31:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:31:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2024-05-23 16:31:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:31:24] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2024-05-23 16:31:24] [INFO ] [Nat]Added 479 Read/Feed constraints in 125 ms returned sat
[2024-05-23 16:31:25] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 439 ms.
[2024-05-23 16:31:27] [INFO ] Deduced a trap composed of 142 places in 1173 ms of which 11 ms to minimize.
[2024-05-23 16:31:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1397 ms
[2024-05-23 16:31:27] [INFO ] Added : 2 causal constraints over 1 iterations in 2243 ms. Result :sat
Minimization took 577 ms.
[2024-05-23 16:31:28] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:31:28] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2024-05-23 16:31:29] [INFO ] [Real]Added 479 Read/Feed constraints in 188 ms returned sat
[2024-05-23 16:31:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:31:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:29] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 16:31:30] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2024-05-23 16:31:30] [INFO ] [Nat]Added 479 Read/Feed constraints in 114 ms returned sat
[2024-05-23 16:31:31] [INFO ] Deduced a trap composed of 142 places in 1065 ms of which 10 ms to minimize.
[2024-05-23 16:31:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1264 ms
[2024-05-23 16:31:31] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 415 ms.
[2024-05-23 16:31:32] [INFO ] Added : 2 causal constraints over 1 iterations in 722 ms. Result :sat
Minimization took 578 ms.
[2024-05-23 16:31:32] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 16:31:32] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:31:33] [INFO ] [Real]Absence check using state equation in 733 ms returned sat
[2024-05-23 16:31:33] [INFO ] [Real]Added 479 Read/Feed constraints in 134 ms returned sat
[2024-05-23 16:31:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:31:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:31:34] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2024-05-23 16:31:34] [INFO ] [Nat]Added 479 Read/Feed constraints in 112 ms returned sat
[2024-05-23 16:31:35] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 413 ms.
[2024-05-23 16:31:35] [INFO ] Added : 2 causal constraints over 1 iterations in 739 ms. Result :sat
Minimization took 577 ms.
[2024-05-23 16:31:36] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2024-05-23 16:31:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:31:37] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2024-05-23 16:31:37] [INFO ] [Real]Added 479 Read/Feed constraints in 162 ms returned sat
[2024-05-23 16:31:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:31:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:31:38] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2024-05-23 16:31:38] [INFO ] [Nat]Added 479 Read/Feed constraints in 243 ms returned sat
[2024-05-23 16:31:39] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 444 ms.
[2024-05-23 16:31:39] [INFO ] Added : 1 causal constraints over 1 iterations in 775 ms. Result :sat
Minimization took 578 ms.
[2024-05-23 16:31:40] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 16:31:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:31:41] [INFO ] [Real]Absence check using state equation in 737 ms returned sat
[2024-05-23 16:31:41] [INFO ] [Real]Added 479 Read/Feed constraints in 118 ms returned sat
[2024-05-23 16:31:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:31:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:31:42] [INFO ] [Nat]Absence check using state equation in 755 ms returned sat
[2024-05-23 16:31:42] [INFO ] [Nat]Added 479 Read/Feed constraints in 103 ms returned sat
[2024-05-23 16:31:42] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 414 ms.
[2024-05-23 16:31:43] [INFO ] Added : 2 causal constraints over 1 iterations in 741 ms. Result :sat
Minimization took 585 ms.
[2024-05-23 16:31:43] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:31:44] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2024-05-23 16:31:44] [INFO ] [Real]Added 479 Read/Feed constraints in 137 ms returned sat
[2024-05-23 16:31:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:31:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 16:31:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:31:45] [INFO ] [Nat]Absence check using state equation in 710 ms returned sat
[2024-05-23 16:31:46] [INFO ] [Nat]Added 479 Read/Feed constraints in 240 ms returned sat
[2024-05-23 16:31:46] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 400 ms.
[2024-05-23 16:31:46] [INFO ] Added : 1 causal constraints over 1 iterations in 723 ms. Result :sat
Minimization took 578 ms.
[2024-05-23 16:31:47] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 16:31:47] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:31:48] [INFO ] [Real]Absence check using state equation in 719 ms returned sat
[2024-05-23 16:31:48] [INFO ] [Real]Added 479 Read/Feed constraints in 169 ms returned sat
[2024-05-23 16:31:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:31:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:31:49] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2024-05-23 16:31:49] [INFO ] [Nat]Added 479 Read/Feed constraints in 212 ms returned sat
[2024-05-23 16:31:50] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 419 ms.
[2024-05-23 16:31:50] [INFO ] Added : 2 causal constraints over 1 iterations in 750 ms. Result :sat
Minimization took 580 ms.
[2024-05-23 16:31:51] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:51] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:31:52] [INFO ] [Real]Absence check using state equation in 746 ms returned sat
[2024-05-23 16:31:52] [INFO ] [Real]Added 479 Read/Feed constraints in 151 ms returned sat
[2024-05-23 16:31:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:31:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 16:31:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:31:53] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2024-05-23 16:31:53] [INFO ] [Nat]Added 479 Read/Feed constraints in 134 ms returned sat
[2024-05-23 16:31:54] [INFO ] Deduced a trap composed of 147 places in 1157 ms of which 11 ms to minimize.
[2024-05-23 16:31:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1327 ms
[2024-05-23 16:31:55] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 408 ms.
[2024-05-23 16:31:55] [INFO ] Added : 2 causal constraints over 1 iterations in 734 ms. Result :sat
Minimization took 577 ms.
[2024-05-23 16:31:56] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 16:31:57] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2024-05-23 16:31:57] [INFO ] [Real]Added 479 Read/Feed constraints in 139 ms returned sat
[2024-05-23 16:31:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:31:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 16:31:57] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:31:58] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2024-05-23 16:31:58] [INFO ] [Nat]Added 479 Read/Feed constraints in 119 ms returned sat
[2024-05-23 16:31:58] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 408 ms.
[2024-05-23 16:31:59] [INFO ] Added : 2 causal constraints over 1 iterations in 715 ms. Result :sat
Minimization took 577 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 1, 1, 0, 1, 0, 5, 1, 1, 0, 2, 2] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 1, 1, 0, 1, 0, 5, 1, 1, 0, 2, 2] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
Support contains 13 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1422 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.14 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 1422 transition count 5584
Discarding 297 places :
Symmetric choice reduction at 1 with 297 rule applications. Total rules 676 place count 1125 transition count 3340
Iterating global reduction 1 with 297 rules applied. Total rules applied 973 place count 1125 transition count 3340
Ensure Unique test removed 382 transitions
Reduce isomorphic transitions removed 382 transitions.
Iterating post reduction 1 with 382 rules applied. Total rules applied 1355 place count 1125 transition count 2958
Discarding 154 places :
Symmetric choice reduction at 2 with 154 rule applications. Total rules 1509 place count 971 transition count 2650
Iterating global reduction 2 with 154 rules applied. Total rules applied 1663 place count 971 transition count 2650
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 1739 place count 971 transition count 2574
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1753 place count 957 transition count 2546
Iterating global reduction 3 with 14 rules applied. Total rules applied 1767 place count 957 transition count 2546
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1780 place count 944 transition count 2520
Iterating global reduction 3 with 13 rules applied. Total rules applied 1793 place count 944 transition count 2520
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1806 place count 931 transition count 2494
Iterating global reduction 3 with 13 rules applied. Total rules applied 1819 place count 931 transition count 2494
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1832 place count 918 transition count 2468
Iterating global reduction 3 with 13 rules applied. Total rules applied 1845 place count 918 transition count 2468
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1858 place count 905 transition count 2442
Iterating global reduction 3 with 13 rules applied. Total rules applied 1871 place count 905 transition count 2442
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1884 place count 892 transition count 2416
Iterating global reduction 3 with 13 rules applied. Total rules applied 1897 place count 892 transition count 2416
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1908 place count 881 transition count 2394
Iterating global reduction 3 with 11 rules applied. Total rules applied 1919 place count 881 transition count 2394
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 1967 place count 833 transition count 2212
Iterating global reduction 3 with 48 rules applied. Total rules applied 2015 place count 833 transition count 2212
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2068 place count 780 transition count 2000
Iterating global reduction 3 with 53 rules applied. Total rules applied 2121 place count 780 transition count 2000
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2174 place count 727 transition count 1874
Iterating global reduction 3 with 53 rules applied. Total rules applied 2227 place count 727 transition count 1874
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2280 place count 674 transition count 1768
Iterating global reduction 3 with 53 rules applied. Total rules applied 2333 place count 674 transition count 1768
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2386 place count 621 transition count 1662
Iterating global reduction 3 with 53 rules applied. Total rules applied 2439 place count 621 transition count 1662
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2492 place count 568 transition count 1556
Iterating global reduction 3 with 53 rules applied. Total rules applied 2545 place count 568 transition count 1556
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2598 place count 515 transition count 1450
Iterating global reduction 3 with 53 rules applied. Total rules applied 2651 place count 515 transition count 1450
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2661 place count 505 transition count 1430
Iterating global reduction 3 with 10 rules applied. Total rules applied 2671 place count 505 transition count 1430
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 2693 place count 505 transition count 1408
Applied a total of 2693 rules in 1723 ms. Remains 505 /1628 variables (removed 1123) and now considering 1408/5962 (removed 4554) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1736 ms. Remains : 505/1628 places, 1408/5962 transitions.
[2024-05-23 16:32:01] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
Found an invariant !
This invariant on transitions {209=1, 374=1, 711=1, 811=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {253=1, 418=1, 627=1, 807=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :[0, 0, 0, 1, 3, 3, 0, 4, 4, 1, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 1, 1, 3, 3, 0, 5, 4, 1, 0, 2, 2] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
[2024-05-23 16:32:01] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
// Phase 1: matrix 823 rows 505 cols
[2024-05-23 16:32:01] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 1, 1, 3, 3, 0, 5, 4, 1, 0, 2, 2] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2426 ms. (412 steps per ms)
FORMULA FunctionPointer-PT-c008-UpperBounds-03 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 12000011 steps (24 resets) in 7980 ms. (1503 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 3, 1, 68, 99, 4, 7, 5, 1, 5, 2, 13] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
[2024-05-23 16:32:12] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:32:12] [INFO ] Invariant cache hit.
[2024-05-23 16:32:12] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:12] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 16:32:12] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-23 16:32:12] [INFO ] [Real]Added 106 Read/Feed constraints in 29 ms returned sat
[2024-05-23 16:32:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:12] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 16:32:12] [INFO ] [Nat]Added 106 Read/Feed constraints in 42 ms returned sat
[2024-05-23 16:32:13] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 79 ms.
[2024-05-23 16:32:13] [INFO ] Added : 2 causal constraints over 1 iterations in 177 ms. Result :sat
Minimization took 446 ms.
[2024-05-23 16:32:13] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:13] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-23 16:32:13] [INFO ] [Real]Added 106 Read/Feed constraints in 34 ms returned sat
[2024-05-23 16:32:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:14] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 16:32:14] [INFO ] [Nat]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-23 16:32:14] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:32:14] [INFO ] Added : 2 causal constraints over 1 iterations in 174 ms. Result :sat
Minimization took 441 ms.
[2024-05-23 16:32:14] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:15] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-23 16:32:15] [INFO ] [Real]Added 106 Read/Feed constraints in 36 ms returned sat
[2024-05-23 16:32:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:15] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-23 16:32:15] [INFO ] [Nat]Added 106 Read/Feed constraints in 70 ms returned sat
[2024-05-23 16:32:15] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 79 ms.
[2024-05-23 16:32:15] [INFO ] Added : 1 causal constraints over 1 iterations in 185 ms. Result :sat
Minimization took 452 ms.
[2024-05-23 16:32:16] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:16] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-23 16:32:16] [INFO ] [Real]Added 106 Read/Feed constraints in 44 ms returned sat
[2024-05-23 16:32:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:16] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-23 16:32:16] [INFO ] [Nat]Added 106 Read/Feed constraints in 28 ms returned sat
[2024-05-23 16:32:16] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-23 16:32:16] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 445 ms.
[2024-05-23 16:32:17] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:17] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 16:32:17] [INFO ] [Real]Added 106 Read/Feed constraints in 44 ms returned sat
[2024-05-23 16:32:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:17] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 16:32:17] [INFO ] [Nat]Added 106 Read/Feed constraints in 38 ms returned sat
[2024-05-23 16:32:18] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-23 16:32:18] [INFO ] Added : 2 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 445 ms.
[2024-05-23 16:32:18] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:18] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 16:32:18] [INFO ] [Real]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:32:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:19] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 16:32:19] [INFO ] [Nat]Added 106 Read/Feed constraints in 34 ms returned sat
[2024-05-23 16:32:19] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-23 16:32:19] [INFO ] Added : 2 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 440 ms.
[2024-05-23 16:32:19] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 16:32:20] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 16:32:20] [INFO ] [Real]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-23 16:32:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:20] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 16:32:20] [INFO ] [Nat]Added 106 Read/Feed constraints in 59 ms returned sat
[2024-05-23 16:32:20] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:32:20] [INFO ] Added : 1 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 450 ms.
[2024-05-23 16:32:21] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2024-05-23 16:32:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:21] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 16:32:21] [INFO ] [Real]Added 106 Read/Feed constraints in 31 ms returned sat
[2024-05-23 16:32:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:21] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 16:32:21] [INFO ] [Nat]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-23 16:32:21] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-23 16:32:21] [INFO ] Added : 2 causal constraints over 1 iterations in 176 ms. Result :sat
Minimization took 446 ms.
[2024-05-23 16:32:22] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:22] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 16:32:22] [INFO ] [Real]Added 106 Read/Feed constraints in 36 ms returned sat
[2024-05-23 16:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:22] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:32:22] [INFO ] [Nat]Added 106 Read/Feed constraints in 65 ms returned sat
[2024-05-23 16:32:23] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 75 ms.
[2024-05-23 16:32:23] [INFO ] Added : 1 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 449 ms.
[2024-05-23 16:32:23] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:23] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-23 16:32:23] [INFO ] [Real]Added 106 Read/Feed constraints in 34 ms returned sat
[2024-05-23 16:32:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:24] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-23 16:32:24] [INFO ] [Nat]Added 106 Read/Feed constraints in 48 ms returned sat
[2024-05-23 16:32:24] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-23 16:32:24] [INFO ] Added : 2 causal constraints over 1 iterations in 179 ms. Result :sat
Minimization took 461 ms.
[2024-05-23 16:32:25] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:25] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2024-05-23 16:32:25] [INFO ] [Real]Added 106 Read/Feed constraints in 39 ms returned sat
[2024-05-23 16:32:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:25] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-05-23 16:32:25] [INFO ] [Nat]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-23 16:32:25] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 75 ms.
[2024-05-23 16:32:25] [INFO ] Added : 1 causal constraints over 1 iterations in 178 ms. Result :sat
Minimization took 461 ms.
[2024-05-23 16:32:26] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:26] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-23 16:32:26] [INFO ] [Real]Added 106 Read/Feed constraints in 36 ms returned sat
[2024-05-23 16:32:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:26] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 16:32:26] [INFO ] [Nat]Added 106 Read/Feed constraints in 36 ms returned sat
[2024-05-23 16:32:27] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 75 ms.
[2024-05-23 16:32:27] [INFO ] Added : 2 causal constraints over 1 iterations in 181 ms. Result :sat
Minimization took 445 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 3, 1, 68, 99, 4, 7, 5, 1, 5, 2, 13] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 3, 1, 68, 99, 4, 7, 5, 1, 7, 6, 13] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
Support contains 12 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 66 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 505/505 places, 1408/1408 transitions.
[2024-05-23 16:32:27] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
Found an invariant !
This invariant on transitions {209=1, 374=1, 711=1, 811=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {253=1, 418=1, 627=1, 807=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :[2, 0, 1, 0, 1, 3, 2, 2, 0, 1, 0, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[6, 3, 1, 68, 99, 4, 7, 5, 1, 7, 6, 13] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
[2024-05-23 16:32:28] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:32:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 3, 1, 68, 99, 4, 7, 5, 1, 7, 6, 13] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2394 ms. (417 steps per ms)
BEST_FIRST walk for 12000011 steps (24 resets) in 7977 ms. (1504 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 5, 1, 109, 159, 4, 95, 5, 1, 7, 6, 213] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
[2024-05-23 16:32:38] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:32:38] [INFO ] Invariant cache hit.
[2024-05-23 16:32:38] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:38] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 16:32:38] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-23 16:32:38] [INFO ] [Real]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-23 16:32:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:39] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:32:39] [INFO ] [Nat]Added 106 Read/Feed constraints in 45 ms returned sat
[2024-05-23 16:32:39] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 75 ms.
[2024-05-23 16:32:39] [INFO ] Added : 2 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 451 ms.
[2024-05-23 16:32:39] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:40] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-23 16:32:40] [INFO ] [Real]Added 106 Read/Feed constraints in 38 ms returned sat
[2024-05-23 16:32:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:40] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 16:32:40] [INFO ] [Nat]Added 106 Read/Feed constraints in 39 ms returned sat
[2024-05-23 16:32:40] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:32:40] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 446 ms.
[2024-05-23 16:32:41] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:41] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-23 16:32:41] [INFO ] [Real]Added 106 Read/Feed constraints in 35 ms returned sat
[2024-05-23 16:32:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:41] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-23 16:32:41] [INFO ] [Nat]Added 106 Read/Feed constraints in 72 ms returned sat
[2024-05-23 16:32:41] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 80 ms.
[2024-05-23 16:32:41] [INFO ] Added : 1 causal constraints over 1 iterations in 178 ms. Result :sat
Minimization took 463 ms.
[2024-05-23 16:32:42] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 16:32:42] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 16:32:42] [INFO ] [Real]Added 106 Read/Feed constraints in 40 ms returned sat
[2024-05-23 16:32:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:42] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:32:42] [INFO ] [Nat]Added 106 Read/Feed constraints in 28 ms returned sat
[2024-05-23 16:32:43] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 75 ms.
[2024-05-23 16:32:43] [INFO ] Added : 2 causal constraints over 1 iterations in 177 ms. Result :sat
Minimization took 448 ms.
[2024-05-23 16:32:43] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:43] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:32:43] [INFO ] [Real]Added 106 Read/Feed constraints in 44 ms returned sat
[2024-05-23 16:32:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:44] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 16:32:44] [INFO ] [Nat]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:32:44] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-23 16:32:44] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 441 ms.
[2024-05-23 16:32:44] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:45] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 16:32:45] [INFO ] [Real]Added 106 Read/Feed constraints in 31 ms returned sat
[2024-05-23 16:32:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:45] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-23 16:32:45] [INFO ] [Nat]Added 106 Read/Feed constraints in 27 ms returned sat
[2024-05-23 16:32:45] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:32:45] [INFO ] Added : 2 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 447 ms.
[2024-05-23 16:32:46] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:46] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 16:32:46] [INFO ] [Real]Added 106 Read/Feed constraints in 55 ms returned sat
[2024-05-23 16:32:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 16:32:46] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:32:46] [INFO ] [Nat]Added 106 Read/Feed constraints in 47 ms returned sat
[2024-05-23 16:32:46] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 77 ms.
[2024-05-23 16:32:46] [INFO ] Added : 1 causal constraints over 1 iterations in 182 ms. Result :sat
Minimization took 450 ms.
[2024-05-23 16:32:47] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 16:32:47] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-23 16:32:47] [INFO ] [Real]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:32:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:47] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 16:32:48] [INFO ] [Nat]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:32:48] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-23 16:32:48] [INFO ] Added : 2 causal constraints over 1 iterations in 177 ms. Result :sat
Minimization took 448 ms.
[2024-05-23 16:32:48] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:48] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 16:32:48] [INFO ] [Real]Added 106 Read/Feed constraints in 36 ms returned sat
[2024-05-23 16:32:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:49] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 16:32:49] [INFO ] [Nat]Added 106 Read/Feed constraints in 65 ms returned sat
[2024-05-23 16:32:49] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:32:49] [INFO ] Added : 1 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 447 ms.
[2024-05-23 16:32:50] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:32:50] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 16:32:50] [INFO ] [Real]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-23 16:32:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:32:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:50] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 16:32:50] [INFO ] [Nat]Added 106 Read/Feed constraints in 48 ms returned sat
[2024-05-23 16:32:50] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-23 16:32:50] [INFO ] Added : 2 causal constraints over 1 iterations in 177 ms. Result :sat
Minimization took 462 ms.
[2024-05-23 16:32:51] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 16:32:51] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2024-05-23 16:32:51] [INFO ] [Real]Added 106 Read/Feed constraints in 40 ms returned sat
[2024-05-23 16:32:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:51] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2024-05-23 16:32:51] [INFO ] [Nat]Added 106 Read/Feed constraints in 54 ms returned sat
[2024-05-23 16:32:52] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 76 ms.
[2024-05-23 16:32:52] [INFO ] Added : 1 causal constraints over 1 iterations in 181 ms. Result :sat
Minimization took 455 ms.
[2024-05-23 16:32:52] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:32:52] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 16:32:52] [INFO ] [Real]Added 106 Read/Feed constraints in 35 ms returned sat
[2024-05-23 16:32:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:32:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:32:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 16:32:53] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-23 16:32:53] [INFO ] [Nat]Added 106 Read/Feed constraints in 36 ms returned sat
[2024-05-23 16:32:53] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-23 16:32:53] [INFO ] Added : 2 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 444 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 5, 1, 109, 159, 4, 95, 5, 1, 7, 6, 213] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 5, 1, 109, 159, 4, 95, 5, 1, 7, 6, 213] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
Support contains 12 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 57 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 505/505 places, 1408/1408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 55 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
[2024-05-23 16:32:54] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:32:54] [INFO ] Invariant cache hit.
[2024-05-23 16:32:54] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-23 16:32:54] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:32:54] [INFO ] Invariant cache hit.
[2024-05-23 16:32:54] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-23 16:32:55] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 1937 ms to find 0 implicit places.
[2024-05-23 16:32:56] [INFO ] Redundant transitions in 91 ms returned []
Running 1406 sub problems to find dead transitions.
[2024-05-23 16:32:56] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:32:56] [INFO ] Invariant cache hit.
[2024-05-23 16:32:56] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 3 (OVERLAPS) 823/1328 variables, 505/507 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
SMT process timed out in 35153ms, After SMT, problems are : Problem set: 0 solved, 1406 unsolved
Search for dead transitions found 0 dead transitions in 35182ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37297 ms. Remains : 505/505 places, 1408/1408 transitions.
[2024-05-23 16:33:31] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
Found an invariant !
This invariant on transitions {209=1, 374=1, 711=1, 811=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {253=1, 418=1, 627=1, 807=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :[0, 0, 1, 2, 1, 2, 3, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[6, 5, 1, 109, 159, 4, 95, 5, 1, 7, 6, 213] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
[2024-05-23 16:33:31] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:33:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 5, 1, 109, 159, 4, 95, 5, 1, 7, 6, 213] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
RANDOM walk for 1000001 steps (2 resets) in 2444 ms. (408 steps per ms)
BEST_FIRST walk for 12000011 steps (24 resets) in 8325 ms. (1441 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 76, 1, 134, 159, 5, 116, 5, 7, 7, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
[2024-05-23 16:33:42] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:33:42] [INFO ] Invariant cache hit.
[2024-05-23 16:33:42] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:33:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:33:42] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-23 16:33:42] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-23 16:33:42] [INFO ] [Real]Added 106 Read/Feed constraints in 34 ms returned sat
[2024-05-23 16:33:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:33:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:33:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:33:42] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 16:33:42] [INFO ] [Nat]Added 106 Read/Feed constraints in 42 ms returned sat
[2024-05-23 16:33:43] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 105 ms.
[2024-05-23 16:33:43] [INFO ] Added : 2 causal constraints over 1 iterations in 199 ms. Result :sat
Minimization took 455 ms.
[2024-05-23 16:33:43] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:33:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:33:43] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 16:33:43] [INFO ] [Real]Added 106 Read/Feed constraints in 47 ms returned sat
[2024-05-23 16:33:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:33:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:33:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:33:44] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-23 16:33:44] [INFO ] [Nat]Added 106 Read/Feed constraints in 40 ms returned sat
[2024-05-23 16:33:44] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 75 ms.
[2024-05-23 16:33:44] [INFO ] Added : 2 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 440 ms.
[2024-05-23 16:33:44] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:33:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:33:45] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 16:33:45] [INFO ] [Real]Added 106 Read/Feed constraints in 35 ms returned sat
[2024-05-23 16:33:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:33:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:33:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:33:45] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-23 16:33:45] [INFO ] [Nat]Added 106 Read/Feed constraints in 72 ms returned sat
[2024-05-23 16:33:45] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:33:45] [INFO ] Added : 1 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 447 ms.
[2024-05-23 16:33:46] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:33:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:33:46] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 16:33:46] [INFO ] [Real]Added 106 Read/Feed constraints in 49 ms returned sat
[2024-05-23 16:33:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:33:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:33:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:33:46] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 16:33:46] [INFO ] [Nat]Added 106 Read/Feed constraints in 28 ms returned sat
[2024-05-23 16:33:46] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:33:46] [INFO ] Added : 2 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 444 ms.
[2024-05-23 16:33:47] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:33:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-23 16:33:47] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 16:33:47] [INFO ] [Real]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-23 16:33:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:33:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:33:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:33:48] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-23 16:33:48] [INFO ] [Nat]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:33:48] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:33:48] [INFO ] Added : 2 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 441 ms.
[2024-05-23 16:33:48] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:33:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:33:48] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-23 16:33:48] [INFO ] [Real]Added 106 Read/Feed constraints in 30 ms returned sat
[2024-05-23 16:33:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:33:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:33:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:33:49] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 16:33:49] [INFO ] [Nat]Added 106 Read/Feed constraints in 26 ms returned sat
[2024-05-23 16:33:49] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-23 16:33:49] [INFO ] Added : 2 causal constraints over 1 iterations in 183 ms. Result :sat
Minimization took 445 ms.
[2024-05-23 16:33:50] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:33:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:33:50] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 16:33:50] [INFO ] [Real]Added 106 Read/Feed constraints in 55 ms returned sat
[2024-05-23 16:33:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:33:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:33:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:33:50] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 16:33:50] [INFO ] [Nat]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-23 16:33:50] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-23 16:33:50] [INFO ] Added : 1 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 453 ms.
[2024-05-23 16:33:51] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:33:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:33:51] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 16:33:51] [INFO ] [Real]Added 106 Read/Feed constraints in 29 ms returned sat
[2024-05-23 16:33:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:33:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:33:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:33:51] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:33:51] [INFO ] [Nat]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:33:51] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:33:51] [INFO ] Added : 2 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 442 ms.
[2024-05-23 16:33:52] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:33:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:33:52] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:33:52] [INFO ] [Real]Added 106 Read/Feed constraints in 30 ms returned sat
[2024-05-23 16:33:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:33:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:33:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:33:52] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 16:33:53] [INFO ] [Nat]Added 106 Read/Feed constraints in 58 ms returned sat
[2024-05-23 16:33:53] [INFO ] Deduced a trap composed of 135 places in 202 ms of which 3 ms to minimize.
[2024-05-23 16:33:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2024-05-23 16:33:53] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 77 ms.
[2024-05-23 16:33:53] [INFO ] Added : 1 causal constraints over 1 iterations in 184 ms. Result :sat
Minimization took 455 ms.
[2024-05-23 16:33:54] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:33:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:33:54] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 16:33:54] [INFO ] [Real]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-23 16:33:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:33:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:33:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:33:54] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-23 16:33:54] [INFO ] [Nat]Added 106 Read/Feed constraints in 50 ms returned sat
[2024-05-23 16:33:54] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:33:54] [INFO ] Added : 2 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 460 ms.
[2024-05-23 16:33:55] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:33:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:33:55] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-05-23 16:33:55] [INFO ] [Real]Added 106 Read/Feed constraints in 42 ms returned sat
[2024-05-23 16:33:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:33:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:33:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:33:55] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-05-23 16:33:55] [INFO ] [Nat]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-23 16:33:55] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-23 16:33:56] [INFO ] Added : 1 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 458 ms.
[2024-05-23 16:33:56] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:33:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:33:56] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-23 16:33:56] [INFO ] [Real]Added 106 Read/Feed constraints in 35 ms returned sat
[2024-05-23 16:33:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:33:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2024-05-23 16:33:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:33:57] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 16:33:57] [INFO ] [Nat]Added 106 Read/Feed constraints in 35 ms returned sat
[2024-05-23 16:33:57] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-23 16:33:57] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 442 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 76, 1, 134, 159, 5, 116, 5, 7, 7, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
FORMULA FunctionPointer-PT-c008-UpperBounds-12 8 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 76, 1, 134, 159, 5, 116, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
Support contains 11 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 60 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 505/505 places, 1408/1408 transitions.
[2024-05-23 16:33:57] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
Found an invariant !
This invariant on transitions {209=1, 374=1, 711=1, 811=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {253=1, 418=1, 627=1, 807=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :[0, 0, 1, 1, 2, 1, 5, 0, 0, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[6, 76, 1, 134, 159, 5, 116, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
[2024-05-23 16:33:58] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:33:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 76, 1, 134, 159, 5, 116, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2243 ms. (445 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 7295 ms. (1507 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[169, 76, 1, 134, 191, 5, 116, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
[2024-05-23 16:34:07] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:34:07] [INFO ] Invariant cache hit.
[2024-05-23 16:34:07] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:34:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:34:08] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:34:08] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-23 16:34:08] [INFO ] [Real]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-23 16:34:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:34:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:34:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:34:08] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 16:34:08] [INFO ] [Nat]Added 106 Read/Feed constraints in 41 ms returned sat
[2024-05-23 16:34:08] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:34:08] [INFO ] Added : 2 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 448 ms.
[2024-05-23 16:34:09] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:34:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:34:09] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 16:34:09] [INFO ] [Real]Added 106 Read/Feed constraints in 47 ms returned sat
[2024-05-23 16:34:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:34:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:34:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:34:09] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 16:34:09] [INFO ] [Nat]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-23 16:34:09] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-23 16:34:09] [INFO ] Added : 2 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 443 ms.
[2024-05-23 16:34:10] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:34:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:34:10] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-23 16:34:10] [INFO ] [Real]Added 106 Read/Feed constraints in 37 ms returned sat
[2024-05-23 16:34:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:34:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:34:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:34:10] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:34:10] [INFO ] [Nat]Added 106 Read/Feed constraints in 72 ms returned sat
[2024-05-23 16:34:11] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 75 ms.
[2024-05-23 16:34:11] [INFO ] Added : 1 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 445 ms.
[2024-05-23 16:34:11] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:34:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:34:11] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-23 16:34:11] [INFO ] [Real]Added 106 Read/Feed constraints in 43 ms returned sat
[2024-05-23 16:34:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:34:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:34:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:34:12] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 16:34:12] [INFO ] [Nat]Added 106 Read/Feed constraints in 30 ms returned sat
[2024-05-23 16:34:12] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-23 16:34:12] [INFO ] Added : 2 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 444 ms.
[2024-05-23 16:34:12] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:34:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:34:13] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-23 16:34:13] [INFO ] [Real]Added 106 Read/Feed constraints in 45 ms returned sat
[2024-05-23 16:34:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:34:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:34:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:34:13] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 16:34:13] [INFO ] [Nat]Added 106 Read/Feed constraints in 31 ms returned sat
[2024-05-23 16:34:13] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-23 16:34:13] [INFO ] Added : 2 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 441 ms.
[2024-05-23 16:34:14] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:34:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:34:14] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 16:34:14] [INFO ] [Real]Added 106 Read/Feed constraints in 36 ms returned sat
[2024-05-23 16:34:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:34:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:34:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:34:14] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:34:14] [INFO ] [Nat]Added 106 Read/Feed constraints in 28 ms returned sat
[2024-05-23 16:34:14] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-23 16:34:14] [INFO ] Added : 2 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 451 ms.
[2024-05-23 16:34:15] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:34:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:34:15] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-23 16:34:15] [INFO ] [Real]Added 106 Read/Feed constraints in 56 ms returned sat
[2024-05-23 16:34:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:34:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:34:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:34:15] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-23 16:34:15] [INFO ] [Nat]Added 106 Read/Feed constraints in 70 ms returned sat
[2024-05-23 16:34:16] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 109 ms.
[2024-05-23 16:34:16] [INFO ] Added : 1 causal constraints over 1 iterations in 214 ms. Result :sat
Minimization took 438 ms.
[2024-05-23 16:34:16] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:34:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:34:16] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 16:34:16] [INFO ] [Real]Added 106 Read/Feed constraints in 30 ms returned sat
[2024-05-23 16:34:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:34:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:34:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:34:17] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 16:34:17] [INFO ] [Nat]Added 106 Read/Feed constraints in 36 ms returned sat
[2024-05-23 16:34:17] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-23 16:34:17] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 440 ms.
[2024-05-23 16:34:17] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:34:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:34:18] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 16:34:18] [INFO ] [Real]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:34:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:34:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:34:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:34:18] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 16:34:18] [INFO ] [Nat]Added 106 Read/Feed constraints in 61 ms returned sat
[2024-05-23 16:34:18] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 3 ms to minimize.
[2024-05-23 16:34:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2024-05-23 16:34:18] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-23 16:34:18] [INFO ] Added : 1 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 453 ms.
[2024-05-23 16:34:19] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:34:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 16:34:19] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-05-23 16:34:19] [INFO ] [Real]Added 106 Read/Feed constraints in 41 ms returned sat
[2024-05-23 16:34:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:34:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:34:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:34:19] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2024-05-23 16:34:19] [INFO ] [Nat]Added 106 Read/Feed constraints in 52 ms returned sat
[2024-05-23 16:34:20] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:34:20] [INFO ] Added : 1 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 447 ms.
[2024-05-23 16:34:20] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:34:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:34:20] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-23 16:34:20] [INFO ] [Real]Added 106 Read/Feed constraints in 35 ms returned sat
[2024-05-23 16:34:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:34:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:34:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:34:21] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-23 16:34:21] [INFO ] [Nat]Added 106 Read/Feed constraints in 44 ms returned sat
[2024-05-23 16:34:21] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-23 16:34:21] [INFO ] Added : 2 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 443 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[169, 76, 1, 134, 191, 5, 116, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[169, 76, 1, 134, 191, 5, 116, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
Support contains 11 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 52 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 505/505 places, 1408/1408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 51 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
[2024-05-23 16:34:22] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:34:22] [INFO ] Invariant cache hit.
[2024-05-23 16:34:22] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-23 16:34:22] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:34:22] [INFO ] Invariant cache hit.
[2024-05-23 16:34:22] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-23 16:34:23] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 1886 ms to find 0 implicit places.
[2024-05-23 16:34:23] [INFO ] Redundant transitions in 32 ms returned []
Running 1406 sub problems to find dead transitions.
[2024-05-23 16:34:23] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:34:23] [INFO ] Invariant cache hit.
[2024-05-23 16:34:23] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 823/1328 variables, 505/507 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
SMT process timed out in 34778ms, After SMT, problems are : Problem set: 0 solved, 1406 unsolved
Search for dead transitions found 0 dead transitions in 34791ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36771 ms. Remains : 505/505 places, 1408/1408 transitions.
[2024-05-23 16:34:58] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
Found an invariant !
This invariant on transitions {209=1, 374=1, 711=1, 811=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {253=1, 418=1, 627=1, 807=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :[0, 0, 1, 2, 2, 2, 2, 3, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[169, 76, 1, 134, 191, 5, 116, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
[2024-05-23 16:34:59] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:34:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[169, 76, 1, 134, 191, 5, 116, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2367 ms. (422 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 7603 ms. (1446 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[169, 76, 1, 134, 198, 81, 116, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
[2024-05-23 16:35:09] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:35:09] [INFO ] Invariant cache hit.
[2024-05-23 16:35:09] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:35:09] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-05-23 16:35:09] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-23 16:35:09] [INFO ] [Real]Added 106 Read/Feed constraints in 47 ms returned sat
[2024-05-23 16:35:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:35:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:35:09] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:35:09] [INFO ] [Nat]Added 106 Read/Feed constraints in 42 ms returned sat
[2024-05-23 16:35:09] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-23 16:35:09] [INFO ] Added : 2 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 454 ms.
[2024-05-23 16:35:10] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:35:10] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-23 16:35:10] [INFO ] [Real]Added 106 Read/Feed constraints in 47 ms returned sat
[2024-05-23 16:35:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:35:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:35:10] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:35:10] [INFO ] [Nat]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-23 16:35:11] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 76 ms.
[2024-05-23 16:35:11] [INFO ] Added : 2 causal constraints over 1 iterations in 174 ms. Result :sat
Minimization took 450 ms.
[2024-05-23 16:35:11] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:35:11] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-23 16:35:11] [INFO ] [Real]Added 106 Read/Feed constraints in 38 ms returned sat
[2024-05-23 16:35:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:35:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:35:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:35:12] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-23 16:35:12] [INFO ] [Nat]Added 106 Read/Feed constraints in 73 ms returned sat
[2024-05-23 16:35:12] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-23 16:35:12] [INFO ] Added : 1 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 455 ms.
[2024-05-23 16:35:12] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:35:13] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 16:35:13] [INFO ] [Real]Added 106 Read/Feed constraints in 47 ms returned sat
[2024-05-23 16:35:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:35:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:35:13] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:35:13] [INFO ] [Nat]Added 106 Read/Feed constraints in 28 ms returned sat
[2024-05-23 16:35:13] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:35:13] [INFO ] Added : 2 causal constraints over 1 iterations in 178 ms. Result :sat
Minimization took 443 ms.
[2024-05-23 16:35:14] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:35:14] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:35:14] [INFO ] [Real]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-23 16:35:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:35:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:35:14] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 16:35:14] [INFO ] [Nat]Added 106 Read/Feed constraints in 40 ms returned sat
[2024-05-23 16:35:14] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 75 ms.
[2024-05-23 16:35:14] [INFO ] Added : 2 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 457 ms.
[2024-05-23 16:35:15] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:35:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:35:15] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:35:15] [INFO ] [Real]Added 106 Read/Feed constraints in 49 ms returned sat
[2024-05-23 16:35:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:35:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:35:16] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-23 16:35:16] [INFO ] [Nat]Added 106 Read/Feed constraints in 26 ms returned sat
[2024-05-23 16:35:16] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-23 16:35:16] [INFO ] Added : 2 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 449 ms.
[2024-05-23 16:35:16] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:35:16] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:35:17] [INFO ] [Real]Added 106 Read/Feed constraints in 55 ms returned sat
[2024-05-23 16:35:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:35:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:35:17] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 16:35:17] [INFO ] [Nat]Added 106 Read/Feed constraints in 54 ms returned sat
[2024-05-23 16:35:17] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 75 ms.
[2024-05-23 16:35:17] [INFO ] Added : 1 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 443 ms.
[2024-05-23 16:35:18] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:35:18] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-05-23 16:35:18] [INFO ] [Real]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:35:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:35:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:35:18] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:35:18] [INFO ] [Nat]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:35:18] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-23 16:35:18] [INFO ] Added : 2 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 456 ms.
[2024-05-23 16:35:19] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:35:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:35:19] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-23 16:35:19] [INFO ] [Real]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-23 16:35:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:35:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:35:19] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-23 16:35:19] [INFO ] [Nat]Added 106 Read/Feed constraints in 59 ms returned sat
[2024-05-23 16:35:20] [INFO ] Deduced a trap composed of 131 places in 205 ms of which 3 ms to minimize.
[2024-05-23 16:35:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2024-05-23 16:35:20] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-23 16:35:20] [INFO ] Added : 1 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 456 ms.
[2024-05-23 16:35:20] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:35:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:35:21] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2024-05-23 16:35:21] [INFO ] [Real]Added 106 Read/Feed constraints in 41 ms returned sat
[2024-05-23 16:35:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:35:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:35:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-23 16:35:21] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-05-23 16:35:21] [INFO ] [Nat]Added 106 Read/Feed constraints in 45 ms returned sat
[2024-05-23 16:35:21] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 75 ms.
[2024-05-23 16:35:21] [INFO ] Added : 1 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 453 ms.
[2024-05-23 16:35:22] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:35:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:35:22] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-23 16:35:22] [INFO ] [Real]Added 106 Read/Feed constraints in 35 ms returned sat
[2024-05-23 16:35:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:35:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 15 ms returned sat
[2024-05-23 16:35:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:35:22] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-23 16:35:22] [INFO ] [Nat]Added 106 Read/Feed constraints in 38 ms returned sat
[2024-05-23 16:35:22] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-23 16:35:22] [INFO ] Added : 2 causal constraints over 1 iterations in 175 ms. Result :sat
Minimization took 444 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[169, 76, 1, 134, 198, 81, 116, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[169, 76, 1, 134, 198, 81, 116, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
Support contains 11 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 53 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 505/505 places, 1408/1408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 141 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
[2024-05-23 16:35:23] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:35:23] [INFO ] Invariant cache hit.
[2024-05-23 16:35:23] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-23 16:35:23] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:35:23] [INFO ] Invariant cache hit.
[2024-05-23 16:35:24] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-23 16:35:25] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
[2024-05-23 16:35:25] [INFO ] Redundant transitions in 24 ms returned []
Running 1406 sub problems to find dead transitions.
[2024-05-23 16:35:25] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:35:25] [INFO ] Invariant cache hit.
[2024-05-23 16:35:25] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 3 (OVERLAPS) 823/1328 variables, 505/507 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
SMT process timed out in 35059ms, After SMT, problems are : Problem set: 0 solved, 1406 unsolved
Search for dead transitions found 0 dead transitions in 35071ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37096 ms. Remains : 505/505 places, 1408/1408 transitions.
[2024-05-23 16:36:00] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
Found an invariant !
This invariant on transitions {209=1, 374=1, 711=1, 811=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {253=1, 418=1, 627=1, 807=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :[2, 0, 0, 2, 1, 0, 2, 0, 0, 0, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[169, 76, 1, 134, 198, 81, 116, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
[2024-05-23 16:36:00] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:36:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[169, 76, 1, 134, 198, 81, 116, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2460 ms. (406 steps per ms)
BEST_FIRST walk for 11000011 steps (23 resets) in 7636 ms. (1440 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[169, 76, 1, 184, 198, 81, 128, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
[2024-05-23 16:36:10] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:36:10] [INFO ] Invariant cache hit.
[2024-05-23 16:36:10] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:36:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:36:11] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 16:36:11] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-23 16:36:11] [INFO ] [Real]Added 106 Read/Feed constraints in 45 ms returned sat
[2024-05-23 16:36:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:36:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:36:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:36:11] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-23 16:36:11] [INFO ] [Nat]Added 106 Read/Feed constraints in 49 ms returned sat
[2024-05-23 16:36:11] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 77 ms.
[2024-05-23 16:36:11] [INFO ] Added : 2 causal constraints over 1 iterations in 215 ms. Result :sat
Minimization took 448 ms.
[2024-05-23 16:36:12] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:36:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:36:12] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-05-23 16:36:12] [INFO ] [Real]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-23 16:36:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:36:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:36:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:36:12] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 16:36:12] [INFO ] [Nat]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-23 16:36:12] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-23 16:36:12] [INFO ] Added : 2 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 442 ms.
[2024-05-23 16:36:13] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:36:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:36:13] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-23 16:36:13] [INFO ] [Real]Added 106 Read/Feed constraints in 37 ms returned sat
[2024-05-23 16:36:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:36:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:36:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:36:14] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-05-23 16:36:14] [INFO ] [Nat]Added 106 Read/Feed constraints in 72 ms returned sat
[2024-05-23 16:36:14] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:36:14] [INFO ] Added : 1 causal constraints over 1 iterations in 174 ms. Result :sat
Minimization took 453 ms.
[2024-05-23 16:36:14] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:36:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:36:15] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-23 16:36:15] [INFO ] [Real]Added 106 Read/Feed constraints in 45 ms returned sat
[2024-05-23 16:36:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:36:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2024-05-23 16:36:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:36:15] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 16:36:15] [INFO ] [Nat]Added 106 Read/Feed constraints in 38 ms returned sat
[2024-05-23 16:36:15] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 75 ms.
[2024-05-23 16:36:15] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 445 ms.
[2024-05-23 16:36:16] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:36:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:36:16] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 16:36:16] [INFO ] [Real]Added 106 Read/Feed constraints in 43 ms returned sat
[2024-05-23 16:36:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:36:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:36:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 16:36:16] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:36:16] [INFO ] [Nat]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:36:16] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-23 16:36:16] [INFO ] Added : 2 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 447 ms.
[2024-05-23 16:36:17] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:36:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:36:17] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-23 16:36:17] [INFO ] [Real]Added 106 Read/Feed constraints in 47 ms returned sat
[2024-05-23 16:36:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:36:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:36:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:36:17] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 16:36:17] [INFO ] [Nat]Added 106 Read/Feed constraints in 26 ms returned sat
[2024-05-23 16:36:17] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:36:18] [INFO ] Added : 2 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 443 ms.
[2024-05-23 16:36:18] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:36:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:36:18] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 16:36:18] [INFO ] [Real]Added 106 Read/Feed constraints in 57 ms returned sat
[2024-05-23 16:36:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:36:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:36:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:36:19] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-23 16:36:19] [INFO ] [Nat]Added 106 Read/Feed constraints in 53 ms returned sat
[2024-05-23 16:36:19] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 70 ms.
[2024-05-23 16:36:19] [INFO ] Added : 1 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 441 ms.
[2024-05-23 16:36:19] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:36:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:36:20] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 16:36:20] [INFO ] [Real]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:36:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:36:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:36:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:36:20] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 16:36:20] [INFO ] [Nat]Added 106 Read/Feed constraints in 40 ms returned sat
[2024-05-23 16:36:20] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-23 16:36:20] [INFO ] Added : 2 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 442 ms.
[2024-05-23 16:36:21] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:36:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:36:21] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:36:21] [INFO ] [Real]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:36:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:36:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:36:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:36:21] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 16:36:21] [INFO ] [Nat]Added 106 Read/Feed constraints in 51 ms returned sat
[2024-05-23 16:36:21] [INFO ] Deduced a trap composed of 131 places in 193 ms of which 3 ms to minimize.
[2024-05-23 16:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2024-05-23 16:36:21] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 70 ms.
[2024-05-23 16:36:22] [INFO ] Added : 1 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 459 ms.
[2024-05-23 16:36:22] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:36:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:36:22] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2024-05-23 16:36:22] [INFO ] [Real]Added 106 Read/Feed constraints in 42 ms returned sat
[2024-05-23 16:36:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:36:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:36:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:36:23] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2024-05-23 16:36:23] [INFO ] [Nat]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-23 16:36:23] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:36:23] [INFO ] Added : 1 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 450 ms.
[2024-05-23 16:36:23] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:36:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:36:24] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 16:36:24] [INFO ] [Real]Added 106 Read/Feed constraints in 35 ms returned sat
[2024-05-23 16:36:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:36:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:36:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:36:24] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 16:36:24] [INFO ] [Nat]Added 106 Read/Feed constraints in 45 ms returned sat
[2024-05-23 16:36:24] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-23 16:36:24] [INFO ] Added : 2 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 445 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[169, 76, 1, 184, 198, 81, 128, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[169, 76, 1, 184, 198, 81, 128, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
Support contains 11 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 52 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 505/505 places, 1408/1408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 52 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
[2024-05-23 16:36:25] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:36:25] [INFO ] Invariant cache hit.
[2024-05-23 16:36:25] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-23 16:36:25] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:36:25] [INFO ] Invariant cache hit.
[2024-05-23 16:36:25] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-23 16:36:27] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
[2024-05-23 16:36:27] [INFO ] Redundant transitions in 25 ms returned []
Running 1406 sub problems to find dead transitions.
[2024-05-23 16:36:27] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:36:27] [INFO ] Invariant cache hit.
[2024-05-23 16:36:27] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 3 (OVERLAPS) 823/1328 variables, 505/507 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
SMT process timed out in 34714ms, After SMT, problems are : Problem set: 0 solved, 1406 unsolved
Search for dead transitions found 0 dead transitions in 34726ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36645 ms. Remains : 505/505 places, 1408/1408 transitions.
[2024-05-23 16:37:01] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
Found an invariant !
This invariant on transitions {209=1, 374=1, 711=1, 811=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {253=1, 418=1, 627=1, 807=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :[0, 2, 0, 2, 2147483647, 0, 2147483647, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[169, 76, 1, 184, +inf, 81, +inf, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
[2024-05-23 16:37:02] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:37:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[169, 76, 1, 184, +inf, 81, +inf, 5, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, +inf, +inf, 8, +inf]
RANDOM walk for 1000002 steps (2 resets) in 2412 ms. (414 steps per ms)
FORMULA FunctionPointer-PT-c008-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c008-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 9000008 steps (18 resets) in 5828 ms. (1544 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[169, 76, 1, 184, 81, 14, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, 8, +inf]
[2024-05-23 16:37:10] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-23 16:37:10] [INFO ] Invariant cache hit.
[2024-05-23 16:37:10] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:10] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 16:37:10] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-23 16:37:10] [INFO ] [Real]Added 106 Read/Feed constraints in 49 ms returned sat
[2024-05-23 16:37:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:10] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-23 16:37:10] [INFO ] [Nat]Added 106 Read/Feed constraints in 45 ms returned sat
[2024-05-23 16:37:11] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-23 16:37:11] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 440 ms.
[2024-05-23 16:37:11] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:11] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 16:37:11] [INFO ] [Real]Added 106 Read/Feed constraints in 45 ms returned sat
[2024-05-23 16:37:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:37:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:12] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 16:37:12] [INFO ] [Nat]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:37:12] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-23 16:37:12] [INFO ] Added : 2 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 437 ms.
[2024-05-23 16:37:12] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:37:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:13] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 16:37:13] [INFO ] [Real]Added 106 Read/Feed constraints in 36 ms returned sat
[2024-05-23 16:37:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:37:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:13] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 16:37:13] [INFO ] [Nat]Added 106 Read/Feed constraints in 70 ms returned sat
[2024-05-23 16:37:13] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:37:13] [INFO ] Added : 1 causal constraints over 1 iterations in 178 ms. Result :sat
Minimization took 443 ms.
[2024-05-23 16:37:14] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:14] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 16:37:14] [INFO ] [Real]Added 106 Read/Feed constraints in 43 ms returned sat
[2024-05-23 16:37:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:37:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:14] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 16:37:14] [INFO ] [Nat]Added 106 Read/Feed constraints in 27 ms returned sat
[2024-05-23 16:37:14] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-23 16:37:14] [INFO ] Added : 2 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 444 ms.
[2024-05-23 16:37:15] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:37:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:15] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 16:37:15] [INFO ] [Real]Added 106 Read/Feed constraints in 49 ms returned sat
[2024-05-23 16:37:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:37:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:15] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 16:37:15] [INFO ] [Nat]Added 106 Read/Feed constraints in 28 ms returned sat
[2024-05-23 16:37:15] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:37:16] [INFO ] Added : 2 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 438 ms.
[2024-05-23 16:37:16] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:37:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:16] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-23 16:37:16] [INFO ] [Real]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:37:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 16:37:17] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 16:37:17] [INFO ] [Nat]Added 106 Read/Feed constraints in 31 ms returned sat
[2024-05-23 16:37:17] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-23 16:37:17] [INFO ] Added : 2 causal constraints over 1 iterations in 176 ms. Result :sat
Minimization took 433 ms.
[2024-05-23 16:37:17] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:37:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:18] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-23 16:37:18] [INFO ] [Real]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-23 16:37:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:18] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 16:37:18] [INFO ] [Nat]Added 106 Read/Feed constraints in 51 ms returned sat
[2024-05-23 16:37:18] [INFO ] Deduced a trap composed of 131 places in 180 ms of which 4 ms to minimize.
[2024-05-23 16:37:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2024-05-23 16:37:18] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-23 16:37:18] [INFO ] Added : 1 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 449 ms.
[2024-05-23 16:37:19] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:19] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-23 16:37:19] [INFO ] [Real]Added 106 Read/Feed constraints in 40 ms returned sat
[2024-05-23 16:37:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:19] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-05-23 16:37:19] [INFO ] [Nat]Added 106 Read/Feed constraints in 45 ms returned sat
[2024-05-23 16:37:19] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:37:20] [INFO ] Added : 1 causal constraints over 1 iterations in 176 ms. Result :sat
Minimization took 455 ms.
[2024-05-23 16:37:20] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:37:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:20] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 16:37:20] [INFO ] [Real]Added 106 Read/Feed constraints in 34 ms returned sat
[2024-05-23 16:37:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:21] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 16:37:21] [INFO ] [Nat]Added 106 Read/Feed constraints in 37 ms returned sat
[2024-05-23 16:37:21] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-23 16:37:21] [INFO ] Added : 2 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 444 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[169, 76, 1, 184, 81, 14, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, 8, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[169, 76, 1, 184, 81, 14, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, 8, +inf]
Support contains 9 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 503 transition count 1404
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 503 transition count 1404
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 503 transition count 1402
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 501 transition count 1398
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 501 transition count 1398
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 499 transition count 1394
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 499 transition count 1394
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 496 transition count 1384
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 496 transition count 1384
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 493 transition count 1378
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 493 transition count 1378
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 490 transition count 1372
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 490 transition count 1372
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 486 transition count 1360
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 486 transition count 1360
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 482 transition count 1352
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 482 transition count 1352
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 478 transition count 1344
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 478 transition count 1344
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 474 transition count 1336
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 474 transition count 1336
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 472 transition count 1332
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 472 transition count 1332
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 470 transition count 1328
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 470 transition count 1328
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 468 transition count 1324
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 468 transition count 1324
Applied a total of 76 rules in 180 ms. Remains 468 /505 variables (removed 37) and now considering 1324/1408 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 468/505 places, 1324/1408 transitions.
[2024-05-23 16:37:22] [INFO ] Flow matrix only has 764 transitions (discarded 560 similar events)
Found an invariant !
This invariant on transitions {208=1, 259=1, 266=1, 339=1, 671=1, 757=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {200=1, 331=1, 663=1, 756=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :[0, 0, 1, 2147483647, 3, 2, 0, 1, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[169, 76, 1, +inf, 81, 14, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, 8, +inf]
[2024-05-23 16:37:22] [INFO ] Flow matrix only has 764 transitions (discarded 560 similar events)
// Phase 1: matrix 764 rows 468 cols
[2024-05-23 16:37:22] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[169, 76, 1, +inf, 81, 14, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, +inf, 8, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2335 ms. (428 steps per ms)
FORMULA FunctionPointer-PT-c008-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 8000008 steps (16 resets) in 4909 ms. (1629 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[169, 96, 1, 81, 14, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, 8, +inf]
[2024-05-23 16:37:29] [INFO ] Flow matrix only has 764 transitions (discarded 560 similar events)
[2024-05-23 16:37:29] [INFO ] Invariant cache hit.
[2024-05-23 16:37:29] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:37:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:29] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-23 16:37:29] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-23 16:37:29] [INFO ] [Real]Added 93 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:37:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:30] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 16:37:30] [INFO ] [Nat]Added 93 Read/Feed constraints in 27 ms returned sat
[2024-05-23 16:37:30] [INFO ] Computed and/alt/rep : 105/236/98 causal constraints (skipped 664 transitions) in 65 ms.
[2024-05-23 16:37:30] [INFO ] Added : 12 causal constraints over 4 iterations in 272 ms. Result :sat
Minimization took 416 ms.
[2024-05-23 16:37:30] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:31] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 16:37:31] [INFO ] [Real]Added 93 Read/Feed constraints in 46 ms returned sat
[2024-05-23 16:37:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 16:37:31] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 16:37:31] [INFO ] [Nat]Added 93 Read/Feed constraints in 46 ms returned sat
[2024-05-23 16:37:31] [INFO ] Computed and/alt/rep : 105/236/98 causal constraints (skipped 664 transitions) in 67 ms.
[2024-05-23 16:37:31] [INFO ] Added : 5 causal constraints over 3 iterations in 233 ms. Result :sat
Minimization took 412 ms.
[2024-05-23 16:37:32] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:32] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 16:37:32] [INFO ] [Real]Added 93 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:37:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:32] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-23 16:37:32] [INFO ] [Nat]Added 93 Read/Feed constraints in 40 ms returned sat
[2024-05-23 16:37:32] [INFO ] Computed and/alt/rep : 105/236/98 causal constraints (skipped 664 transitions) in 66 ms.
[2024-05-23 16:37:32] [INFO ] Added : 1 causal constraints over 1 iterations in 151 ms. Result :sat
Minimization took 420 ms.
[2024-05-23 16:37:33] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 16:37:33] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 16:37:33] [INFO ] [Real]Added 93 Read/Feed constraints in 50 ms returned sat
[2024-05-23 16:37:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:33] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 16:37:33] [INFO ] [Nat]Added 93 Read/Feed constraints in 22 ms returned sat
[2024-05-23 16:37:33] [INFO ] Computed and/alt/rep : 105/236/98 causal constraints (skipped 664 transitions) in 67 ms.
[2024-05-23 16:37:34] [INFO ] Added : 14 causal constraints over 4 iterations in 258 ms. Result :sat
Minimization took 406 ms.
[2024-05-23 16:37:34] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:34] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 16:37:34] [INFO ] [Real]Added 93 Read/Feed constraints in 40 ms returned sat
[2024-05-23 16:37:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 16:37:35] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 16:37:35] [INFO ] [Nat]Added 93 Read/Feed constraints in 27 ms returned sat
[2024-05-23 16:37:35] [INFO ] Computed and/alt/rep : 105/236/98 causal constraints (skipped 664 transitions) in 71 ms.
[2024-05-23 16:37:35] [INFO ] Added : 12 causal constraints over 4 iterations in 267 ms. Result :sat
Minimization took 414 ms.
[2024-05-23 16:37:35] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:36] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-23 16:37:36] [INFO ] [Real]Added 93 Read/Feed constraints in 38 ms returned sat
[2024-05-23 16:37:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:36] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-23 16:37:36] [INFO ] [Nat]Added 93 Read/Feed constraints in 53 ms returned sat
[2024-05-23 16:37:36] [INFO ] Deduced a trap composed of 147 places in 172 ms of which 4 ms to minimize.
[2024-05-23 16:37:36] [INFO ] Deduced a trap composed of 131 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:37:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 420 ms
[2024-05-23 16:37:36] [INFO ] Computed and/alt/rep : 105/236/98 causal constraints (skipped 664 transitions) in 67 ms.
[2024-05-23 16:37:37] [INFO ] Added : 2 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 420 ms.
[2024-05-23 16:37:37] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:37] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 16:37:37] [INFO ] [Real]Added 93 Read/Feed constraints in 41 ms returned sat
[2024-05-23 16:37:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:38] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 16:37:38] [INFO ] [Nat]Added 93 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:37:38] [INFO ] Computed and/alt/rep : 105/236/98 causal constraints (skipped 664 transitions) in 68 ms.
[2024-05-23 16:37:38] [INFO ] Added : 1 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 412 ms.
[2024-05-23 16:37:38] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 16:37:38] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 16:37:38] [INFO ] [Real]Added 93 Read/Feed constraints in 38 ms returned sat
[2024-05-23 16:37:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:39] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 16:37:39] [INFO ] [Nat]Added 93 Read/Feed constraints in 35 ms returned sat
[2024-05-23 16:37:39] [INFO ] Computed and/alt/rep : 105/236/98 causal constraints (skipped 664 transitions) in 68 ms.
[2024-05-23 16:37:39] [INFO ] Added : 20 causal constraints over 6 iterations in 339 ms. Result :sat
Minimization took 415 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[169, 96, 1, 81, 14, 8, 6, 229] Max Struct:[+inf, +inf, 8, +inf, +inf, +inf, 8, +inf]
FORMULA FunctionPointer-PT-c008-UpperBounds-02 8 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[169, 96, 81, 14, 8, 6, 229] Max Struct:[+inf, +inf, +inf, +inf, +inf, 8, +inf]
Support contains 7 out of 468 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 1324/1324 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 467 transition count 1322
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 467 transition count 1322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 467 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 466 transition count 1318
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 466 transition count 1318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 465 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 465 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 464 transition count 1312
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 464 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1310
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 462 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 462 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 461 transition count 1306
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 461 transition count 1306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 460 transition count 1304
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 460 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 459 transition count 1302
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 459 transition count 1302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 458 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 458 transition count 1300
Applied a total of 22 rules in 142 ms. Remains 458 /468 variables (removed 10) and now considering 1300/1324 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 458/468 places, 1300/1324 transitions.
[2024-05-23 16:37:41] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
Found an invariant !
This invariant on transitions {234=1, 355=1, 686=1, 747=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {246=1, 367=1, 698=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :[0, 0, 0, 2, 1, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[169, 96, 81, 14, 8, 6, 229] Max Struct:[+inf, +inf, +inf, +inf, +inf, 8, +inf]
[2024-05-23 16:37:41] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
// Phase 1: matrix 748 rows 458 cols
[2024-05-23 16:37:41] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[169, 96, 81, 14, 8, 6, 229] Max Struct:[+inf, +inf, +inf, +inf, +inf, 8, +inf]
RANDOM walk for 1000003 steps (2 resets) in 2149 ms. (465 steps per ms)
BEST_FIRST walk for 7000005 steps (14 resets) in 4151 ms. (1685 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[169, 96, 81, 14, 8, 6, 472] Max Struct:[+inf, +inf, +inf, +inf, +inf, 8, +inf]
[2024-05-23 16:37:47] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:37:47] [INFO ] Invariant cache hit.
[2024-05-23 16:37:47] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:48] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 16:37:48] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 16:37:48] [INFO ] [Real]Added 90 Read/Feed constraints in 46 ms returned sat
[2024-05-23 16:37:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:48] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 16:37:48] [INFO ] [Nat]Added 90 Read/Feed constraints in 36 ms returned sat
[2024-05-23 16:37:48] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 68 ms.
[2024-05-23 16:37:48] [INFO ] Added : 8 causal constraints over 3 iterations in 248 ms. Result :sat
Minimization took 417 ms.
[2024-05-23 16:37:49] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:49] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-23 16:37:49] [INFO ] [Real]Added 90 Read/Feed constraints in 35 ms returned sat
[2024-05-23 16:37:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:49] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 16:37:49] [INFO ] [Nat]Added 90 Read/Feed constraints in 46 ms returned sat
[2024-05-23 16:37:49] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 67 ms.
[2024-05-23 16:37:49] [INFO ] Added : 10 causal constraints over 3 iterations in 242 ms. Result :sat
Minimization took 415 ms.
[2024-05-23 16:37:50] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:50] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 16:37:50] [INFO ] [Real]Added 90 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:37:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:50] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 16:37:50] [INFO ] [Nat]Added 90 Read/Feed constraints in 37 ms returned sat
[2024-05-23 16:37:51] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 67 ms.
[2024-05-23 16:37:51] [INFO ] Added : 9 causal constraints over 3 iterations in 256 ms. Result :sat
Minimization took 418 ms.
[2024-05-23 16:37:51] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:51] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 16:37:51] [INFO ] [Real]Added 90 Read/Feed constraints in 34 ms returned sat
[2024-05-23 16:37:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:52] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 16:37:52] [INFO ] [Nat]Added 90 Read/Feed constraints in 35 ms returned sat
[2024-05-23 16:37:52] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 68 ms.
[2024-05-23 16:37:52] [INFO ] Added : 10 causal constraints over 3 iterations in 262 ms. Result :sat
Minimization took 414 ms.
[2024-05-23 16:37:52] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:37:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:53] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-23 16:37:53] [INFO ] [Real]Added 90 Read/Feed constraints in 36 ms returned sat
[2024-05-23 16:37:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:53] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 16:37:53] [INFO ] [Nat]Added 90 Read/Feed constraints in 55 ms returned sat
[2024-05-23 16:37:53] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 3 ms to minimize.
[2024-05-23 16:37:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2024-05-23 16:37:53] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 66 ms.
[2024-05-23 16:37:53] [INFO ] Added : 1 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 416 ms.
[2024-05-23 16:37:54] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:54] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 16:37:54] [INFO ] [Real]Added 90 Read/Feed constraints in 60 ms returned sat
[2024-05-23 16:37:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:37:54] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-23 16:37:54] [INFO ] [Nat]Added 90 Read/Feed constraints in 44 ms returned sat
[2024-05-23 16:37:54] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 68 ms.
[2024-05-23 16:37:55] [INFO ] Added : 2 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 429 ms.
[2024-05-23 16:37:55] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:37:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:55] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-23 16:37:55] [INFO ] [Real]Added 90 Read/Feed constraints in 43 ms returned sat
[2024-05-23 16:37:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:37:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:37:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:37:56] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 16:37:56] [INFO ] [Nat]Added 90 Read/Feed constraints in 25 ms returned sat
[2024-05-23 16:37:56] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 68 ms.
[2024-05-23 16:37:56] [INFO ] Added : 9 causal constraints over 3 iterations in 248 ms. Result :sat
Minimization took 411 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[169, 96, 81, 14, 8, 6, 472] Max Struct:[+inf, +inf, +inf, +inf, +inf, 8, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[169, 96, 81, 14, 8, 7, 472] Max Struct:[+inf, +inf, +inf, +inf, +inf, 8, +inf]
Support contains 7 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1300/1300 transitions.
Applied a total of 0 rules in 46 ms. Remains 458 /458 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 458/458 places, 1300/1300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1300/1300 transitions.
Applied a total of 0 rules in 46 ms. Remains 458 /458 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
[2024-05-23 16:37:57] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:37:57] [INFO ] Invariant cache hit.
[2024-05-23 16:37:57] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-23 16:37:57] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:37:57] [INFO ] Invariant cache hit.
[2024-05-23 16:37:57] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 16:37:58] [INFO ] Implicit Places using invariants and state equation in 1287 ms returned []
Implicit Place search using SMT with State Equation took 1610 ms to find 0 implicit places.
[2024-05-23 16:37:58] [INFO ] Redundant transitions in 20 ms returned []
Running 1298 sub problems to find dead transitions.
[2024-05-23 16:37:58] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:37:58] [INFO ] Invariant cache hit.
[2024-05-23 16:37:58] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
At refinement iteration 3 (OVERLAPS) 748/1206 variables, 458/460 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
SMT process timed out in 34222ms, After SMT, problems are : Problem set: 0 solved, 1298 unsolved
Search for dead transitions found 0 dead transitions in 34233ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35917 ms. Remains : 458/458 places, 1300/1300 transitions.
[2024-05-23 16:38:33] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
Found an invariant !
This invariant on transitions {234=1, 355=1, 686=1, 747=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {246=1, 367=1, 698=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :[0, 0, 0, 0, 1, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[169, 96, 81, 14, 8, 7, 472] Max Struct:[+inf, +inf, +inf, +inf, +inf, 8, +inf]
[2024-05-23 16:38:33] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:38:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[169, 96, 81, 14, 8, 7, 472] Max Struct:[+inf, +inf, +inf, +inf, +inf, 8, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2148 ms. (465 steps per ms)
BEST_FIRST walk for 7000006 steps (14 resets) in 4206 ms. (1663 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[234, 96, 81, 170, 8, 7, 472] Max Struct:[+inf, +inf, +inf, +inf, +inf, 8, +inf]
[2024-05-23 16:38:39] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:38:39] [INFO ] Invariant cache hit.
[2024-05-23 16:38:39] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:38:40] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 16:38:40] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 16:38:40] [INFO ] [Real]Added 90 Read/Feed constraints in 46 ms returned sat
[2024-05-23 16:38:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:38:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:38:40] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 16:38:40] [INFO ] [Nat]Added 90 Read/Feed constraints in 29 ms returned sat
[2024-05-23 16:38:40] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 66 ms.
[2024-05-23 16:38:40] [INFO ] Added : 8 causal constraints over 3 iterations in 248 ms. Result :sat
Minimization took 422 ms.
[2024-05-23 16:38:41] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:38:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:38:41] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 16:38:41] [INFO ] [Real]Added 90 Read/Feed constraints in 36 ms returned sat
[2024-05-23 16:38:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:38:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:38:41] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 16:38:41] [INFO ] [Nat]Added 90 Read/Feed constraints in 48 ms returned sat
[2024-05-23 16:38:41] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 67 ms.
[2024-05-23 16:38:41] [INFO ] Added : 10 causal constraints over 3 iterations in 237 ms. Result :sat
Minimization took 408 ms.
[2024-05-23 16:38:42] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:42] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 16:38:42] [INFO ] [Real]Added 90 Read/Feed constraints in 31 ms returned sat
[2024-05-23 16:38:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:38:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:42] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 16:38:42] [INFO ] [Nat]Added 90 Read/Feed constraints in 40 ms returned sat
[2024-05-23 16:38:42] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 66 ms.
[2024-05-23 16:38:43] [INFO ] Added : 9 causal constraints over 3 iterations in 258 ms. Result :sat
Minimization took 426 ms.
[2024-05-23 16:38:43] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:38:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:38:43] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 16:38:43] [INFO ] [Real]Added 90 Read/Feed constraints in 39 ms returned sat
[2024-05-23 16:38:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:38:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:44] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 16:38:44] [INFO ] [Nat]Added 90 Read/Feed constraints in 26 ms returned sat
[2024-05-23 16:38:44] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 68 ms.
[2024-05-23 16:38:44] [INFO ] Added : 10 causal constraints over 3 iterations in 269 ms. Result :sat
Minimization took 405 ms.
[2024-05-23 16:38:44] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:45] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 16:38:45] [INFO ] [Real]Added 90 Read/Feed constraints in 36 ms returned sat
[2024-05-23 16:38:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:38:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:45] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 16:38:45] [INFO ] [Nat]Added 90 Read/Feed constraints in 55 ms returned sat
[2024-05-23 16:38:45] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 4 ms to minimize.
[2024-05-23 16:38:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2024-05-23 16:38:45] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 66 ms.
[2024-05-23 16:38:45] [INFO ] Added : 1 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 408 ms.
[2024-05-23 16:38:46] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:46] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-23 16:38:46] [INFO ] [Real]Added 90 Read/Feed constraints in 62 ms returned sat
[2024-05-23 16:38:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:38:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:46] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 16:38:46] [INFO ] [Nat]Added 90 Read/Feed constraints in 44 ms returned sat
[2024-05-23 16:38:46] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 65 ms.
[2024-05-23 16:38:47] [INFO ] Added : 2 causal constraints over 1 iterations in 152 ms. Result :sat
Minimization took 410 ms.
[2024-05-23 16:38:47] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:47] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-23 16:38:47] [INFO ] [Real]Added 90 Read/Feed constraints in 42 ms returned sat
[2024-05-23 16:38:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:38:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:47] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 16:38:47] [INFO ] [Nat]Added 90 Read/Feed constraints in 25 ms returned sat
[2024-05-23 16:38:48] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 66 ms.
[2024-05-23 16:38:48] [INFO ] Added : 9 causal constraints over 3 iterations in 251 ms. Result :sat
Minimization took 411 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[234, 96, 81, 170, 8, 7, 472] Max Struct:[+inf, +inf, +inf, +inf, +inf, 8, +inf]
FORMULA FunctionPointer-PT-c008-UpperBounds-14 8 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[234, 96, 81, 170, 8, 472] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1300/1300 transitions.
Applied a total of 0 rules in 47 ms. Remains 458 /458 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 458/458 places, 1300/1300 transitions.
[2024-05-23 16:38:49] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
Found an invariant !
This invariant on transitions {234=1, 355=1, 686=1, 747=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {246=1, 367=1, 698=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :[0, 0, 0, 0, 1, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[234, 96, 81, 170, 8, 472] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 16:38:49] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:38:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[234, 96, 81, 170, 8, 472] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2168 ms. (461 steps per ms)
BEST_FIRST walk for 6000005 steps (12 resets) in 3624 ms. (1655 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[234, 96, 81, 170, 8, 472] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 16:38:55] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:38:55] [INFO ] Invariant cache hit.
[2024-05-23 16:38:55] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:55] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-23 16:38:55] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 16:38:55] [INFO ] [Real]Added 90 Read/Feed constraints in 47 ms returned sat
[2024-05-23 16:38:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:38:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:55] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-23 16:38:55] [INFO ] [Nat]Added 90 Read/Feed constraints in 29 ms returned sat
[2024-05-23 16:38:55] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 67 ms.
[2024-05-23 16:38:56] [INFO ] Added : 8 causal constraints over 3 iterations in 255 ms. Result :sat
Minimization took 411 ms.
[2024-05-23 16:38:56] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:56] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-23 16:38:56] [INFO ] [Real]Added 90 Read/Feed constraints in 36 ms returned sat
[2024-05-23 16:38:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:38:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:38:57] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 16:38:57] [INFO ] [Nat]Added 90 Read/Feed constraints in 48 ms returned sat
[2024-05-23 16:38:57] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 67 ms.
[2024-05-23 16:38:57] [INFO ] Added : 10 causal constraints over 3 iterations in 253 ms. Result :sat
Minimization took 413 ms.
[2024-05-23 16:38:57] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:57] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 16:38:58] [INFO ] [Real]Added 90 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:38:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:38:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:38:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:58] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 16:38:58] [INFO ] [Nat]Added 90 Read/Feed constraints in 28 ms returned sat
[2024-05-23 16:38:58] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 64 ms.
[2024-05-23 16:38:58] [INFO ] Added : 9 causal constraints over 3 iterations in 253 ms. Result :sat
Minimization took 418 ms.
[2024-05-23 16:38:59] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:38:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:59] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 16:38:59] [INFO ] [Real]Added 90 Read/Feed constraints in 39 ms returned sat
[2024-05-23 16:38:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:38:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-23 16:38:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:38:59] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 16:38:59] [INFO ] [Nat]Added 90 Read/Feed constraints in 35 ms returned sat
[2024-05-23 16:38:59] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 66 ms.
[2024-05-23 16:38:59] [INFO ] Added : 10 causal constraints over 3 iterations in 264 ms. Result :sat
Minimization took 407 ms.
[2024-05-23 16:39:00] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:39:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:39:00] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 16:39:00] [INFO ] [Real]Added 90 Read/Feed constraints in 34 ms returned sat
[2024-05-23 16:39:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:39:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:39:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:39:00] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 16:39:00] [INFO ] [Nat]Added 90 Read/Feed constraints in 64 ms returned sat
[2024-05-23 16:39:01] [INFO ] Deduced a trap composed of 131 places in 167 ms of which 3 ms to minimize.
[2024-05-23 16:39:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2024-05-23 16:39:01] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 69 ms.
[2024-05-23 16:39:01] [INFO ] Added : 1 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 407 ms.
[2024-05-23 16:39:01] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:39:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:39:01] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 16:39:01] [INFO ] [Real]Added 90 Read/Feed constraints in 41 ms returned sat
[2024-05-23 16:39:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:39:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:39:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:39:02] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 16:39:02] [INFO ] [Nat]Added 90 Read/Feed constraints in 34 ms returned sat
[2024-05-23 16:39:02] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 65 ms.
[2024-05-23 16:39:02] [INFO ] Added : 9 causal constraints over 3 iterations in 252 ms. Result :sat
Minimization took 408 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[234, 96, 81, 170, 8, 472] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[234, 96, 81, 170, 8, 472] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1300/1300 transitions.
Applied a total of 0 rules in 45 ms. Remains 458 /458 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 458/458 places, 1300/1300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1300/1300 transitions.
Applied a total of 0 rules in 44 ms. Remains 458 /458 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
[2024-05-23 16:39:03] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:39:03] [INFO ] Invariant cache hit.
[2024-05-23 16:39:03] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-23 16:39:03] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:39:03] [INFO ] Invariant cache hit.
[2024-05-23 16:39:03] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 16:39:04] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 1568 ms to find 0 implicit places.
[2024-05-23 16:39:04] [INFO ] Redundant transitions in 22 ms returned []
Running 1298 sub problems to find dead transitions.
[2024-05-23 16:39:04] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:39:04] [INFO ] Invariant cache hit.
[2024-05-23 16:39:05] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 748/1206 variables, 458/460 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
SMT process timed out in 33618ms, After SMT, problems are : Problem set: 0 solved, 1298 unsolved
Search for dead transitions found 0 dead transitions in 33628ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35270 ms. Remains : 458/458 places, 1300/1300 transitions.
[2024-05-23 16:39:38] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
Found an invariant !
This invariant on transitions {234=1, 355=1, 686=1, 747=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {246=1, 367=1, 698=1, 741=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[234, 96, 81, 170, 8, 472] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40000 steps (8 resets) in 1135 ms. (35 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
[2024-05-23 16:39:39] [INFO ] Flatten gal took : 197 ms
[2024-05-23 16:39:39] [INFO ] Flatten gal took : 145 ms
[2024-05-23 16:39:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4129616914413179144.gal : 124 ms
[2024-05-23 16:39:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8251336948594153352.prop : 3 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/ReachabilityCardinality4129616914413179144.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8251336948594153352.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
Loading property file /tmp/ReachabilityCardinality8251336948594153352.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :31 after 1994
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1994 after 1.22555e+06
Interrupted probabilistic random walk after 204146 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 6
Probabilistic random walk after 204146 steps, saw 125197 distinct states, run finished after 3003 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-23 16:39:42] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:39:42] [INFO ] Invariant cache hit.
[2024-05-23 16:39:42] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 247/267 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 805/1072 variables, 368/386 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1072 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1072 variables, 90/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1072 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 62/1134 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1134 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 71/1205 variables, 71/549 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1205 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/1206 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1206 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1206 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1206/1206 variables, and 550 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 458/458 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 247/267 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 805/1072 variables, 368/386 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1072 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1072 variables, 90/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1072 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1072 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 62/1134 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:39:44] [INFO ] Deduced a trap composed of 135 places in 150 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1134 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1134 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 71/1205 variables, 71/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1205 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/1206 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1206 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1206 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1206/1206 variables, and 557 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1299 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 458/458 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 2365ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1.22555e+06 after 2.64763e+10
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :2.64763e+10 after 7.78635e+13
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :7.78635e+13 after 2.90129e+14
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :2.90129e+14 after 3.11032e+14
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :3.11032e+14 after 3.19641e+14
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :3.19641e+14 after 7.77752e+14
Parikh walk visited 0 properties in 34318 ms.
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1300/1300 transitions.
Applied a total of 0 rules in 46 ms. Remains 458 /458 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 458/458 places, 1300/1300 transitions.
RANDOM walk for 40001 steps (8 resets) in 221 ms. (180 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 201622 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 6
Probabilistic random walk after 201622 steps, saw 123647 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-23 16:40:22] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:40:22] [INFO ] Invariant cache hit.
[2024-05-23 16:40:22] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 247/267 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 805/1072 variables, 368/386 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1072 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1072 variables, 90/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1072 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 62/1134 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1134 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 71/1205 variables, 71/549 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1205 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/1206 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1206 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1206 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1206/1206 variables, and 550 constraints, problems are : Problem set: 0 solved, 6 unsolved in 808 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 458/458 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 247/267 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 805/1072 variables, 368/386 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1072 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1072 variables, 90/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1072 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1072 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 62/1134 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:40:24] [INFO ] Deduced a trap composed of 135 places in 167 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1134 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1134 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 71/1205 variables, 71/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1205 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/1206 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1206 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1206 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1206/1206 variables, and 557 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1225 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 458/458 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 2051ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :7.77752e+14 after 1.1081e+15
Detected timeout of ITS tools.
[2024-05-23 16:40:30] [INFO ] Flatten gal took : 101 ms
[2024-05-23 16:40:30] [INFO ] Applying decomposition
[2024-05-23 16:40:30] [INFO ] Flatten gal took : 116 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/graph13462850726930082011.txt' '-o' '/tmp/graph13462850726930082011.bin' '-w' '/tmp/graph13462850726930082011.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13462850726930082011.bin' '-l' '-1' '-v' '-w' '/tmp/graph13462850726930082011.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:40:30] [INFO ] Decomposing Gal with order
[2024-05-23 16:40:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:40:31] [INFO ] Removed a total of 2232 redundant transitions.
[2024-05-23 16:40:31] [INFO ] Flatten gal took : 250 ms
[2024-05-23 16:40:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 930 labels/synchronizations in 103 ms.
[2024-05-23 16:40:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4068977528624395299.gal : 13 ms
[2024-05-23 16:40:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4147915969035145249.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/ReachabilityCardinality4068977528624395299.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4147915969035145249.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 ...307
Loading property file /tmp/ReachabilityCardinality4147915969035145249.prop.
Parikh walk visited 0 properties in 38093 ms.
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1300/1300 transitions.
Applied a total of 0 rules in 47 ms. Remains 458 /458 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 458/458 places, 1300/1300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1300/1300 transitions.
Applied a total of 0 rules in 45 ms. Remains 458 /458 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
[2024-05-23 16:41:02] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:41:02] [INFO ] Invariant cache hit.
[2024-05-23 16:41:03] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-23 16:41:03] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:41:03] [INFO ] Invariant cache hit.
[2024-05-23 16:41:03] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 16:41:04] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
[2024-05-23 16:41:04] [INFO ] Redundant transitions in 20 ms returned []
Running 1298 sub problems to find dead transitions.
[2024-05-23 16:41:04] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:41:04] [INFO ] Invariant cache hit.
[2024-05-23 16:41:04] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 748/1206 variables, 458/460 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
SMT process timed out in 34268ms, After SMT, problems are : Problem set: 0 solved, 1298 unsolved
Search for dead transitions found 0 dead transitions in 34280ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35856 ms. Remains : 458/458 places, 1300/1300 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[234, 96, 81, 170, 8, 472] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-00
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 16:41:38] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:41:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-23 16:41:38] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:41:38] [INFO ] Invariant cache hit.
[2024-05-23 16:41:38] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:41:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:41:38] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-23 16:41:38] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 16:41:38] [INFO ] [Real]Added 90 Read/Feed constraints in 35 ms returned sat
[2024-05-23 16:41:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:41:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:41:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:41:39] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-23 16:41:39] [INFO ] [Nat]Added 90 Read/Feed constraints in 28 ms returned sat
[2024-05-23 16:41:39] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 67 ms.
[2024-05-23 16:41:39] [INFO ] Added : 21 causal constraints over 5 iterations in 332 ms. Result :sat
Minimization took 439 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1300/1300 transitions.
Graph (complete) has 2232 edges and 458 vertex of which 455 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 455 transition count 1294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 11 place count 451 transition count 1286
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 451 transition count 1286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 447 transition count 1276
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 447 transition count 1276
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 443 transition count 1262
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 443 transition count 1262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 439 transition count 1254
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 439 transition count 1254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 435 transition count 1246
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 435 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 431 transition count 1238
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 431 transition count 1238
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 427 transition count 1230
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 427 transition count 1230
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 423 transition count 1222
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 423 transition count 1222
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 420 transition count 1216
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 420 transition count 1216
Applied a total of 77 rules in 130 ms. Remains 420 /458 variables (removed 38) and now considering 1216/1300 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 420/458 places, 1216/1300 transitions.
[2024-05-23 16:41:40] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-05-23 16:41:40] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
// Phase 1: matrix 687 rows 420 cols
[2024-05-23 16:41:40] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 2056 ms. (486 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 555 ms. (1798 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2024-05-23 16:41:43] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:41:43] [INFO ] Invariant cache hit.
[2024-05-23 16:41:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:41:43] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-23 16:41:43] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:41:43] [INFO ] [Real]Added 75 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:41:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:41:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:41:43] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-23 16:41:43] [INFO ] [Nat]Added 75 Read/Feed constraints in 62 ms returned sat
[2024-05-23 16:41:43] [INFO ] Deduced a trap composed of 113 places in 202 ms of which 6 ms to minimize.
[2024-05-23 16:41:44] [INFO ] Deduced a trap composed of 103 places in 185 ms of which 3 ms to minimize.
[2024-05-23 16:41:44] [INFO ] Deduced a trap composed of 87 places in 171 ms of which 3 ms to minimize.
[2024-05-23 16:41:44] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 3 ms to minimize.
[2024-05-23 16:41:44] [INFO ] Deduced a trap composed of 76 places in 192 ms of which 3 ms to minimize.
[2024-05-23 16:41:44] [INFO ] Deduced a trap composed of 74 places in 189 ms of which 3 ms to minimize.
[2024-05-23 16:41:45] [INFO ] Deduced a trap composed of 71 places in 192 ms of which 3 ms to minimize.
[2024-05-23 16:41:45] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:41:45] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 3 ms to minimize.
[2024-05-23 16:41:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1852 ms
[2024-05-23 16:41:45] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 353 transitions) in 64 ms.
[2024-05-23 16:41:45] [INFO ] Added : 9 causal constraints over 3 iterations in 236 ms. Result :sat
Minimization took 264 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 40 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 40 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-23 16:41:46] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:41:46] [INFO ] Invariant cache hit.
[2024-05-23 16:41:46] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-23 16:41:46] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:41:46] [INFO ] Invariant cache hit.
[2024-05-23 16:41:46] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:41:47] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
[2024-05-23 16:41:47] [INFO ] Redundant transitions in 15 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-23 16:41:47] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:41:47] [INFO ] Invariant cache hit.
[2024-05-23 16:41:47] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-23 16:42:00] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 33754ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 33764ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35332 ms. Remains : 420/420 places, 1216/1216 transitions.
[2024-05-23 16:42:21] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
[2024-05-23 16:42:21] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:42:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1977 ms. (505 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 593 ms. (1683 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2024-05-23 16:42:24] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:42:24] [INFO ] Invariant cache hit.
[2024-05-23 16:42:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:42:24] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-05-23 16:42:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:42:24] [INFO ] [Real]Added 75 Read/Feed constraints in 31 ms returned sat
[2024-05-23 16:42:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:42:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:42:24] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-23 16:42:24] [INFO ] [Nat]Added 75 Read/Feed constraints in 70 ms returned sat
[2024-05-23 16:42:24] [INFO ] Deduced a trap composed of 113 places in 189 ms of which 3 ms to minimize.
[2024-05-23 16:42:25] [INFO ] Deduced a trap composed of 103 places in 184 ms of which 2 ms to minimize.
[2024-05-23 16:42:25] [INFO ] Deduced a trap composed of 87 places in 182 ms of which 3 ms to minimize.
[2024-05-23 16:42:25] [INFO ] Deduced a trap composed of 85 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:42:25] [INFO ] Deduced a trap composed of 76 places in 186 ms of which 3 ms to minimize.
[2024-05-23 16:42:25] [INFO ] Deduced a trap composed of 74 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:42:26] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 3 ms to minimize.
[2024-05-23 16:42:26] [INFO ] Deduced a trap composed of 70 places in 187 ms of which 3 ms to minimize.
[2024-05-23 16:42:26] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 3 ms to minimize.
[2024-05-23 16:42:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1865 ms
[2024-05-23 16:42:26] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 353 transitions) in 72 ms.
[2024-05-23 16:42:26] [INFO ] Added : 9 causal constraints over 3 iterations in 244 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 42 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 42 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-23 16:42:27] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:42:27] [INFO ] Invariant cache hit.
[2024-05-23 16:42:27] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-23 16:42:27] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:42:27] [INFO ] Invariant cache hit.
[2024-05-23 16:42:27] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:42:28] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1504 ms to find 0 implicit places.
[2024-05-23 16:42:28] [INFO ] Redundant transitions in 15 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-23 16:42:28] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:42:28] [INFO ] Invariant cache hit.
[2024-05-23 16:42:28] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-23 16:42:42] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 33476ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 33486ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35053 ms. Remains : 420/420 places, 1216/1216 transitions.
[2024-05-23 16:43:02] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 2 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 40007 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2024-05-23 16:43:02] [INFO ] Flatten gal took : 98 ms
[2024-05-23 16:43:02] [INFO ] Flatten gal took : 49 ms
[2024-05-23 16:43:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5219953325310286724.gal : 10 ms
[2024-05-23 16:43:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality299576392908180222.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/ReachabilityCardinality5219953325310286724.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality299576392908180222.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 ...327
Loading property file /tmp/ReachabilityCardinality299576392908180222.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1994
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1994 after 1.22555e+06
Interrupted probabilistic random walk after 547513 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 547513 steps, saw 335728 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2024-05-23 16:43:05] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:43:05] [INFO ] Invariant cache hit.
[2024-05-23 16:43:05] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/372 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 605/977 variables, 337/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 74/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1039 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1039 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1107 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 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) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/372 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 605/977 variables, 337/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 74/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/977 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1039 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1039 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1107/1107 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 708ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 40 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 420/420 places, 1216/1216 transitions.
RANDOM walk for 40000 steps (8 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.22555e+06 after 2.64763e+10
Interrupted probabilistic random walk after 542974 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 542974 steps, saw 332945 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2024-05-23 16:43:09] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:43:09] [INFO ] Invariant cache hit.
[2024-05-23 16:43:09] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/372 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 605/977 variables, 337/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 74/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1039 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1039 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1107 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 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) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/372 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 605/977 variables, 337/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 74/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/977 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1039 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1039 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1107/1107 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 834ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 39 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 39 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-23 16:43:10] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:43:10] [INFO ] Invariant cache hit.
[2024-05-23 16:43:10] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-23 16:43:10] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:43:10] [INFO ] Invariant cache hit.
[2024-05-23 16:43:11] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:43:12] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
[2024-05-23 16:43:12] [INFO ] Redundant transitions in 17 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-23 16:43:12] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 16:43:12] [INFO ] Invariant cache hit.
[2024-05-23 16:43:12] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-23 16:43:25] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.64763e+10 after 7.78635e+13
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.78635e+13 after 2.43134e+14
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.43134e+14 after 3.44424e+14
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.44424e+14 after 6.39645e+14
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.39645e+14 after 1.13724e+15
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.13724e+15 after 1.1489e+15
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.1489e+15 after 1.87396e+15
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.87396e+15 after 1.11067e+16
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 33359ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 33370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35039 ms. Remains : 420/420 places, 1216/1216 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 529 transitions
Reduce isomorphic transitions removed 529 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 420 transition count 677
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 549 place count 410 transition count 677
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 549 place count 410 transition count 605
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 693 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 947 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1011 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1075 place count 147 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1077 place count 147 transition count 348
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1140 place count 84 transition count 222
Iterating global reduction 3 with 63 rules applied. Total rules applied 1203 place count 84 transition count 222
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1266 place count 21 transition count 96
Iterating global reduction 3 with 63 rules applied. Total rules applied 1329 place count 21 transition count 96
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1392 place count 21 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1392 place count 21 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1394 place count 20 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 19 transition count 31
Applied a total of 1396 rules in 101 ms. Remains 19 /420 variables (removed 401) and now considering 31/1216 (removed 1185) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-23 16:43:45] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 16:43:45] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 16:43:45] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 16:43:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:43:45] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:43:45] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:43:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 16:43:45] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:43:45] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:43:45] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:43:45] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:43:45] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:43:45] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:43:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2055624435140671112.gal : 0 ms
[2024-05-23 16:43:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8669854520689134878.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/ReachabilityCardinality2055624435140671112.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8669854520689134878.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
Loading property file /tmp/ReachabilityCardinality8669854520689134878.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 207
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :207 after 2655
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2655 after 6615
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6615 after 14415
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :14415 after 29895
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :29895 after 60735
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :60735 after 122295
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :122295 after 245295
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :245295 after 491175
Detected timeout of ITS tools.
[2024-05-23 16:43:52] [INFO ] Flatten gal took : 34 ms
[2024-05-23 16:43:52] [INFO ] Applying decomposition
[2024-05-23 16:43:52] [INFO ] Flatten gal took : 33 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/graph6619504461318997900.txt' '-o' '/tmp/graph6619504461318997900.bin' '-w' '/tmp/graph6619504461318997900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6619504461318997900.bin' '-l' '-1' '-v' '-w' '/tmp/graph6619504461318997900.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:43:52] [INFO ] Decomposing Gal with order
[2024-05-23 16:43:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:43:53] [INFO ] Removed a total of 2073 redundant transitions.
[2024-05-23 16:43:53] [INFO ] Flatten gal took : 108 ms
[2024-05-23 16:43:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 894 labels/synchronizations in 35 ms.
[2024-05-23 16:43:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4906705923857122798.gal : 6 ms
[2024-05-23 16:43:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7537455579633531153.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/ReachabilityCardinality4906705923857122798.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7537455579633531153.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 ...307
Loading property file /tmp/ReachabilityCardinality7537455579633531153.prop.
Detected timeout of ITS tools.
[2024-05-23 16:44:00] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:44:00] [INFO ] Applying decomposition
[2024-05-23 16:44:00] [INFO ] Flatten gal took : 1 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/graph12037264316108568689.txt' '-o' '/tmp/graph12037264316108568689.bin' '-w' '/tmp/graph12037264316108568689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12037264316108568689.bin' '-l' '-1' '-v' '-w' '/tmp/graph12037264316108568689.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:44:00] [INFO ] Decomposing Gal with order
[2024-05-23 16:44:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:44:00] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-23 16:44:00] [INFO ] Flatten gal took : 2 ms
[2024-05-23 16:44:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-23 16:44:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14872353554253238749.gal : 1 ms
[2024-05-23 16:44:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10733395232092709762.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/ReachabilityCardinality14872353554253238749.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10733395232092709762.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/ReachabilityCardinality10733395232092709762.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 731
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7.27771e+12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7.27771e+12 after 7.29014e+12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7.29014e+12 after 7.29082e+12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7.29082e+12 after 8.24327e+12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8.24327e+12 after 1.1664e+13
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.1664e+13 after 1.3771e+13
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.3771e+13 after 4.46527e+13
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.46527e+13 after 5.34076e+13
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30333 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[15] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-00 in 157152 ms.
Starting property specific reduction for FunctionPointer-PT-c008-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 16:44:15] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
// Phase 1: matrix 748 rows 458 cols
[2024-05-23 16:44:15] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (2 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[+inf]
[2024-05-23 16:44:15] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:44:15] [INFO ] Invariant cache hit.
[2024-05-23 16:44:15] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:44:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:44:16] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-23 16:44:16] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 16:44:16] [INFO ] [Real]Added 90 Read/Feed constraints in 36 ms returned sat
[2024-05-23 16:44:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:44:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:44:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:44:16] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-23 16:44:16] [INFO ] [Nat]Added 90 Read/Feed constraints in 35 ms returned sat
[2024-05-23 16:44:16] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 69 ms.
[2024-05-23 16:44:16] [INFO ] Added : 8 causal constraints over 3 iterations in 234 ms. Result :sat
Minimization took 407 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[+inf]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1300/1300 transitions.
Graph (complete) has 2232 edges and 458 vertex of which 455 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 455 transition count 1294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 11 place count 451 transition count 1284
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 451 transition count 1284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 447 transition count 1274
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 447 transition count 1274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 443 transition count 1262
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 443 transition count 1262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 439 transition count 1254
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 439 transition count 1254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 435 transition count 1246
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 435 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 431 transition count 1238
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 431 transition count 1238
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 427 transition count 1230
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 427 transition count 1230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 424 transition count 1224
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 424 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 422 transition count 1220
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 422 transition count 1220
Applied a total of 73 rules in 120 ms. Remains 422 /458 variables (removed 36) and now considering 1220/1300 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 422/458 places, 1220/1300 transitions.
[2024-05-23 16:44:17] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[6] Max Struct:[+inf]
[2024-05-23 16:44:17] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-23 16:44:17] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2051 ms. (487 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 624 ms. (1600 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[184] Max Struct:[+inf]
[2024-05-23 16:44:20] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:44:20] [INFO ] Invariant cache hit.
[2024-05-23 16:44:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:44:20] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-23 16:44:20] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:44:20] [INFO ] [Real]Added 75 Read/Feed constraints in 33 ms returned sat
[2024-05-23 16:44:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:44:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:44:20] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-23 16:44:20] [INFO ] [Nat]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-23 16:44:20] [INFO ] Deduced a trap composed of 113 places in 183 ms of which 3 ms to minimize.
[2024-05-23 16:44:21] [INFO ] Deduced a trap composed of 109 places in 170 ms of which 3 ms to minimize.
[2024-05-23 16:44:21] [INFO ] Deduced a trap composed of 87 places in 175 ms of which 3 ms to minimize.
[2024-05-23 16:44:21] [INFO ] Deduced a trap composed of 81 places in 172 ms of which 3 ms to minimize.
[2024-05-23 16:44:21] [INFO ] Deduced a trap composed of 76 places in 173 ms of which 8 ms to minimize.
[2024-05-23 16:44:21] [INFO ] Deduced a trap composed of 74 places in 169 ms of which 3 ms to minimize.
[2024-05-23 16:44:21] [INFO ] Deduced a trap composed of 71 places in 170 ms of which 3 ms to minimize.
[2024-05-23 16:44:22] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 3 ms to minimize.
[2024-05-23 16:44:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1572 ms
[2024-05-23 16:44:22] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 71 ms.
[2024-05-23 16:44:22] [INFO ] Added : 11 causal constraints over 4 iterations in 269 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[184] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[184] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 16:44:22] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:44:22] [INFO ] Invariant cache hit.
[2024-05-23 16:44:23] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-23 16:44:23] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:44:23] [INFO ] Invariant cache hit.
[2024-05-23 16:44:23] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:44:24] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
[2024-05-23 16:44:24] [INFO ] Redundant transitions in 21 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 16:44:24] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:44:24] [INFO ] Invariant cache hit.
[2024-05-23 16:44:24] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 16:44:37] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34043ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34053ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35650 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 16:44:58] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[184] Max Struct:[+inf]
[2024-05-23 16:44:58] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:44:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[184] Max Struct:[+inf]
RANDOM walk for 1000006 steps (2 resets) in 1971 ms. (507 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 601 ms. (1661 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[184] Max Struct:[+inf]
[2024-05-23 16:45:01] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:45:01] [INFO ] Invariant cache hit.
[2024-05-23 16:45:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:45:01] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-05-23 16:45:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:45:01] [INFO ] [Real]Added 75 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:45:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:45:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:45:01] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-23 16:45:01] [INFO ] [Nat]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-23 16:45:01] [INFO ] Deduced a trap composed of 113 places in 178 ms of which 3 ms to minimize.
[2024-05-23 16:45:02] [INFO ] Deduced a trap composed of 109 places in 173 ms of which 2 ms to minimize.
[2024-05-23 16:45:02] [INFO ] Deduced a trap composed of 87 places in 176 ms of which 3 ms to minimize.
[2024-05-23 16:45:02] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 2 ms to minimize.
[2024-05-23 16:45:02] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 3 ms to minimize.
[2024-05-23 16:45:02] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 3 ms to minimize.
[2024-05-23 16:45:03] [INFO ] Deduced a trap composed of 71 places in 170 ms of which 2 ms to minimize.
[2024-05-23 16:45:03] [INFO ] Deduced a trap composed of 70 places in 176 ms of which 3 ms to minimize.
[2024-05-23 16:45:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1566 ms
[2024-05-23 16:45:03] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 60 ms.
[2024-05-23 16:45:03] [INFO ] Added : 11 causal constraints over 4 iterations in 269 ms. Result :sat
Minimization took 256 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[184] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[184] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 40 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 39 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 16:45:03] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:45:03] [INFO ] Invariant cache hit.
[2024-05-23 16:45:04] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-23 16:45:04] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:45:04] [INFO ] Invariant cache hit.
[2024-05-23 16:45:04] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:45:05] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
[2024-05-23 16:45:05] [INFO ] Redundant transitions in 19 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 16:45:05] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:45:05] [INFO ] Invariant cache hit.
[2024-05-23 16:45:05] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 16:45:18] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 33935ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 33948ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35482 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 16:45:39] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[184] Max Struct:[+inf]
RANDOM walk for 40007 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
[2024-05-23 16:45:39] [INFO ] Flatten gal took : 32 ms
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2024-05-23 16:45:39] [INFO ] Flatten gal took : 30 ms
[2024-05-23 16:45:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13386489266409703904.gal : 10 ms
[2024-05-23 16:45:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18256018230372809404.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/ReachabilityCardinality13386489266409703904.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18256018230372809404.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
Loading property file /tmp/ReachabilityCardinality18256018230372809404.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1994
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1994 after 1.22555e+06
Interrupted probabilistic random walk after 546018 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 1
Probabilistic random walk after 546018 steps, saw 334811 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
[2024-05-23 16:45:42] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:45:42] [INFO ] Invariant cache hit.
[2024-05-23 16:45:42] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 601ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 955 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 39 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 422/422 places, 1220/1220 transitions.
RANDOM walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.22555e+06 after 2.64763e+10
Interrupted probabilistic random walk after 533569 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 533569 steps, saw 327178 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
[2024-05-23 16:45:47] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:45:47] [INFO ] Invariant cache hit.
[2024-05-23 16:45:47] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 634ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 959 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 49 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 65 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 16:45:49] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:45:49] [INFO ] Invariant cache hit.
[2024-05-23 16:45:49] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-23 16:45:49] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:45:49] [INFO ] Invariant cache hit.
[2024-05-23 16:45:49] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:45:50] [INFO ] Implicit Places using invariants and state equation in 1205 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
[2024-05-23 16:45:50] [INFO ] Redundant transitions in 18 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 16:45:50] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:45:50] [INFO ] Invariant cache hit.
[2024-05-23 16:45:50] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.64763e+10 after 7.78635e+13
[2024-05-23 16:46:04] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.78635e+13 after 2.43134e+14
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.43134e+14 after 3.44424e+14
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.44424e+14 after 6.39645e+14
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.39645e+14 after 1.06847e+15
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.06847e+15 after 1.11465e+15
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 33800ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 33811ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35400 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
SDD proceeding with computation,1 properties remain. new max is 4096
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
SDD size :1.11465e+15 after 1.98219e+15
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 81 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-23 16:46:24] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 16:46:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 16:46:24] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 16:46:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:46:24] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:46:24] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:46:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 16:46:24] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:46:24] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:46:24] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:46:24] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:46:24] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:46:24] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:46:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2922446172368145239.gal : 0 ms
[2024-05-23 16:46:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7231620990287907750.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/ReachabilityCardinality2922446172368145239.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7231620990287907750.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
Loading property file /tmp/ReachabilityCardinality7231620990287907750.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 207
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :207 after 2655
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2655 after 6615
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6615 after 14415
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :14415 after 29895
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :29895 after 60735
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :60735 after 122295
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :122295 after 245295
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.98219e+15 after 1.19075e+16
Detected timeout of ITS tools.
[2024-05-23 16:46:29] [INFO ] Flatten gal took : 30 ms
[2024-05-23 16:46:29] [INFO ] Applying decomposition
[2024-05-23 16:46:29] [INFO ] Flatten gal took : 32 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/graph9792602662600234395.txt' '-o' '/tmp/graph9792602662600234395.bin' '-w' '/tmp/graph9792602662600234395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9792602662600234395.bin' '-l' '-1' '-v' '-w' '/tmp/graph9792602662600234395.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:46:29] [INFO ] Decomposing Gal with order
[2024-05-23 16:46:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:46:30] [INFO ] Removed a total of 2091 redundant transitions.
[2024-05-23 16:46:30] [INFO ] Flatten gal took : 75 ms
[2024-05-23 16:46:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 916 labels/synchronizations in 42 ms.
[2024-05-23 16:46:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15283079921472631071.gal : 10 ms
[2024-05-23 16:46:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6730026362256467158.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/ReachabilityCardinality15283079921472631071.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6730026362256467158.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/ReachabilityCardinality6730026362256467158.prop.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :245295 after 491175
Detected timeout of ITS tools.
[2024-05-23 16:46:39] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:46:39] [INFO ] Applying decomposition
[2024-05-23 16:46:39] [INFO ] Flatten gal took : 2 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/graph3521708862733016440.txt' '-o' '/tmp/graph3521708862733016440.bin' '-w' '/tmp/graph3521708862733016440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3521708862733016440.bin' '-l' '-1' '-v' '-w' '/tmp/graph3521708862733016440.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:46:39] [INFO ] Decomposing Gal with order
[2024-05-23 16:46:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:46:39] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-23 16:46:39] [INFO ] Flatten gal took : 2 ms
[2024-05-23 16:46:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2024-05-23 16:46:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12819928807422226465.gal : 0 ms
[2024-05-23 16:46:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13045897629111354489.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/ReachabilityCardinality12819928807422226465.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13045897629111354489.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/ReachabilityCardinality13045897629111354489.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 582
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30258 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[184] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-01 in 158903 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-06
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 16:46:54] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
// Phase 1: matrix 748 rows 458 cols
[2024-05-23 16:46:54] [INFO ] Computed 2 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 16:46:54] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:46:54] [INFO ] Invariant cache hit.
[2024-05-23 16:46:54] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:46:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:46:55] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 16:46:55] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 16:46:55] [INFO ] [Real]Added 90 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:46:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:46:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:46:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:46:55] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-23 16:46:55] [INFO ] [Nat]Added 90 Read/Feed constraints in 28 ms returned sat
[2024-05-23 16:46:55] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 66 ms.
[2024-05-23 16:46:55] [INFO ] Added : 10 causal constraints over 3 iterations in 239 ms. Result :sat
Minimization took 420 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1300/1300 transitions.
Graph (complete) has 2232 edges and 458 vertex of which 455 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 455 transition count 1294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 11 place count 451 transition count 1284
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 451 transition count 1284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 447 transition count 1274
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 447 transition count 1274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 443 transition count 1262
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 443 transition count 1262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 439 transition count 1254
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 439 transition count 1254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 435 transition count 1246
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 435 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 431 transition count 1238
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 431 transition count 1238
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 427 transition count 1230
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 427 transition count 1230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 424 transition count 1224
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 424 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 422 transition count 1220
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 422 transition count 1220
Applied a total of 73 rules in 124 ms. Remains 422 /458 variables (removed 36) and now considering 1220/1300 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 422/458 places, 1220/1300 transitions.
[2024-05-23 16:46:56] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 16:46:56] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-23 16:46:56] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2101 ms. (475 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 602 ms. (1658 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 16:46:59] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:46:59] [INFO ] Invariant cache hit.
[2024-05-23 16:46:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:46:59] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-23 16:46:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:46:59] [INFO ] [Real]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-23 16:46:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:46:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:46:59] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-23 16:46:59] [INFO ] [Nat]Added 75 Read/Feed constraints in 23 ms returned sat
[2024-05-23 16:46:59] [INFO ] Deduced a trap composed of 72 places in 190 ms of which 3 ms to minimize.
[2024-05-23 16:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2024-05-23 16:46:59] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 61 ms.
[2024-05-23 16:47:00] [INFO ] Added : 10 causal constraints over 4 iterations in 247 ms. Result :sat
Minimization took 238 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 39 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 39 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 16:47:00] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:47:00] [INFO ] Invariant cache hit.
[2024-05-23 16:47:00] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-23 16:47:00] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:47:00] [INFO ] Invariant cache hit.
[2024-05-23 16:47:00] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:47:01] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1459 ms to find 0 implicit places.
[2024-05-23 16:47:01] [INFO ] Redundant transitions in 20 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 16:47:01] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:47:01] [INFO ] Invariant cache hit.
[2024-05-23 16:47:01] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 16:47:15] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34165ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34175ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35698 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 16:47:36] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 16:47:36] [INFO ] Flatten gal took : 43 ms
RANDOM walk for 40002 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
[2024-05-23 16:47:36] [INFO ] Flatten gal took : 29 ms
[2024-05-23 16:47:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6222378735625251438.gal : 9 ms
[2024-05-23 16:47:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16184302954342651092.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/ReachabilityCardinality6222378735625251438.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16184302954342651092.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 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 ...329
Loading property file /tmp/ReachabilityCardinality16184302954342651092.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1994
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1994 after 1.22555e+06
Interrupted probabilistic random walk after 500399 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 1
Probabilistic random walk after 500399 steps, saw 306839 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
[2024-05-23 16:47:39] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:47:39] [INFO ] Invariant cache hit.
[2024-05-23 16:47:39] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1256ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 422/422 places, 1220/1220 transitions.
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 526683 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 526683 steps, saw 322955 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2024-05-23 16:47:43] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:47:43] [INFO ] Invariant cache hit.
[2024-05-23 16:47:43] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 534ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 39 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 39 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 16:47:44] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:47:44] [INFO ] Invariant cache hit.
[2024-05-23 16:47:44] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-23 16:47:44] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:47:44] [INFO ] Invariant cache hit.
[2024-05-23 16:47:44] [INFO ] State equation strengthened by 75 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.22555e+06 after 2.64763e+10
[2024-05-23 16:47:45] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
[2024-05-23 16:47:46] [INFO ] Redundant transitions in 19 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 16:47:46] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:47:46] [INFO ] Invariant cache hit.
[2024-05-23 16:47:46] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 16:47:59] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.64763e+10 after 7.78635e+13
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.78635e+13 after 2.43134e+14
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.43134e+14 after 3.44424e+14
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.44424e+14 after 6.39645e+14
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.39645e+14 after 1.06847e+15
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34315ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34325ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35846 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 20 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-23 16:48:20] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 16:48:20] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 16:48:20] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 16:48:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:48:20] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:48:20] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:48:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 16:48:20] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:48:20] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:48:20] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:48:20] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:48:20] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:48:20] [INFO ] Flatten gal took : 0 ms
[2024-05-23 16:48:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18272464412145556862.gal : 3 ms
[2024-05-23 16:48:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3389964610375903150.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/ReachabilityCardinality18272464412145556862.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3389964610375903150.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/ReachabilityCardinality3389964610375903150.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 207
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :207 after 2655
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2655 after 6615
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6615 after 14415
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :14415 after 29895
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :29895 after 60735
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :60735 after 122295
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :122295 after 245295
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.06847e+15 after 1.11465e+15
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.11465e+15 after 1.98219e+15
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :245295 after 491175
Detected timeout of ITS tools.
[2024-05-23 16:48:26] [INFO ] Flatten gal took : 49 ms
[2024-05-23 16:48:26] [INFO ] Applying decomposition
[2024-05-23 16:48:26] [INFO ] Flatten gal took : 27 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/graph6538093928665709090.txt' '-o' '/tmp/graph6538093928665709090.bin' '-w' '/tmp/graph6538093928665709090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6538093928665709090.bin' '-l' '-1' '-v' '-w' '/tmp/graph6538093928665709090.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:48:26] [INFO ] Decomposing Gal with order
[2024-05-23 16:48:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:48:26] [INFO ] Removed a total of 2088 redundant transitions.
[2024-05-23 16:48:26] [INFO ] Flatten gal took : 49 ms
[2024-05-23 16:48:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 830 labels/synchronizations in 21 ms.
[2024-05-23 16:48:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7312046053481281309.gal : 5 ms
[2024-05-23 16:48:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14777935004564324413.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/ReachabilityCardinality7312046053481281309.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14777935004564324413.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/ReachabilityCardinality14777935004564324413.prop.
Detected timeout of ITS tools.
[2024-05-23 16:48:35] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:48:35] [INFO ] Applying decomposition
[2024-05-23 16:48:35] [INFO ] Flatten gal took : 1 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/graph15864949565757806576.txt' '-o' '/tmp/graph15864949565757806576.bin' '-w' '/tmp/graph15864949565757806576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15864949565757806576.bin' '-l' '-1' '-v' '-w' '/tmp/graph15864949565757806576.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:48:35] [INFO ] Decomposing Gal with order
[2024-05-23 16:48:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:48:35] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-23 16:48:35] [INFO ] Flatten gal took : 2 ms
[2024-05-23 16:48:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2024-05-23 16:48:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9194831029507034650.gal : 0 ms
[2024-05-23 16:48:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15139536361469955071.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/ReachabilityCardinality9194831029507034650.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15139536361469955071.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/ReachabilityCardinality15139536361469955071.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30154 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-06 in 115785 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-10
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 16:48:50] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
// Phase 1: matrix 748 rows 458 cols
[2024-05-23 16:48:50] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 29 ms. (333 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 16:48:50] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:48:50] [INFO ] Invariant cache hit.
[2024-05-23 16:48:50] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:48:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:48:50] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 16:48:50] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 16:48:50] [INFO ] [Real]Added 90 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:48:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:48:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:48:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:48:51] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 16:48:51] [INFO ] [Nat]Added 90 Read/Feed constraints in 25 ms returned sat
[2024-05-23 16:48:51] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 81 ms.
[2024-05-23 16:48:51] [INFO ] Added : 9 causal constraints over 3 iterations in 257 ms. Result :sat
Minimization took 402 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1300/1300 transitions.
Graph (complete) has 2232 edges and 458 vertex of which 455 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 455 transition count 1294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 11 place count 451 transition count 1284
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 451 transition count 1284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 447 transition count 1274
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 447 transition count 1274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 443 transition count 1262
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 443 transition count 1262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 439 transition count 1254
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 439 transition count 1254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 435 transition count 1246
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 435 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 431 transition count 1238
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 431 transition count 1238
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 427 transition count 1230
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 427 transition count 1230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 424 transition count 1224
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 424 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 422 transition count 1220
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 422 transition count 1220
Applied a total of 73 rules in 111 ms. Remains 422 /458 variables (removed 36) and now considering 1220/1300 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 422/458 places, 1220/1300 transitions.
[2024-05-23 16:48:51] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 16:48:52] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-23 16:48:52] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2183 ms. (457 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 640 ms. (1560 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[198] Max Struct:[+inf]
[2024-05-23 16:48:55] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:48:55] [INFO ] Invariant cache hit.
[2024-05-23 16:48:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:48:55] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 16:48:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:48:55] [INFO ] [Real]Added 75 Read/Feed constraints in 44 ms returned sat
[2024-05-23 16:48:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:48:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:48:55] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 16:48:55] [INFO ] [Nat]Added 75 Read/Feed constraints in 41 ms returned sat
[2024-05-23 16:48:55] [INFO ] Deduced a trap composed of 113 places in 187 ms of which 3 ms to minimize.
[2024-05-23 16:48:56] [INFO ] Deduced a trap composed of 109 places in 174 ms of which 3 ms to minimize.
[2024-05-23 16:48:56] [INFO ] Deduced a trap composed of 87 places in 176 ms of which 3 ms to minimize.
[2024-05-23 16:48:56] [INFO ] Deduced a trap composed of 78 places in 172 ms of which 3 ms to minimize.
[2024-05-23 16:48:56] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 2 ms to minimize.
[2024-05-23 16:48:56] [INFO ] Deduced a trap composed of 73 places in 172 ms of which 2 ms to minimize.
[2024-05-23 16:48:57] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 3 ms to minimize.
[2024-05-23 16:48:57] [INFO ] Deduced a trap composed of 70 places in 177 ms of which 3 ms to minimize.
[2024-05-23 16:48:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1607 ms
[2024-05-23 16:48:57] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 78 ms.
[2024-05-23 16:48:57] [INFO ] Added : 14 causal constraints over 5 iterations in 315 ms. Result :sat
Minimization took 297 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[198] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[198] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 39 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 53 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 16:48:59] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:48:59] [INFO ] Invariant cache hit.
[2024-05-23 16:48:59] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-23 16:48:59] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:48:59] [INFO ] Invariant cache hit.
[2024-05-23 16:48:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:49:00] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
[2024-05-23 16:49:00] [INFO ] Redundant transitions in 18 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 16:49:00] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:49:00] [INFO ] Invariant cache hit.
[2024-05-23 16:49:00] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 16:49:14] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34255ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34265ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35870 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 16:49:34] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[198] Max Struct:[+inf]
[2024-05-23 16:49:35] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:49:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[198] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2148 ms. (465 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 641 ms. (1557 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[198] Max Struct:[+inf]
[2024-05-23 16:49:37] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:49:37] [INFO ] Invariant cache hit.
[2024-05-23 16:49:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:49:38] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-23 16:49:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:49:38] [INFO ] [Real]Added 75 Read/Feed constraints in 40 ms returned sat
[2024-05-23 16:49:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:49:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:49:38] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-23 16:49:38] [INFO ] [Nat]Added 75 Read/Feed constraints in 42 ms returned sat
[2024-05-23 16:49:38] [INFO ] Deduced a trap composed of 113 places in 178 ms of which 2 ms to minimize.
[2024-05-23 16:49:38] [INFO ] Deduced a trap composed of 109 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:49:39] [INFO ] Deduced a trap composed of 87 places in 165 ms of which 3 ms to minimize.
[2024-05-23 16:49:39] [INFO ] Deduced a trap composed of 78 places in 175 ms of which 2 ms to minimize.
[2024-05-23 16:49:39] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 3 ms to minimize.
[2024-05-23 16:49:39] [INFO ] Deduced a trap composed of 73 places in 182 ms of which 3 ms to minimize.
[2024-05-23 16:49:39] [INFO ] Deduced a trap composed of 71 places in 173 ms of which 3 ms to minimize.
[2024-05-23 16:49:39] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 3 ms to minimize.
[2024-05-23 16:49:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1573 ms
[2024-05-23 16:49:40] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 59 ms.
[2024-05-23 16:49:40] [INFO ] Added : 14 causal constraints over 5 iterations in 291 ms. Result :sat
Minimization took 256 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[198] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[198] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 40 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 39 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 16:49:41] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:49:41] [INFO ] Invariant cache hit.
[2024-05-23 16:49:42] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-23 16:49:42] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:49:42] [INFO ] Invariant cache hit.
[2024-05-23 16:49:42] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:49:43] [INFO ] Implicit Places using invariants and state equation in 1151 ms returned []
Implicit Place search using SMT with State Equation took 1457 ms to find 0 implicit places.
[2024-05-23 16:49:43] [INFO ] Redundant transitions in 18 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 16:49:43] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:49:43] [INFO ] Invariant cache hit.
[2024-05-23 16:49:43] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 16:49:56] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34408ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34418ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35942 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 16:50:17] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[198] Max Struct:[+inf]
[2024-05-23 16:50:17] [INFO ] Flatten gal took : 25 ms
RANDOM walk for 40002 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
[2024-05-23 16:50:17] [INFO ] Flatten gal took : 26 ms
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
[2024-05-23 16:50:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6196663019711664153.gal : 5 ms
[2024-05-23 16:50:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14299580480713694680.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/ReachabilityCardinality6196663019711664153.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14299580480713694680.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/ReachabilityCardinality14299580480713694680.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1994
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1994 after 1.22555e+06
Interrupted probabilistic random walk after 527734 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 527734 steps, saw 323600 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2024-05-23 16:50:20] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:50:20] [INFO ] Invariant cache hit.
[2024-05-23 16:50:20] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 607ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1079 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 39 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 422/422 places, 1220/1220 transitions.
RANDOM walk for 40001 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.22555e+06 after 2.64763e+10
Interrupted probabilistic random walk after 489065 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 1
Probabilistic random walk after 489065 steps, saw 299890 distinct states, run finished after 3003 ms. (steps per millisecond=162 ) properties seen :0
[2024-05-23 16:50:25] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:50:25] [INFO ] Invariant cache hit.
[2024-05-23 16:50:25] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 644ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1140 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 50 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 16:50:27] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:50:27] [INFO ] Invariant cache hit.
[2024-05-23 16:50:27] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-23 16:50:27] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:50:27] [INFO ] Invariant cache hit.
[2024-05-23 16:50:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:50:29] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2024-05-23 16:50:29] [INFO ] Redundant transitions in 21 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 16:50:29] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 16:50:29] [INFO ] Invariant cache hit.
[2024-05-23 16:50:29] [INFO ] State equation strengthened by 75 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.64763e+10 after 7.78635e+13
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 16:50:43] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.78635e+13 after 2.43134e+14
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.43134e+14 after 3.44424e+14
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.44424e+14 after 6.39645e+14
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.39645e+14 after 1.13724e+15
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.13724e+15 after 1.1489e+15
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.1489e+15 after 1.87396e+15
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 35005ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 35018ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36611 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 24 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-23 16:51:04] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 16:51:04] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 16:51:04] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 16:51:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:51:04] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:51:04] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:51:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 16:51:04] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:51:04] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:51:04] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:51:04] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:51:04] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:51:04] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:51:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9869881862973488119.gal : 1 ms
[2024-05-23 16:51:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1196271867551752024.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/ReachabilityCardinality9869881862973488119.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1196271867551752024.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
Loading property file /tmp/ReachabilityCardinality1196271867551752024.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 207
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :207 after 2655
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2655 after 6615
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6615 after 14415
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :14415 after 29895
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :29895 after 60735
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :60735 after 122295
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.87396e+15 after 1.18987e+16
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :122295 after 245295
Detected timeout of ITS tools.
[2024-05-23 16:51:08] [INFO ] Flatten gal took : 28 ms
[2024-05-23 16:51:08] [INFO ] Applying decomposition
[2024-05-23 16:51:08] [INFO ] Flatten gal took : 25 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/graph14563278222333132275.txt' '-o' '/tmp/graph14563278222333132275.bin' '-w' '/tmp/graph14563278222333132275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14563278222333132275.bin' '-l' '-1' '-v' '-w' '/tmp/graph14563278222333132275.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:51:08] [INFO ] Decomposing Gal with order
[2024-05-23 16:51:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:51:08] [INFO ] Removed a total of 2085 redundant transitions.
[2024-05-23 16:51:08] [INFO ] Flatten gal took : 49 ms
[2024-05-23 16:51:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 870 labels/synchronizations in 19 ms.
[2024-05-23 16:51:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2006999869457842037.gal : 5 ms
[2024-05-23 16:51:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6389516530168617185.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/ReachabilityCardinality2006999869457842037.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6389516530168617185.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 ...307
Loading property file /tmp/ReachabilityCardinality6389516530168617185.prop.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :245295 after 491175
Detected timeout of ITS tools.
[2024-05-23 16:51:19] [INFO ] Flatten gal took : 2 ms
[2024-05-23 16:51:19] [INFO ] Applying decomposition
[2024-05-23 16:51:19] [INFO ] Flatten gal took : 1 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/graph284921285802482600.txt' '-o' '/tmp/graph284921285802482600.bin' '-w' '/tmp/graph284921285802482600.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph284921285802482600.bin' '-l' '-1' '-v' '-w' '/tmp/graph284921285802482600.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:51:19] [INFO ] Decomposing Gal with order
[2024-05-23 16:51:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:51:19] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-23 16:51:19] [INFO ] Flatten gal took : 3 ms
[2024-05-23 16:51:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-23 16:51:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11544717049907081096.gal : 1 ms
[2024-05-23 16:51:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5301697587750240253.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/ReachabilityCardinality11544717049907081096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5301697587750240253.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/ReachabilityCardinality5301697587750240253.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 592
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30182 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[198] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-10 in 163866 ms.
Starting property specific reduction for FunctionPointer-PT-c008-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 16:51:34] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
// Phase 1: matrix 748 rows 458 cols
[2024-05-23 16:51:34] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (2 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 16:51:34] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:51:34] [INFO ] Invariant cache hit.
[2024-05-23 16:51:34] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:51:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:51:34] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 16:51:34] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 16:51:34] [INFO ] [Real]Added 90 Read/Feed constraints in 28 ms returned sat
[2024-05-23 16:51:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:51:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:51:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:51:34] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-23 16:51:34] [INFO ] [Nat]Added 90 Read/Feed constraints in 37 ms returned sat
[2024-05-23 16:51:35] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 66 ms.
[2024-05-23 16:51:35] [INFO ] Added : 2 causal constraints over 1 iterations in 152 ms. Result :sat
Minimization took 407 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1300/1300 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 453 transition count 1288
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 453 transition count 1288
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 448 transition count 1276
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 448 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 443 transition count 1260
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 443 transition count 1260
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 438 transition count 1250
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 438 transition count 1250
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 433 transition count 1240
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 433 transition count 1240
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 428 transition count 1230
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 428 transition count 1230
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 423 transition count 1220
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 423 transition count 1220
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 419 transition count 1212
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 419 transition count 1212
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 416 transition count 1206
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 416 transition count 1206
Applied a total of 84 rules in 105 ms. Remains 416 /458 variables (removed 42) and now considering 1206/1300 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 416/458 places, 1206/1300 transitions.
[2024-05-23 16:51:35] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {220=1, 304=1, 502=1, 676=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {208=1, 292=1, 490=1, 676=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2024-05-23 16:51:35] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2024-05-23 16:51:35] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1992 ms. (501 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 613 ms. (1628 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2024-05-23 16:51:38] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 16:51:38] [INFO ] Invariant cache hit.
[2024-05-23 16:51:38] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-23 16:51:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:51:38] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-23 16:51:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:51:38] [INFO ] [Real]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-23 16:51:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:51:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:51:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:51:39] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-23 16:51:39] [INFO ] [Nat]Added 75 Read/Feed constraints in 33 ms returned sat
[2024-05-23 16:51:39] [INFO ] Computed and/alt/rep : 334/1253/332 causal constraints (skipped 347 transitions) in 62 ms.
[2024-05-23 16:51:39] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 2 ms to minimize.
[2024-05-23 16:51:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2024-05-23 16:51:39] [INFO ] Added : 5 causal constraints over 2 iterations in 418 ms. Result :sat
Minimization took 390 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 38 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 38 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 16:51:40] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 16:51:40] [INFO ] Invariant cache hit.
[2024-05-23 16:51:40] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-23 16:51:40] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 16:51:40] [INFO ] Invariant cache hit.
[2024-05-23 16:51:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:51:41] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
[2024-05-23 16:51:41] [INFO ] Redundant transitions in 18 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 16:51:41] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 16:51:41] [INFO ] Invariant cache hit.
[2024-05-23 16:51:41] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34389ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34401ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35913 ms. Remains : 416/416 places, 1206/1206 transitions.
[2024-05-23 16:52:15] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {220=1, 304=1, 502=1, 676=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {208=1, 292=1, 490=1, 676=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[8] Max Struct:[+inf]
[2024-05-23 16:52:16] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 16:52:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1987 ms. (503 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 610 ms. (1636 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8] Max Struct:[+inf]
[2024-05-23 16:52:18] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 16:52:18] [INFO ] Invariant cache hit.
[2024-05-23 16:52:18] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:52:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:52:18] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-23 16:52:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:52:18] [INFO ] [Real]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-23 16:52:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:52:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-23 16:52:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:52:19] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-23 16:52:19] [INFO ] [Nat]Added 75 Read/Feed constraints in 40 ms returned sat
[2024-05-23 16:52:19] [INFO ] Deduced a trap composed of 135 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:52:19] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 3 ms to minimize.
[2024-05-23 16:52:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 382 ms
[2024-05-23 16:52:19] [INFO ] Computed and/alt/rep : 334/1253/332 causal constraints (skipped 347 transitions) in 60 ms.
[2024-05-23 16:52:19] [INFO ] Added : 4 causal constraints over 1 iterations in 135 ms. Result :sat
Minimization took 368 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 38 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 38 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 16:52:20] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 16:52:20] [INFO ] Invariant cache hit.
[2024-05-23 16:52:20] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-23 16:52:20] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 16:52:20] [INFO ] Invariant cache hit.
[2024-05-23 16:52:20] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:52:21] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
[2024-05-23 16:52:21] [INFO ] Redundant transitions in 15 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 16:52:21] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 16:52:21] [INFO ] Invariant cache hit.
[2024-05-23 16:52:21] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34281ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34291ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35828 ms. Remains : 416/416 places, 1206/1206 transitions.
[2024-05-23 16:52:56] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {220=1, 304=1, 502=1, 676=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {208=1, 292=1, 490=1, 676=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[8] Max Struct:[+inf]
RANDOM walk for 40006 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
[2024-05-23 16:52:56] [INFO ] Flatten gal took : 41 ms
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
[2024-05-23 16:52:56] [INFO ] Flatten gal took : 62 ms
[2024-05-23 16:52:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2917884094447542413.gal : 6 ms
[2024-05-23 16:52:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5632859701039975128.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/ReachabilityCardinality2917884094447542413.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5632859701039975128.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
Loading property file /tmp/ReachabilityCardinality5632859701039975128.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1994
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1994 after 1.22555e+06
Interrupted probabilistic random walk after 518747 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 1
Probabilistic random walk after 518747 steps, saw 318089 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
[2024-05-23 16:52:59] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 16:52:59] [INFO ] Invariant cache hit.
[2024-05-23 16:52:59] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/1014 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1014 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1015 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/1083 variables, 66/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1083 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1091 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1091 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1097 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 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) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/952 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 62/1014 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1014 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:53:00] [INFO ] Deduced a trap composed of 135 places in 156 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1083 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1083 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1091 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1091 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1097 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1097 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 510 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 860ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 39 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 416/416 places, 1206/1206 transitions.
RANDOM walk for 40006 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.22555e+06 after 2.64763e+10
Interrupted probabilistic random walk after 521799 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 521799 steps, saw 319961 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-05-23 16:53:03] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 16:53:03] [INFO ] Invariant cache hit.
[2024-05-23 16:53:03] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/1014 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1014 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1015 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/1083 variables, 66/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1083 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1091 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1091 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1097 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 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) 208/212 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 740/952 variables, 337/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 75/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/952 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 62/1014 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1014 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1015 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:53:03] [INFO ] Deduced a trap composed of 135 places in 155 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1083 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1083 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1091 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1091 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1097 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1097 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 493 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 804ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 39 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 39 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 16:53:04] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 16:53:04] [INFO ] Invariant cache hit.
[2024-05-23 16:53:04] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-23 16:53:04] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 16:53:04] [INFO ] Invariant cache hit.
[2024-05-23 16:53:04] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:53:05] [INFO ] Implicit Places using invariants and state equation in 1213 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
[2024-05-23 16:53:05] [INFO ] Redundant transitions in 14 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 16:53:05] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 16:53:05] [INFO ] Invariant cache hit.
[2024-05-23 16:53:05] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.64763e+10 after 7.78635e+13
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.78635e+13 after 2.21141e+14
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.21141e+14 after 2.21142e+14
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.21142e+14 after 4.51621e+14
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.51621e+14 after 8.93406e+14
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8.93406e+14 after 1.36059e+15
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.36059e+15 after 1.58074e+15
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.58074e+15 after 1.68232e+15
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34314ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34324ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35905 ms. Remains : 416/416 places, 1206/1206 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 416 transition count 670
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 548 place count 405 transition count 669
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 549 place count 404 transition count 669
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 549 place count 404 transition count 601
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 685 place count 336 transition count 601
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 939 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1003 place count 145 transition count 346
Iterating global reduction 3 with 64 rules applied. Total rules applied 1067 place count 145 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1068 place count 145 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1068 place count 145 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1070 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1133 place count 81 transition count 218
Iterating global reduction 4 with 63 rules applied. Total rules applied 1196 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1259 place count 18 transition count 92
Iterating global reduction 4 with 63 rules applied. Total rules applied 1322 place count 18 transition count 92
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1385 place count 18 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1385 place count 18 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1387 place count 17 transition count 28
Applied a total of 1387 rules in 26 ms. Remains 17 /416 variables (removed 399) and now considering 28/1206 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 28 rows 17 cols
[2024-05-23 16:53:40] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 16:53:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 16:53:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:53:40] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:53:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 16:53:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 16:53:40] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:53:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:53:40] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:53:40] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:53:40] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:53:40] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:53:40] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:53:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17342422899555361983.gal : 0 ms
[2024-05-23 16:53:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3062006416581152341.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/ReachabilityCardinality17342422899555361983.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3062006416581152341.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/ReachabilityCardinality3062006416581152341.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 126
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :126 after 642
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :642 after 13467
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :13467 after 44667
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :44667 after 106587
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :106587 after 229947
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :229947 after 476187
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :476187 after 968187
Detected timeout of ITS tools.
[2024-05-23 16:53:46] [INFO ] Flatten gal took : 28 ms
[2024-05-23 16:53:46] [INFO ] Applying decomposition
[2024-05-23 16:53:46] [INFO ] Flatten gal took : 25 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/graph13267186320341823626.txt' '-o' '/tmp/graph13267186320341823626.bin' '-w' '/tmp/graph13267186320341823626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13267186320341823626.bin' '-l' '-1' '-v' '-w' '/tmp/graph13267186320341823626.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:53:46] [INFO ] Decomposing Gal with order
[2024-05-23 16:53:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:53:46] [INFO ] Removed a total of 2059 redundant transitions.
[2024-05-23 16:53:46] [INFO ] Flatten gal took : 48 ms
[2024-05-23 16:53:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 831 labels/synchronizations in 50 ms.
[2024-05-23 16:53:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality696485847916296698.gal : 5 ms
[2024-05-23 16:53:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6417461081802052487.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/ReachabilityCardinality696485847916296698.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6417461081802052487.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 ...306
Loading property file /tmp/ReachabilityCardinality6417461081802052487.prop.
Detected timeout of ITS tools.
[2024-05-23 16:53:55] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:53:55] [INFO ] Applying decomposition
[2024-05-23 16:53:55] [INFO ] Flatten gal took : 1 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/graph4238812634080539861.txt' '-o' '/tmp/graph4238812634080539861.bin' '-w' '/tmp/graph4238812634080539861.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4238812634080539861.bin' '-l' '-1' '-v' '-w' '/tmp/graph4238812634080539861.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:53:55] [INFO ] Decomposing Gal with order
[2024-05-23 16:53:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:53:55] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-23 16:53:55] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:53:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-23 16:53:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3321868943200735362.gal : 1 ms
[2024-05-23 16:53:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9271442729506819801.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/ReachabilityCardinality3321868943200735362.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9271442729506819801.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 ...307
Loading property file /tmp/ReachabilityCardinality9271442729506819801.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 90
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :90 after 1083
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30151 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[8] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-13 in 155804 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-15
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 16:54:10] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
// Phase 1: matrix 748 rows 458 cols
[2024-05-23 16:54:10] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (2 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[+inf]
[2024-05-23 16:54:10] [INFO ] Flow matrix only has 748 transitions (discarded 552 similar events)
[2024-05-23 16:54:10] [INFO ] Invariant cache hit.
[2024-05-23 16:54:10] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:54:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:54:10] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-23 16:54:10] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 16:54:10] [INFO ] [Real]Added 90 Read/Feed constraints in 32 ms returned sat
[2024-05-23 16:54:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:54:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 16:54:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 16:54:10] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-23 16:54:10] [INFO ] [Nat]Added 90 Read/Feed constraints in 24 ms returned sat
[2024-05-23 16:54:10] [INFO ] Computed and/alt/rep : 222/1347/222 causal constraints (skipped 524 transitions) in 65 ms.
[2024-05-23 16:54:11] [INFO ] Added : 9 causal constraints over 3 iterations in 247 ms. Result :sat
Minimization took 403 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[+inf]
Support contains 1 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1300/1300 transitions.
Graph (complete) has 2232 edges and 458 vertex of which 455 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 455 transition count 1294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 11 place count 451 transition count 1284
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 451 transition count 1284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 447 transition count 1276
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 447 transition count 1276
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 443 transition count 1262
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 443 transition count 1262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 439 transition count 1254
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 439 transition count 1254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 435 transition count 1246
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 435 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 431 transition count 1238
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 431 transition count 1238
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 427 transition count 1230
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 427 transition count 1230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 424 transition count 1224
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 424 transition count 1224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 421 transition count 1218
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 421 transition count 1218
Applied a total of 75 rules in 108 ms. Remains 421 /458 variables (removed 37) and now considering 1218/1300 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 421/458 places, 1218/1300 transitions.
[2024-05-23 16:54:11] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {233=1, 324=1, 522=1, 683=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[12] Max Struct:[+inf]
[2024-05-23 16:54:11] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-23 16:54:11] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[12] Max Struct:[+inf]
RANDOM walk for 1000004 steps (2 resets) in 2031 ms. (492 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 601 ms. (1661 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[+inf]
[2024-05-23 16:54:14] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 16:54:14] [INFO ] Invariant cache hit.
[2024-05-23 16:54:14] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:54:14] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-23 16:54:14] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:54:14] [INFO ] [Real]Added 75 Read/Feed constraints in 29 ms returned sat
[2024-05-23 16:54:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:54:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 16:54:14] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-23 16:54:14] [INFO ] [Nat]Added 75 Read/Feed constraints in 28 ms returned sat
[2024-05-23 16:54:15] [INFO ] Deduced a trap composed of 113 places in 179 ms of which 2 ms to minimize.
[2024-05-23 16:54:15] [INFO ] Deduced a trap composed of 113 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:54:15] [INFO ] Deduced a trap composed of 88 places in 175 ms of which 3 ms to minimize.
[2024-05-23 16:54:15] [INFO ] Deduced a trap composed of 78 places in 175 ms of which 2 ms to minimize.
[2024-05-23 16:54:15] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 2 ms to minimize.
[2024-05-23 16:54:16] [INFO ] Deduced a trap composed of 73 places in 172 ms of which 2 ms to minimize.
[2024-05-23 16:54:16] [INFO ] Deduced a trap composed of 71 places in 169 ms of which 3 ms to minimize.
[2024-05-23 16:54:16] [INFO ] Deduced a trap composed of 70 places in 207 ms of which 3 ms to minimize.
[2024-05-23 16:54:16] [INFO ] Deduced a trap composed of 71 places in 171 ms of which 3 ms to minimize.
[2024-05-23 16:54:16] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 2 ms to minimize.
[2024-05-23 16:54:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1959 ms
[2024-05-23 16:54:16] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 60 ms.
[2024-05-23 16:54:17] [INFO ] Added : 8 causal constraints over 2 iterations in 209 ms. Result :sat
Minimization took 246 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 39 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 39 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 16:54:17] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 16:54:17] [INFO ] Invariant cache hit.
[2024-05-23 16:54:17] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-23 16:54:17] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 16:54:17] [INFO ] Invariant cache hit.
[2024-05-23 16:54:17] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:54:18] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
[2024-05-23 16:54:18] [INFO ] Redundant transitions in 19 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 16:54:18] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 16:54:18] [INFO ] Invariant cache hit.
[2024-05-23 16:54:18] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 16:54:32] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34229ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34238ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35764 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-23 16:54:53] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {233=1, 324=1, 522=1, 683=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[12] Max Struct:[+inf]
[2024-05-23 16:54:53] [INFO ] Flatten gal took : 33 ms
RANDOM walk for 40000 steps (8 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2024-05-23 16:54:53] [INFO ] Flatten gal took : 31 ms
[2024-05-23 16:54:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7850499050135825788.gal : 5 ms
[2024-05-23 16:54:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4958865303513578083.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/ReachabilityCardinality7850499050135825788.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4958865303513578083.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
Loading property file /tmp/ReachabilityCardinality4958865303513578083.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1994
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1994 after 1.22555e+06
Interrupted probabilistic random walk after 529713 steps, run timeout after 3002 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 529713 steps, saw 324814 distinct states, run finished after 3002 ms. (steps per millisecond=176 ) properties seen :0
[2024-05-23 16:54:56] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 16:54:56] [INFO ] Invariant cache hit.
[2024-05-23 16:54:56] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 556ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 39 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 421/421 places, 1218/1218 transitions.
RANDOM walk for 40008 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 524761 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 524761 steps, saw 321778 distinct states, run finished after 3002 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-23 16:55:00] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 16:55:00] [INFO ] Invariant cache hit.
[2024-05-23 16:55:00] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.22555e+06 after 2.64763e+10
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 556ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 39 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 39 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 16:55:00] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 16:55:00] [INFO ] Invariant cache hit.
[2024-05-23 16:55:01] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-23 16:55:01] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 16:55:01] [INFO ] Invariant cache hit.
[2024-05-23 16:55:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 16:55:02] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1452 ms to find 0 implicit places.
[2024-05-23 16:55:02] [INFO ] Redundant transitions in 20 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 16:55:02] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 16:55:02] [INFO ] Invariant cache hit.
[2024-05-23 16:55:02] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 16:55:16] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.64763e+10 after 7.78635e+13
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.78635e+13 after 2.43134e+14
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.43134e+14 after 3.44424e+14
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.44424e+14 after 6.39645e+14
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.39645e+14 after 1.13724e+15
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.13724e+15 after 1.1489e+15
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.1489e+15 after 1.87396e+15
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.87396e+15 after 1.11891e+16
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34295ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34305ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35823 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 21 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-23 16:55:36] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 16:55:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 16:55:36] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 16:55:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:55:36] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:55:36] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:55:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 16:55:36] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:55:36] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:55:36] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:55:36] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:55:36] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:55:36] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:55:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14453942674817091054.gal : 1 ms
[2024-05-23 16:55:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17790349218157894568.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/ReachabilityCardinality14453942674817091054.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17790349218157894568.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
Loading property file /tmp/ReachabilityCardinality17790349218157894568.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 207
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :207 after 2655
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2655 after 6615
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6615 after 14415
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :14415 after 29895
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :29895 after 60735
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :60735 after 122295
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :122295 after 245295
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :245295 after 491175
Detected timeout of ITS tools.
[2024-05-23 16:55:43] [INFO ] Flatten gal took : 24 ms
[2024-05-23 16:55:43] [INFO ] Applying decomposition
[2024-05-23 16:55:43] [INFO ] Flatten gal took : 25 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/graph7027966174402575607.txt' '-o' '/tmp/graph7027966174402575607.bin' '-w' '/tmp/graph7027966174402575607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7027966174402575607.bin' '-l' '-1' '-v' '-w' '/tmp/graph7027966174402575607.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:55:43] [INFO ] Decomposing Gal with order
[2024-05-23 16:55:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:55:43] [INFO ] Removed a total of 2082 redundant transitions.
[2024-05-23 16:55:43] [INFO ] Flatten gal took : 43 ms
[2024-05-23 16:55:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 897 labels/synchronizations in 19 ms.
[2024-05-23 16:55:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13294878394666667192.gal : 6 ms
[2024-05-23 16:55:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11399930945488448514.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/ReachabilityCardinality13294878394666667192.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11399930945488448514.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/ReachabilityCardinality11399930945488448514.prop.
Detected timeout of ITS tools.
[2024-05-23 16:55:51] [INFO ] Flatten gal took : 1 ms
[2024-05-23 16:55:51] [INFO ] Applying decomposition
[2024-05-23 16:55:51] [INFO ] Flatten gal took : 1 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/graph12791541769298238537.txt' '-o' '/tmp/graph12791541769298238537.bin' '-w' '/tmp/graph12791541769298238537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12791541769298238537.bin' '-l' '-1' '-v' '-w' '/tmp/graph12791541769298238537.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:55:51] [INFO ] Decomposing Gal with order
[2024-05-23 16:55:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:55:51] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-23 16:55:51] [INFO ] Flatten gal took : 5 ms
[2024-05-23 16:55:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2024-05-23 16:55:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15793564187446331846.gal : 1 ms
[2024-05-23 16:55:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12291977906592084732.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/ReachabilityCardinality15793564187446331846.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12291977906592084732.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/ReachabilityCardinality12291977906592084732.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 628
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30138 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[12] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-15 in 116634 ms.
[2024-05-23 16:56:06] [INFO ] Flatten gal took : 28 ms
[2024-05-23 16:56:06] [INFO ] Applying decomposition
[2024-05-23 16:56:06] [INFO ] Flatten gal took : 26 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/graph2617100151947317933.txt' '-o' '/tmp/graph2617100151947317933.bin' '-w' '/tmp/graph2617100151947317933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2617100151947317933.bin' '-l' '-1' '-v' '-w' '/tmp/graph2617100151947317933.weights' '-q' '0' '-e' '0.001'
[2024-05-23 16:56:06] [INFO ] Decomposing Gal with order
[2024-05-23 16:56:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 16:56:07] [INFO ] Removed a total of 2232 redundant transitions.
[2024-05-23 16:56:07] [INFO ] Flatten gal took : 43 ms
[2024-05-23 16:56:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 900 labels/synchronizations in 21 ms.
[2024-05-23 16:56:07] [INFO ] Time to serialize gal into /tmp/UpperBounds929566840163631586.gal : 4 ms
[2024-05-23 16:56:07] [INFO ] Time to serialize properties into /tmp/UpperBounds10132438599692427872.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/UpperBounds929566840163631586.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10132438599692427872.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/UpperBounds10132438599692427872.prop.
ITS-tools command line returned an error code 137
[2024-05-23 17:18:00] [INFO ] Flatten gal took : 27 ms
[2024-05-23 17:18:00] [INFO ] Time to serialize gal into /tmp/UpperBounds3733864172336609690.gal : 4 ms
[2024-05-23 17:18:00] [INFO ] Time to serialize properties into /tmp/UpperBounds3737430251054407200.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/UpperBounds3733864172336609690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3737430251054407200.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/UpperBounds3737430251054407200.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="FunctionPointer-PT-c008"
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 FunctionPointer-PT-c008, 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 r180-tall-171640603100293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c008.tgz
mv FunctionPointer-PT-c008 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 ;