About the Execution of ITS-Tools for FunctionPointer-PT-b002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | inf inf 2 1 inf inf 2 ? ? 0 inf 0 2 inf inf 2 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007300061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is FunctionPointer-PT-b002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007300061
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 391K May 29 14:32 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748740406977
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-b002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-01 01:13:29] [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]
[2025-06-01 01:13:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:13:30] [INFO ] Load time of PNML (sax parser for PT used): 313 ms
[2025-06-01 01:13:30] [INFO ] Transformed 306 places.
[2025-06-01 01:13:30] [INFO ] Transformed 840 transitions.
[2025-06-01 01:13:30] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 550 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Deduced a syphon composed of 84 places in 12 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b002-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-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, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:13:30] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2025-06-01 01:13:30] [INFO ] Computed 4 invariants in 48 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 2, 1, +inf, +inf, 2, +inf, +inf, +inf, 2, +inf, +inf, 2]
RANDOM walk for 10000 steps (18 resets) in 413 ms. (24 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (40 resets) in 262 ms. (380 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11, 16, 4, 4, 4, 2, 18, 1, 4, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 2, +inf, +inf]
[2025-06-01 01:13:31] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
[2025-06-01 01:13:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:31] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-01 01:13:31] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 01:13:31] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2025-06-01 01:13:32] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-01 01:13:32] [INFO ] [Real]Added 65 Read/Feed constraints in 46 ms returned sat
[2025-06-01 01:13:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-01 01:13:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:13:32] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2025-06-01 01:13:32] [INFO ] [Nat]Added 65 Read/Feed constraints in 76 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:33] [INFO ] Deduced a trap composed of 21 places in 392 ms of which 34 ms to minimize.
[2025-06-01 01:13:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 501 ms
[2025-06-01 01:13:33] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 154 ms.
[2025-06-01 01:13:33] [INFO ] Added : 4 causal constraints over 2 iterations in 346 ms. Result :sat
Minimization took 171 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:33] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 01:13:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:13:34] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2025-06-01 01:13:34] [INFO ] [Real]Added 65 Read/Feed constraints in 43 ms returned sat
[2025-06-01 01:13:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 01:13:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:13:34] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2025-06-01 01:13:34] [INFO ] [Nat]Added 65 Read/Feed constraints in 31 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:34] [INFO ] Deduced a trap composed of 21 places in 352 ms of which 26 ms to minimize.
[2025-06-01 01:13:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 402 ms
[2025-06-01 01:13:35] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 133 ms.
[2025-06-01 01:13:35] [INFO ] Added : 2 causal constraints over 1 iterations in 244 ms. Result :sat
Minimization took 159 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:35] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 01:13:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 13 ms returned sat
[2025-06-01 01:13:35] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2025-06-01 01:13:35] [INFO ] [Real]Added 65 Read/Feed constraints in 23 ms returned sat
[2025-06-01 01:13:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 01:13:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:13:36] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2025-06-01 01:13:36] [INFO ] [Nat]Added 65 Read/Feed constraints in 26 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:36] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 9 ms to minimize.
[2025-06-01 01:13:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2025-06-01 01:13:36] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 102 ms.
[2025-06-01 01:13:36] [INFO ] Added : 4 causal constraints over 2 iterations in 245 ms. Result :sat
Minimization took 165 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:37] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 01:13:37] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 01:13:37] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2025-06-01 01:13:37] [INFO ] [Real]Added 65 Read/Feed constraints in 20 ms returned sat
[2025-06-01 01:13:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-01 01:13:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:13:37] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2025-06-01 01:13:37] [INFO ] [Nat]Added 65 Read/Feed constraints in 26 ms returned sat
[2025-06-01 01:13:37] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 99 ms.
[2025-06-01 01:13:37] [INFO ] Added : 2 causal constraints over 1 iterations in 201 ms. Result :sat
Minimization took 167 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:38] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 01:13:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:13:38] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2025-06-01 01:13:38] [INFO ] [Real]Added 65 Read/Feed constraints in 23 ms returned sat
[2025-06-01 01:13:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 01:13:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:13:38] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2025-06-01 01:13:38] [INFO ] [Nat]Added 65 Read/Feed constraints in 26 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:38] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 9 ms to minimize.
[2025-06-01 01:13:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2025-06-01 01:13:39] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 44 ms.
[2025-06-01 01:13:39] [INFO ] Added : 1 causal constraints over 1 iterations in 104 ms. Result :sat
Minimization took 100 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:39] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:13:39] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-06-01 01:13:39] [INFO ] [Real]Added 65 Read/Feed constraints in 15 ms returned sat
[2025-06-01 01:13:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:39] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 01:13:39] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2025-06-01 01:13:39] [INFO ] [Nat]Added 65 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:39] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 6 ms to minimize.
[2025-06-01 01:13:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2025-06-01 01:13:39] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 41 ms.
[2025-06-01 01:13:40] [INFO ] Added : 2 causal constraints over 1 iterations in 103 ms. Result :sat
Minimization took 105 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:13:40] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2025-06-01 01:13:40] [INFO ] [Real]Added 65 Read/Feed constraints in 27 ms returned sat
[2025-06-01 01:13:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:40] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:13:40] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2025-06-01 01:13:40] [INFO ] [Nat]Added 65 Read/Feed constraints in 29 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:40] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 18 ms to minimize.
[2025-06-01 01:13:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2025-06-01 01:13:41] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 57 ms.
[2025-06-01 01:13:41] [INFO ] Added : 2 causal constraints over 1 iterations in 130 ms. Result :sat
Minimization took 116 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:41] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 01:13:41] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:13:41] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2025-06-01 01:13:41] [INFO ] [Real]Added 65 Read/Feed constraints in 17 ms returned sat
[2025-06-01 01:13:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 01:13:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:13:41] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2025-06-01 01:13:41] [INFO ] [Nat]Added 65 Read/Feed constraints in 24 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:42] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:42] [INFO ] Deduced a trap composed of 51 places in 173 ms of which 19 ms to minimize.
[2025-06-01 01:13:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 418 ms
[2025-06-01 01:13:42] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 36 ms.
[2025-06-01 01:13:42] [INFO ] Added : 2 causal constraints over 1 iterations in 109 ms. Result :sat
Minimization took 109 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:42] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:42] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:13:42] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2025-06-01 01:13:42] [INFO ] [Real]Added 65 Read/Feed constraints in 25 ms returned sat
[2025-06-01 01:13:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 01:13:42] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:13:43] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2025-06-01 01:13:43] [INFO ] [Nat]Added 65 Read/Feed constraints in 29 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:43] [INFO ] Deduced a trap composed of 21 places in 367 ms of which 27 ms to minimize.
[2025-06-01 01:13:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2025-06-01 01:13:43] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 50 ms.
[2025-06-01 01:13:43] [INFO ] Added : 2 causal constraints over 1 iterations in 149 ms. Result :sat
Minimization took 164 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:44] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 01:13:44] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 01:13:44] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2025-06-01 01:13:44] [INFO ] [Real]Added 65 Read/Feed constraints in 20 ms returned sat
[2025-06-01 01:13:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:13:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 01:13:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 01:13:44] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-06-01 01:13:44] [INFO ] [Nat]Added 65 Read/Feed constraints in 20 ms returned sat
[2025-06-01 01:13:44] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 50 ms.
[2025-06-01 01:13:44] [INFO ] Added : 1 causal constraints over 1 iterations in 134 ms. Result :sat
Minimization took 140 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11, 16, 4, 4, 4, 2, 18, 1, 4, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 2, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11, 16, 4, 4, 4, 2, 18, 1, 4, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 2, +inf, +inf]
Support contains 10 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 190 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 190 transition count 600
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 73 place count 166 transition count 448
Iterating global reduction 1 with 24 rules applied. Total rules applied 97 place count 166 transition count 448
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 123 place count 166 transition count 422
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 137 place count 152 transition count 394
Iterating global reduction 2 with 14 rules applied. Total rules applied 151 place count 152 transition count 394
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 155 place count 152 transition count 390
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 159 place count 148 transition count 382
Iterating global reduction 3 with 4 rules applied. Total rules applied 163 place count 148 transition count 382
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 167 place count 144 transition count 366
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 144 transition count 366
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 174 place count 141 transition count 360
Iterating global reduction 3 with 3 rules applied. Total rules applied 177 place count 141 transition count 360
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 179 place count 139 transition count 352
Iterating global reduction 3 with 2 rules applied. Total rules applied 181 place count 139 transition count 352
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 183 place count 137 transition count 344
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 137 transition count 344
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 187 place count 135 transition count 340
Iterating global reduction 3 with 2 rules applied. Total rules applied 189 place count 135 transition count 340
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 191 place count 133 transition count 336
Iterating global reduction 3 with 2 rules applied. Total rules applied 193 place count 133 transition count 336
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 195 place count 131 transition count 332
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 131 transition count 332
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 199 place count 129 transition count 328
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 129 transition count 328
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 203 place count 127 transition count 324
Iterating global reduction 3 with 2 rules applied. Total rules applied 205 place count 127 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 217 place count 127 transition count 312
Applied a total of 217 rules in 256 ms. Remains 127 /222 variables (removed 95) and now considering 312/648 (removed 336) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 127/222 places, 312/648 transitions.
[2025-06-01 01:13:45] [INFO ] Flow matrix only has 203 transitions (discarded 109 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {27=1, 101=1, 157=1, 200=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 5 ms.
This minimized invariant on transitions {24=1, 98=1, 138=1, 190=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 10) seen :[0, 2147483647, 0, 2, 6, 0, 2147483647, 0, 7, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[11, +inf, 4, 4, 6, 2, +inf, 1, 7, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 2, +inf, +inf]
[2025-06-01 01:13:45] [INFO ] Flow matrix only has 203 transitions (discarded 109 similar events)
// Phase 1: matrix 203 rows 127 cols
[2025-06-01 01:13:45] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[11, +inf, 4, 4, 6, 2, +inf, 1, 7, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 2, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 2186 ms. (457 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-10 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-01 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 8000007 steps (16 resets) in 6066 ms. (1318 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1715, 766, 4, 1562, 11, 1, 1826, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, 2, +inf, +inf]
[2025-06-01 01:13:53] [INFO ] Flow matrix only has 203 transitions (discarded 109 similar events)
[2025-06-01 01:13:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:53] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:13:53] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-06-01 01:13:53] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-01 01:13:53] [INFO ] [Real]Added 32 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:13:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:13:54] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:13:54] [INFO ] [Nat]Added 32 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:13:54] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 140 transitions) in 15 ms.
[2025-06-01 01:13:54] [INFO ] Added : 21 causal constraints over 6 iterations in 132 ms. Result :sat
Minimization took 92 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:54] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2025-06-01 01:13:54] [INFO ] [Real]Added 32 Read/Feed constraints in 13 ms returned sat
[2025-06-01 01:13:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:54] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2025-06-01 01:13:54] [INFO ] [Nat]Added 32 Read/Feed constraints in 13 ms returned sat
[2025-06-01 01:13:54] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 140 transitions) in 25 ms.
[2025-06-01 01:13:54] [INFO ] Added : 18 causal constraints over 5 iterations in 187 ms. Result :sat
Minimization took 77 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:55] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 01:13:55] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2025-06-01 01:13:55] [INFO ] [Real]Added 32 Read/Feed constraints in 14 ms returned sat
[2025-06-01 01:13:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 01:13:55] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2025-06-01 01:13:55] [INFO ] [Nat]Added 32 Read/Feed constraints in 14 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:55] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 16 ms to minimize.
[2025-06-01 01:13:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2025-06-01 01:13:55] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 140 transitions) in 27 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:55] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:56] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 9 ms to minimize.
[2025-06-01 01:13:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 420 ms
[2025-06-01 01:13:56] [INFO ] Added : 9 causal constraints over 3 iterations in 568 ms. Result :sat
Minimization took 72 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:56] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-06-01 01:13:56] [INFO ] [Real]Added 32 Read/Feed constraints in 21 ms returned sat
[2025-06-01 01:13:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:56] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2025-06-01 01:13:56] [INFO ] [Nat]Added 32 Read/Feed constraints in 17 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:56] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:57] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 15 ms to minimize.
[2025-06-01 01:13:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 380 ms
[2025-06-01 01:13:57] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 140 transitions) in 26 ms.
[2025-06-01 01:13:57] [INFO ] Added : 2 causal constraints over 1 iterations in 83 ms. Result :sat
Minimization took 71 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:57] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-06-01 01:13:57] [INFO ] [Real]Added 32 Read/Feed constraints in 14 ms returned sat
[2025-06-01 01:13:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:57] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2025-06-01 01:13:57] [INFO ] [Nat]Added 32 Read/Feed constraints in 18 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:57] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:58] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 20 ms to minimize.
[2025-06-01 01:13:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 416 ms
[2025-06-01 01:13:58] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 140 transitions) in 23 ms.
[2025-06-01 01:13:58] [INFO ] Added : 5 causal constraints over 2 iterations in 101 ms. Result :sat
Minimization took 68 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:58] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2025-06-01 01:13:58] [INFO ] [Real]Added 32 Read/Feed constraints in 11 ms returned sat
[2025-06-01 01:13:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:58] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2025-06-01 01:13:58] [INFO ] [Nat]Added 32 Read/Feed constraints in 15 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:58] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 15 ms to minimize.
[2025-06-01 01:13:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2025-06-01 01:13:58] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 140 transitions) in 27 ms.
[2025-06-01 01:13:58] [INFO ] Added : 4 causal constraints over 1 iterations in 84 ms. Result :sat
Minimization took 73 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:59] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-06-01 01:13:59] [INFO ] [Real]Added 32 Read/Feed constraints in 17 ms returned sat
[2025-06-01 01:13:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:59] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2025-06-01 01:13:59] [INFO ] [Nat]Added 32 Read/Feed constraints in 14 ms returned sat
[2025-06-01 01:13:59] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 140 transitions) in 25 ms.
[2025-06-01 01:13:59] [INFO ] Added : 19 causal constraints over 6 iterations in 202 ms. Result :sat
Minimization took 80 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:13:59] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2025-06-01 01:13:59] [INFO ] [Real]Added 32 Read/Feed constraints in 13 ms returned sat
[2025-06-01 01:13:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:13:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-01 01:14:00] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2025-06-01 01:14:00] [INFO ] [Nat]Added 32 Read/Feed constraints in 10 ms returned sat
[2025-06-01 01:14:00] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 140 transitions) in 26 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:14:00] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 18 ms to minimize.
[2025-06-01 01:14:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2025-06-01 01:14:00] [INFO ] Added : 12 causal constraints over 5 iterations in 390 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1715, 766, 4, 1562, 11, 1, 1826, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, 2, +inf, +inf]
FORMULA FunctionPointer-PT-b002-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1715, 766, 15, 1562, 15, 1826, 16] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 312/312 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 308
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 308
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 304
Applied a total of 8 rules in 22 ms. Remains 125 /127 variables (removed 2) and now considering 304/312 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 125/127 places, 304/312 transitions.
[2025-06-01 01:14:23] [INFO ] Flow matrix only has 199 transitions (discarded 105 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {25=1, 95=1, 151=1, 197=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {28=1, 98=1, 138=1, 191=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 7) seen :[0, 0, 2, 0, 0, 0, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[1715, 766, 15, 1562, 15, 1826, 16] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:14:24] [INFO ] Flow matrix only has 199 transitions (discarded 105 similar events)
// Phase 1: matrix 199 rows 125 cols
[2025-06-01 01:14:24] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1715, 766, 15, 1562, 15, 1826, 16] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2392 ms. (417 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 4546 ms. (1539 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1715, 7569, 15, 1562, 15, 1826, 16] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:14:31] [INFO ] Flow matrix only has 199 transitions (discarded 105 similar events)
[2025-06-01 01:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:14:31] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:14:31] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-06-01 01:14:31] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-01 01:14:31] [INFO ] [Real]Added 32 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:14:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:14:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:14:31] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-06-01 01:14:31] [INFO ] [Nat]Added 32 Read/Feed constraints in 14 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:14:31] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 16 ms to minimize.
[2025-06-01 01:14:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2025-06-01 01:14:31] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 136 transitions) in 24 ms.
[2025-06-01 01:14:31] [INFO ] Added : 16 causal constraints over 5 iterations in 167 ms. Result :sat
Minimization took 75 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:14:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:14:31] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2025-06-01 01:14:31] [INFO ] [Real]Added 32 Read/Feed constraints in 13 ms returned sat
[2025-06-01 01:14:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:14:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 01:14:32] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2025-06-01 01:14:32] [INFO ] [Nat]Added 32 Read/Feed constraints in 13 ms returned sat
[2025-06-01 01:14:32] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 136 transitions) in 24 ms.
[2025-06-01 01:14:32] [INFO ] Added : 21 causal constraints over 6 iterations in 202 ms. Result :sat
Minimization took 79 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:14:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:14:32] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2025-06-01 01:14:32] [INFO ] [Real]Added 32 Read/Feed constraints in 11 ms returned sat
[2025-06-01 01:14:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:14:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:14:32] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2025-06-01 01:14:32] [INFO ] [Nat]Added 32 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:14:33] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 15 ms to minimize.
[2025-06-01 01:14:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2025-06-01 01:14:33] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 136 transitions) in 32 ms.
[2025-06-01 01:14:33] [INFO ] Added : 11 causal constraints over 4 iterations in 157 ms. Result :sat
Minimization took 73 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:14:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:14:33] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-06-01 01:14:33] [INFO ] [Real]Added 32 Read/Feed constraints in 14 ms returned sat
[2025-06-01 01:14:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:14:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:14:33] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2025-06-01 01:14:33] [INFO ] [Nat]Added 32 Read/Feed constraints in 12 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:14:33] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 14 ms to minimize.
[2025-06-01 01:14:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2025-06-01 01:14:33] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 136 transitions) in 22 ms.
[2025-06-01 01:14:34] [INFO ] Added : 23 causal constraints over 7 iterations in 211 ms. Result :sat
Minimization took 84 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:14:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:14:34] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2025-06-01 01:14:34] [INFO ] [Real]Added 32 Read/Feed constraints in 12 ms returned sat
[2025-06-01 01:14:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:14:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:14:34] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-06-01 01:14:34] [INFO ] [Nat]Added 32 Read/Feed constraints in 12 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:14:34] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 18 ms to minimize.
[2025-06-01 01:14:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2025-06-01 01:14:34] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 136 transitions) in 23 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:14:35] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 18 ms to minimize.
[2025-06-01 01:14:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2025-06-01 01:14:35] [INFO ] Added : 22 causal constraints over 7 iterations in 452 ms. Result :sat
Minimization took 86 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:14:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:14:35] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2025-06-01 01:14:35] [INFO ] [Real]Added 32 Read/Feed constraints in 13 ms returned sat
[2025-06-01 01:14:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:14:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:14:35] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2025-06-01 01:14:35] [INFO ] [Nat]Added 32 Read/Feed constraints in 12 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:14:35] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 15 ms to minimize.
[2025-06-01 01:14:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2025-06-01 01:14:35] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 136 transitions) in 24 ms.
[2025-06-01 01:14:36] [INFO ] Added : 22 causal constraints over 7 iterations in 209 ms. Result :sat
Minimization took 85 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:14:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:14:36] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2025-06-01 01:14:36] [INFO ] [Real]Added 32 Read/Feed constraints in 12 ms returned sat
[2025-06-01 01:14:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:14:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:14:36] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2025-06-01 01:14:36] [INFO ] [Nat]Added 32 Read/Feed constraints in 15 ms returned sat
[2025-06-01 01:14:36] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 136 transitions) in 23 ms.
[2025-06-01 01:14:36] [INFO ] Added : 7 causal constraints over 3 iterations in 123 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1715, 7569, 15, 1562, 15, 1826, 16] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1715, 144536, 49, 1562, 15, 1826, 16] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 304/304 transitions.
Applied a total of 0 rules in 11 ms. Remains 125 /125 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 125/125 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 304/304 transitions.
Applied a total of 0 rules in 11 ms. Remains 125 /125 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2025-06-01 01:15:28] [INFO ] Flow matrix only has 199 transitions (discarded 105 similar events)
[2025-06-01 01:15:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:15:29] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-01 01:15:29] [INFO ] Flow matrix only has 199 transitions (discarded 105 similar events)
[2025-06-01 01:15:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:15:29] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-01 01:15:29] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:15:29] [INFO ] Redundant transitions in 37 ms returned []
Running 302 sub problems to find dead transitions.
[2025-06-01 01:15:29] [INFO ] Flow matrix only has 199 transitions (discarded 105 similar events)
[2025-06-01 01:15:29] [INFO ] Invariant cache hit.
[2025-06-01 01:15:29] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 199/322 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 32/158 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (OVERLAPS) 2/324 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 324/324 variables, and 160 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 125/125 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 199/322 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 32/158 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 32/190 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:16:06] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:16:06] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:16:06] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:16:06] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:16:06] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:16:06] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:16:06] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 7/197 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 2/324 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 270/469 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:16:23] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 470 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 125/125 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 60387ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60400ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61294 ms. Remains : 125/125 places, 304/304 transitions.
[2025-06-01 01:16:30] [INFO ] Flow matrix only has 199 transitions (discarded 105 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {25=1, 95=1, 151=1, 197=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {28=1, 98=1, 138=1, 191=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 7) seen :[40, 2147483647, 3, 0, 0, 0, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[1715, +inf, 49, 1562, 15, 1826, 16] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:16:30] [INFO ] Flow matrix only has 199 transitions (discarded 105 similar events)
[2025-06-01 01:16:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1715, +inf, 49, 1562, 15, 1826, 16] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1958 ms. (510 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 6000005 steps (12 resets) in 3604 ms. (1664 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7936, 1571, 1562, 15, 1826, 2175] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:16:35] [INFO ] Flow matrix only has 199 transitions (discarded 105 similar events)
[2025-06-01 01:16:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:16:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:16:36] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2025-06-01 01:16:36] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-01 01:16:36] [INFO ] [Real]Added 32 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:16:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:16:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:16:36] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:16:36] [INFO ] [Nat]Added 32 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:16:36] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 10 ms to minimize.
[2025-06-01 01:16:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2025-06-01 01:16:36] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 136 transitions) in 15 ms.
[2025-06-01 01:16:36] [INFO ] Added : 16 causal constraints over 5 iterations in 109 ms. Result :sat
Minimization took 51 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:16:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:16:36] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2025-06-01 01:16:36] [INFO ] [Real]Added 32 Read/Feed constraints in 9 ms returned sat
[2025-06-01 01:16:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:16:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:16:36] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-01 01:16:36] [INFO ] [Nat]Added 32 Read/Feed constraints in 10 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:16:36] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 11 ms to minimize.
[2025-06-01 01:16:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2025-06-01 01:16:36] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 136 transitions) in 17 ms.
[2025-06-01 01:16:37] [INFO ] Added : 11 causal constraints over 4 iterations in 110 ms. Result :sat
Minimization took 57 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:16:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:16:37] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-06-01 01:16:37] [INFO ] [Real]Added 32 Read/Feed constraints in 10 ms returned sat
[2025-06-01 01:16:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:16:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:16:37] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-06-01 01:16:37] [INFO ] [Nat]Added 32 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:16:37] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 12 ms to minimize.
[2025-06-01 01:16:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2025-06-01 01:16:37] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 136 transitions) in 17 ms.
[2025-06-01 01:16:37] [INFO ] Added : 23 causal constraints over 7 iterations in 181 ms. Result :sat
Minimization took 84 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:16:37] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:16:38] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2025-06-01 01:16:38] [INFO ] [Real]Added 32 Read/Feed constraints in 10 ms returned sat
[2025-06-01 01:16:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:16:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:16:38] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2025-06-01 01:16:38] [INFO ] [Nat]Added 32 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:16:38] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 18 ms to minimize.
[2025-06-01 01:16:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2025-06-01 01:16:38] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 136 transitions) in 23 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:16:38] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 18 ms to minimize.
[2025-06-01 01:16:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2025-06-01 01:16:38] [INFO ] Added : 22 causal constraints over 7 iterations in 445 ms. Result :sat
Minimization took 84 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:16:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:16:39] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-06-01 01:16:39] [INFO ] [Real]Added 32 Read/Feed constraints in 14 ms returned sat
[2025-06-01 01:16:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:16:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:16:39] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2025-06-01 01:16:39] [INFO ] [Nat]Added 32 Read/Feed constraints in 12 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:16:39] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 15 ms to minimize.
[2025-06-01 01:16:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2025-06-01 01:16:39] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 136 transitions) in 21 ms.
[2025-06-01 01:16:39] [INFO ] Added : 22 causal constraints over 7 iterations in 210 ms. Result :sat
Minimization took 86 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:16:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:16:40] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-06-01 01:16:40] [INFO ] [Real]Added 32 Read/Feed constraints in 13 ms returned sat
[2025-06-01 01:16:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:16:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:16:40] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2025-06-01 01:16:40] [INFO ] [Nat]Added 32 Read/Feed constraints in 14 ms returned sat
[2025-06-01 01:16:40] [INFO ] Computed and/alt/rep : 63/314/61 causal constraints (skipped 136 transitions) in 23 ms.
[2025-06-01 01:16:40] [INFO ] Added : 7 causal constraints over 3 iterations in 123 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7936, 1571, 1562, 15, 1826, 2175] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[93653, 1571, 1562, 15, 1826, 2175] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 304/304 transitions.
Graph (complete) has 521 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 123 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 123 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 122 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 122 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 121 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 121 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 120 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 120 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 119 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 119 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 118 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 118 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 117 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 117 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 116 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 116 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 115 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 115 transition count 282
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 114 transition count 280
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 114 transition count 280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 113 transition count 278
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 113 transition count 278
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 112 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 112 transition count 276
Applied a total of 25 rules in 40 ms. Remains 112 /125 variables (removed 13) and now considering 276/304 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 112/125 places, 276/304 transitions.
[2025-06-01 01:17:29] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {30=1, 90=1, 143=1, 176=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {26=1, 86=1, 123=1, 169=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :[52, 3, 0, 0, 0, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[93653, 1571, 1562, 15, 1826, 2175] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:17:29] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
// Phase 1: matrix 178 rows 112 cols
[2025-06-01 01:17:29] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[93653, 1571, 1562, 15, 1826, 2175] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2058 ms. (485 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3785 ms. (1584 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[93653, 1571, 1562, 529, 1826, 2175] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:17:35] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:17:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:17:35] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:17:35] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-06-01 01:17:35] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-01 01:17:35] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:17:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:17:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:17:36] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-06-01 01:17:36] [INFO ] [Nat]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:17:36] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 01:17:36] [INFO ] Added : 17 causal constraints over 5 iterations in 96 ms. Result :sat
Minimization took 45 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:17:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:17:36] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2025-06-01 01:17:36] [INFO ] [Real]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:17:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:17:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:17:36] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-06-01 01:17:36] [INFO ] [Nat]Added 28 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:17:36] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 10 ms to minimize.
[2025-06-01 01:17:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2025-06-01 01:17:36] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 01:17:36] [INFO ] Added : 25 causal constraints over 6 iterations in 132 ms. Result :sat
Minimization took 62 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:17:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:17:36] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-06-01 01:17:36] [INFO ] [Real]Added 28 Read/Feed constraints in 9 ms returned sat
[2025-06-01 01:17:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:17:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:17:37] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-06-01 01:17:37] [INFO ] [Nat]Added 28 Read/Feed constraints in 10 ms returned sat
[2025-06-01 01:17:37] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 14 ms.
[2025-06-01 01:17:37] [INFO ] Added : 29 causal constraints over 8 iterations in 159 ms. Result :sat
Minimization took 69 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:17:37] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:17:37] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2025-06-01 01:17:37] [INFO ] [Real]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:17:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:17:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:17:37] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2025-06-01 01:17:37] [INFO ] [Nat]Added 28 Read/Feed constraints in 10 ms returned sat
[2025-06-01 01:17:37] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 15 ms.
[2025-06-01 01:17:37] [INFO ] Added : 29 causal constraints over 7 iterations in 157 ms. Result :sat
Minimization took 79 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:17:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:17:37] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2025-06-01 01:17:37] [INFO ] [Real]Added 28 Read/Feed constraints in 11 ms returned sat
[2025-06-01 01:17:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:17:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:17:38] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2025-06-01 01:17:38] [INFO ] [Nat]Added 28 Read/Feed constraints in 14 ms returned sat
[2025-06-01 01:17:38] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 21 ms.
[2025-06-01 01:17:38] [INFO ] Added : 12 causal constraints over 4 iterations in 134 ms. Result :sat
Minimization took 72 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:17:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:17:38] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2025-06-01 01:17:38] [INFO ] [Real]Added 28 Read/Feed constraints in 10 ms returned sat
[2025-06-01 01:17:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:17:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:17:38] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2025-06-01 01:17:38] [INFO ] [Nat]Added 28 Read/Feed constraints in 9 ms returned sat
[2025-06-01 01:17:38] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 20 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:17:39] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 16 ms to minimize.
[2025-06-01 01:17:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2025-06-01 01:17:39] [INFO ] Added : 7 causal constraints over 4 iterations in 322 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[93653, 1571, 1562, 529, 1826, 2175] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[93653, 1571, 1562, 529, 1826, 2175] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 276/276 transitions.
Applied a total of 0 rules in 8 ms. Remains 112 /112 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 112/112 places, 276/276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 276/276 transitions.
Applied a total of 0 rules in 8 ms. Remains 112 /112 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2025-06-01 01:17:50] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:17:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:17:50] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-01 01:17:50] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:17:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:17:51] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-01 01:17:51] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:17:51] [INFO ] Redundant transitions in 7 ms returned []
Running 274 sub problems to find dead transitions.
[2025-06-01 01:17:51] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:17:51] [INFO ] Invariant cache hit.
[2025-06-01 01:17:51] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 178/289 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 1/290 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 143 constraints, problems are : Problem set: 0 solved, 274 unsolved in 29006 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 178/289 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:28] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:28] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:29] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:29] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:29] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:29] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:29] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:29] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 8/182 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 1/290 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 242/425 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 425 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 59213ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 59216ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59889 ms. Remains : 112/112 places, 276/276 transitions.
[2025-06-01 01:18:50] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {30=1, 90=1, 143=1, 176=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {26=1, 86=1, 123=1, 169=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :[0, 3, 3, 3, 4, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[93653, 1571, 1562, 529, 1826, 2175] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:18:50] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:18:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[93653, 1571, 1562, 529, 1826, 2175] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1984 ms. (503 steps per ms)
BEST_FIRST walk for 6000005 steps (12 resets) in 3783 ms. (1585 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[93653, 1571, 1677, 529, 1826, 2273] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:18:56] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:18:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:18:56] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:18:56] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-06-01 01:18:56] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-01 01:18:56] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:18:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:18:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:18:56] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2025-06-01 01:18:56] [INFO ] [Nat]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:18:56] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 12 ms.
[2025-06-01 01:18:56] [INFO ] Added : 17 causal constraints over 5 iterations in 94 ms. Result :sat
Minimization took 49 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:18:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:18:57] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-06-01 01:18:57] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:18:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:18:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:18:57] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-01 01:18:57] [INFO ] [Nat]Added 28 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:57] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 13 ms to minimize.
[2025-06-01 01:18:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2025-06-01 01:18:57] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 21 ms.
[2025-06-01 01:18:57] [INFO ] Added : 25 causal constraints over 6 iterations in 185 ms. Result :sat
Minimization took 86 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:18:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:18:57] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-06-01 01:18:57] [INFO ] [Real]Added 28 Read/Feed constraints in 12 ms returned sat
[2025-06-01 01:18:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:18:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:18:58] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2025-06-01 01:18:58] [INFO ] [Nat]Added 28 Read/Feed constraints in 13 ms returned sat
[2025-06-01 01:18:58] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 20 ms.
[2025-06-01 01:18:58] [INFO ] Added : 29 causal constraints over 8 iterations in 217 ms. Result :sat
Minimization took 97 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:18:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:18:58] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-06-01 01:18:58] [INFO ] [Real]Added 28 Read/Feed constraints in 11 ms returned sat
[2025-06-01 01:18:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:18:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:18:58] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2025-06-01 01:18:58] [INFO ] [Nat]Added 28 Read/Feed constraints in 11 ms returned sat
[2025-06-01 01:18:58] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 22 ms.
[2025-06-01 01:18:58] [INFO ] Added : 29 causal constraints over 7 iterations in 205 ms. Result :sat
Minimization took 83 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:18:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:18:59] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2025-06-01 01:18:59] [INFO ] [Real]Added 28 Read/Feed constraints in 12 ms returned sat
[2025-06-01 01:18:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:18:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:18:59] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-06-01 01:18:59] [INFO ] [Nat]Added 28 Read/Feed constraints in 13 ms returned sat
[2025-06-01 01:18:59] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 19 ms.
[2025-06-01 01:18:59] [INFO ] Added : 12 causal constraints over 4 iterations in 139 ms. Result :sat
Minimization took 69 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:18:59] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:18:59] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-06-01 01:18:59] [INFO ] [Real]Added 28 Read/Feed constraints in 10 ms returned sat
[2025-06-01 01:18:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:18:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 01:18:59] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2025-06-01 01:18:59] [INFO ] [Nat]Added 28 Read/Feed constraints in 10 ms returned sat
[2025-06-01 01:18:59] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:19:00] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 16 ms to minimize.
[2025-06-01 01:19:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2025-06-01 01:19:00] [INFO ] Added : 7 causal constraints over 4 iterations in 300 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[93653, 1571, 1677, 529, 1826, 2273] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[93653, 1571, 1677, 529, 1826, 2273] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 276/276 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 112/112 places, 276/276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 276/276 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2025-06-01 01:19:10] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:19:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:19:10] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-01 01:19:10] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:19:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:19:10] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-01 01:19:11] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:19:11] [INFO ] Redundant transitions in 4 ms returned []
Running 274 sub problems to find dead transitions.
[2025-06-01 01:19:11] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:19:11] [INFO ] Invariant cache hit.
[2025-06-01 01:19:11] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 178/289 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 1/290 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 143 constraints, problems are : Problem set: 0 solved, 274 unsolved in 20212 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 178/289 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:19:37] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:19:37] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:19:37] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:19:37] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:19:37] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:19:37] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:19:37] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:19:37] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 8/182 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 1/290 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 242/425 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 425 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 50333ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 50334ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51042 ms. Remains : 112/112 places, 276/276 transitions.
[2025-06-01 01:20:01] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {30=1, 90=1, 143=1, 176=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 86=1, 123=1, 169=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 6) seen :[0, 2, 0, 0, 0, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[93653, 1571, 1677, 529, 1826, 2273] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:20:01] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:20:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[93653, 1571, 1677, 529, 1826, 2273] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1760 ms. (567 steps per ms)
BEST_FIRST walk for 6000004 steps (12 resets) in 3649 ms. (1643 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[93653, 1571, 1677, 565, 1826, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:20:07] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:20:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:20:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:20:07] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-06-01 01:20:07] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-01 01:20:07] [INFO ] [Real]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:20:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:20:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:20:07] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:20:07] [INFO ] [Nat]Added 28 Read/Feed constraints in 14 ms returned sat
[2025-06-01 01:20:07] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 01:20:07] [INFO ] Added : 17 causal constraints over 5 iterations in 103 ms. Result :sat
Minimization took 53 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:20:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:20:07] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2025-06-01 01:20:07] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:20:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:20:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:20:07] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-06-01 01:20:07] [INFO ] [Nat]Added 28 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:20:07] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 9 ms to minimize.
[2025-06-01 01:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2025-06-01 01:20:07] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 01:20:08] [INFO ] Added : 25 causal constraints over 6 iterations in 121 ms. Result :sat
Minimization took 60 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:20:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:20:08] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2025-06-01 01:20:08] [INFO ] [Real]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:20:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:20:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:20:08] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-06-01 01:20:08] [INFO ] [Nat]Added 28 Read/Feed constraints in 10 ms returned sat
[2025-06-01 01:20:08] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 01:20:08] [INFO ] Added : 29 causal constraints over 8 iterations in 145 ms. Result :sat
Minimization took 59 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:20:08] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:20:08] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-06-01 01:20:08] [INFO ] [Real]Added 28 Read/Feed constraints in 9 ms returned sat
[2025-06-01 01:20:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:20:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:20:08] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-06-01 01:20:08] [INFO ] [Nat]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:20:08] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 01:20:08] [INFO ] Added : 29 causal constraints over 7 iterations in 133 ms. Result :sat
Minimization took 54 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:20:09] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:20:09] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:20:09] [INFO ] [Real]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:20:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:20:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:20:09] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 01:20:09] [INFO ] [Nat]Added 28 Read/Feed constraints in 10 ms returned sat
[2025-06-01 01:20:09] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 01:20:09] [INFO ] Added : 12 causal constraints over 4 iterations in 87 ms. Result :sat
Minimization took 46 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:20:09] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:20:09] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2025-06-01 01:20:09] [INFO ] [Real]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:20:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:20:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:20:09] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 01:20:09] [INFO ] [Nat]Added 28 Read/Feed constraints in 6 ms returned sat
[2025-06-01 01:20:09] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 14 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:20:09] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 10 ms to minimize.
[2025-06-01 01:20:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2025-06-01 01:20:09] [INFO ] Added : 7 causal constraints over 4 iterations in 207 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[93653, 1571, 1677, 565, 1826, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[93653, 1571, 1677, 565, 1826, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 276/276 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 112/112 places, 276/276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 276/276 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2025-06-01 01:20:20] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:20:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:20:21] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-01 01:20:21] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:20:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:20:21] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-01 01:20:21] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:20:21] [INFO ] Redundant transitions in 2 ms returned []
Running 274 sub problems to find dead transitions.
[2025-06-01 01:20:21] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:20:21] [INFO ] Invariant cache hit.
[2025-06-01 01:20:21] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 178/289 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 1/290 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 143 constraints, problems are : Problem set: 0 solved, 274 unsolved in 20000 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 178/289 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:20:47] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:20:47] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:20:47] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:20:47] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:20:47] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:20:47] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:20:47] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:20:47] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 8/182 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 1/290 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 242/425 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 425 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 50127ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 50128ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50691 ms. Remains : 112/112 places, 276/276 transitions.
[2025-06-01 01:21:11] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {30=1, 90=1, 143=1, 176=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 86=1, 123=1, 169=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 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[93653, 1571, 1677, 565, 1826, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:21:11] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:21:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[93653, 1571, 1677, 565, 1826, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1865 ms. (535 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3620 ms. (1657 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[93653, 1606, 1677, 565, 1826, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:21:17] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:21:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:21:17] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:21:17] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-06-01 01:21:17] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-01 01:21:17] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:21:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:21:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:21:17] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:21:17] [INFO ] [Nat]Added 28 Read/Feed constraints in 9 ms returned sat
[2025-06-01 01:21:17] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 12 ms.
[2025-06-01 01:21:17] [INFO ] Added : 17 causal constraints over 5 iterations in 101 ms. Result :sat
Minimization took 48 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:21:17] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:21:17] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-06-01 01:21:17] [INFO ] [Real]Added 28 Read/Feed constraints in 6 ms returned sat
[2025-06-01 01:21:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:21:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:21:17] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 01:21:17] [INFO ] [Nat]Added 28 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:21:17] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 9 ms to minimize.
[2025-06-01 01:21:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2025-06-01 01:21:18] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 14 ms.
[2025-06-01 01:21:18] [INFO ] Added : 25 causal constraints over 6 iterations in 124 ms. Result :sat
Minimization took 56 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:21:18] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:21:18] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:21:18] [INFO ] [Real]Added 28 Read/Feed constraints in 9 ms returned sat
[2025-06-01 01:21:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:21:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:21:18] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-06-01 01:21:18] [INFO ] [Nat]Added 28 Read/Feed constraints in 9 ms returned sat
[2025-06-01 01:21:18] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 01:21:18] [INFO ] Added : 29 causal constraints over 8 iterations in 143 ms. Result :sat
Minimization took 60 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:21:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:21:18] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:21:18] [INFO ] [Real]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:21:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:21:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:21:18] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-06-01 01:21:18] [INFO ] [Nat]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:21:18] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 01:21:19] [INFO ] Added : 29 causal constraints over 7 iterations in 132 ms. Result :sat
Minimization took 54 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:21:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:21:19] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-06-01 01:21:19] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:21:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:21:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:21:19] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-06-01 01:21:19] [INFO ] [Nat]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:21:19] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 01:21:19] [INFO ] Added : 12 causal constraints over 4 iterations in 88 ms. Result :sat
Minimization took 46 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:21:19] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:21:19] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:21:19] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:21:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:21:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:21:19] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 01:21:19] [INFO ] [Nat]Added 28 Read/Feed constraints in 6 ms returned sat
[2025-06-01 01:21:19] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 14 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:21:19] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 11 ms to minimize.
[2025-06-01 01:21:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2025-06-01 01:21:19] [INFO ] Added : 7 causal constraints over 4 iterations in 200 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[93653, 1606, 1677, 565, 1826, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[93653, 1606, 1677, 565, 1826, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 276/276 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 112/112 places, 276/276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 276/276 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2025-06-01 01:21:30] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:21:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:21:30] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-01 01:21:30] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:21:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:21:30] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-01 01:21:31] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:21:31] [INFO ] Redundant transitions in 2 ms returned []
Running 274 sub problems to find dead transitions.
[2025-06-01 01:21:31] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:21:31] [INFO ] Invariant cache hit.
[2025-06-01 01:21:31] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 178/289 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 1/290 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 143 constraints, problems are : Problem set: 0 solved, 274 unsolved in 20358 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 178/289 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:21:57] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:21:57] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:21:57] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:21:57] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:21:57] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:21:57] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:21:57] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:21:57] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 8/182 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 1/290 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 242/425 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 425 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 50467ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 50468ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51040 ms. Remains : 112/112 places, 276/276 transitions.
[2025-06-01 01:22:21] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {30=1, 90=1, 143=1, 176=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 86=1, 123=1, 169=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :[0, 3, 0, 3, 0, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[93653, 1606, 1677, 565, 1826, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:22:21] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:22:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[93653, 1606, 1677, 565, 1826, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1869 ms. (534 steps per ms)
BEST_FIRST walk for 6000005 steps (12 resets) in 3616 ms. (1658 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[93653, 1606, 1677, 591, 1826, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:22:27] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:22:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:22:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:22:27] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2025-06-01 01:22:27] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-01 01:22:27] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:22:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:22:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:22:27] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-06-01 01:22:27] [INFO ] [Nat]Added 28 Read/Feed constraints in 9 ms returned sat
[2025-06-01 01:22:27] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 12 ms.
[2025-06-01 01:22:27] [INFO ] Added : 17 causal constraints over 5 iterations in 100 ms. Result :sat
Minimization took 48 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:22:27] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:22:27] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:22:27] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:22:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:22:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:22:27] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 01:22:27] [INFO ] [Nat]Added 28 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:22:27] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 8 ms to minimize.
[2025-06-01 01:22:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2025-06-01 01:22:27] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 14 ms.
[2025-06-01 01:22:28] [INFO ] Added : 25 causal constraints over 6 iterations in 121 ms. Result :sat
Minimization took 55 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:22:28] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:22:28] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2025-06-01 01:22:28] [INFO ] [Real]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:22:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:22:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:22:28] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:22:28] [INFO ] [Nat]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:22:28] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 01:22:28] [INFO ] Added : 29 causal constraints over 8 iterations in 143 ms. Result :sat
Minimization took 61 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:22:28] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:22:28] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2025-06-01 01:22:28] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:22:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:22:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:22:28] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-06-01 01:22:28] [INFO ] [Nat]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:22:28] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 12 ms.
[2025-06-01 01:22:28] [INFO ] Added : 29 causal constraints over 7 iterations in 134 ms. Result :sat
Minimization took 54 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:22:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:22:29] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2025-06-01 01:22:29] [INFO ] [Real]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:22:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:22:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:22:29] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-01 01:22:29] [INFO ] [Nat]Added 28 Read/Feed constraints in 9 ms returned sat
[2025-06-01 01:22:29] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 12 ms.
[2025-06-01 01:22:29] [INFO ] Added : 12 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 49 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:22:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:22:29] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2025-06-01 01:22:29] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:22:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:22:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:22:29] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-06-01 01:22:29] [INFO ] [Nat]Added 28 Read/Feed constraints in 6 ms returned sat
[2025-06-01 01:22:29] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:22:29] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 11 ms to minimize.
[2025-06-01 01:22:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2025-06-01 01:22:29] [INFO ] Added : 7 causal constraints over 4 iterations in 203 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[93653, 1606, 1677, 591, 1826, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[93653, 1606, 1677, 591, 1826, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 276/276 transitions.
Applied a total of 0 rules in 8 ms. Remains 112 /112 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 112/112 places, 276/276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 276/276 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2025-06-01 01:22:41] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:22:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:22:41] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-01 01:22:41] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:22:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:22:41] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-01 01:22:41] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:22:41] [INFO ] Redundant transitions in 2 ms returned []
Running 274 sub problems to find dead transitions.
[2025-06-01 01:22:41] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:22:41] [INFO ] Invariant cache hit.
[2025-06-01 01:22:41] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 178/289 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 1/290 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 143 constraints, problems are : Problem set: 0 solved, 274 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 178/289 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:23:07] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:23:07] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:23:07] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:23:07] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:23:07] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:23:07] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:23:07] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:23:07] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 8/182 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 1/290 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 242/425 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 425 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 50148ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 50149ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50667 ms. Remains : 112/112 places, 276/276 transitions.
[2025-06-01 01:23:31] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {30=1, 90=1, 143=1, 176=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 86=1, 123=1, 169=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :[38, 2, 3, 0, 3, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[93653, 1606, 1677, 591, 1826, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:23:31] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:23:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[93653, 1606, 1677, 591, 1826, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1887 ms. (529 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3601 ms. (1665 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[93653, 1606, 1677, 591, 1849, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:23:37] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:23:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:23:37] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:23:37] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:23:37] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-01 01:23:37] [INFO ] [Real]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:23:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:23:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:23:37] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:23:37] [INFO ] [Nat]Added 28 Read/Feed constraints in 9 ms returned sat
[2025-06-01 01:23:37] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 01:23:37] [INFO ] Added : 17 causal constraints over 5 iterations in 103 ms. Result :sat
Minimization took 48 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:23:37] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:23:37] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-06-01 01:23:37] [INFO ] [Real]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:23:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:23:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:23:37] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-06-01 01:23:37] [INFO ] [Nat]Added 28 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:23:38] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 9 ms to minimize.
[2025-06-01 01:23:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2025-06-01 01:23:38] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 12 ms.
[2025-06-01 01:23:38] [INFO ] Added : 25 causal constraints over 6 iterations in 120 ms. Result :sat
Minimization took 56 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:23:38] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:23:38] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-06-01 01:23:38] [INFO ] [Real]Added 28 Read/Feed constraints in 9 ms returned sat
[2025-06-01 01:23:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:23:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:23:38] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:23:38] [INFO ] [Nat]Added 28 Read/Feed constraints in 9 ms returned sat
[2025-06-01 01:23:38] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 01:23:38] [INFO ] Added : 29 causal constraints over 8 iterations in 143 ms. Result :sat
Minimization took 60 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:23:38] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:23:38] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:23:38] [INFO ] [Real]Added 28 Read/Feed constraints in 13 ms returned sat
[2025-06-01 01:23:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:23:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:23:38] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-06-01 01:23:38] [INFO ] [Nat]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:23:38] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 01:23:39] [INFO ] Added : 29 causal constraints over 7 iterations in 133 ms. Result :sat
Minimization took 56 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:23:39] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:23:39] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-06-01 01:23:39] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:23:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:23:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:23:39] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-06-01 01:23:39] [INFO ] [Nat]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:23:39] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 12 ms.
[2025-06-01 01:23:39] [INFO ] Added : 12 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 44 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:23:39] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:23:39] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:23:39] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:23:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:23:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:23:39] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-06-01 01:23:39] [INFO ] [Nat]Added 28 Read/Feed constraints in 6 ms returned sat
[2025-06-01 01:23:39] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:23:39] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 10 ms to minimize.
[2025-06-01 01:23:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2025-06-01 01:23:39] [INFO ] Added : 7 causal constraints over 4 iterations in 196 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[93653, 1606, 1677, 591, 1849, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[93653, 1606, 1677, 591, 1849, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 276/276 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 112/112 places, 276/276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 276/276 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2025-06-01 01:23:52] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:23:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:23:52] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-01 01:23:52] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:23:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:23:52] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-01 01:23:52] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:23:52] [INFO ] Redundant transitions in 2 ms returned []
Running 274 sub problems to find dead transitions.
[2025-06-01 01:23:52] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:23:52] [INFO ] Invariant cache hit.
[2025-06-01 01:23:52] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 178/289 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 1/290 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 143 constraints, problems are : Problem set: 0 solved, 274 unsolved in 20095 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 178/289 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 28/142 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:24:18] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:24:18] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:24:18] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:24:18] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:24:18] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:24:18] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:24:18] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:24:18] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 8/182 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 1/290 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 242/425 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 425 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 50193ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 50194ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50755 ms. Remains : 112/112 places, 276/276 transitions.
[2025-06-01 01:24:42] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {30=1, 90=1, 143=1, 176=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {26=1, 86=1, 123=1, 169=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :[2147483647, 0, 2, 3, 4, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, 1606, 1677, 591, 1849, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:24:43] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:24:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, 1606, 1677, 591, 1849, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 1787 ms. (559 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-00 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 5000005 steps (10 resets) in 3001 ms. (1665 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1606, 1677, 591, 1876, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:24:47] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
[2025-06-01 01:24:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:24:47] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:24:47] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-06-01 01:24:47] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-01 01:24:47] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:24:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:24:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:24:48] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-06-01 01:24:48] [INFO ] [Nat]Added 28 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:24:48] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 8 ms to minimize.
[2025-06-01 01:24:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2025-06-01 01:24:48] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 12 ms.
[2025-06-01 01:24:48] [INFO ] Added : 25 causal constraints over 6 iterations in 120 ms. Result :sat
Minimization took 55 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:24:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:24:48] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-06-01 01:24:48] [INFO ] [Real]Added 28 Read/Feed constraints in 9 ms returned sat
[2025-06-01 01:24:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:24:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:24:48] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 01:24:48] [INFO ] [Nat]Added 28 Read/Feed constraints in 9 ms returned sat
[2025-06-01 01:24:48] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
[2025-06-01 01:24:48] [INFO ] Added : 29 causal constraints over 8 iterations in 146 ms. Result :sat
Minimization took 60 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:24:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:24:48] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-06-01 01:24:48] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:24:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:24:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:24:49] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 01:24:49] [INFO ] [Nat]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:24:49] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 12 ms.
[2025-06-01 01:24:49] [INFO ] Added : 29 causal constraints over 7 iterations in 133 ms. Result :sat
Minimization took 54 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:24:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:24:49] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:24:49] [INFO ] [Real]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:24:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:24:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:24:49] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 01:24:49] [INFO ] [Nat]Added 28 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:24:49] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 12 ms.
[2025-06-01 01:24:49] [INFO ] Added : 12 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 46 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:24:49] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:24:49] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-01 01:24:49] [INFO ] [Real]Added 28 Read/Feed constraints in 6 ms returned sat
[2025-06-01 01:24:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:24:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:24:49] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 01:24:49] [INFO ] [Nat]Added 28 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:24:49] [INFO ] Computed and/alt/rep : 74/403/71 causal constraints (skipped 105 transitions) in 13 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:24:50] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 11 ms to minimize.
[2025-06-01 01:24:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2025-06-01 01:24:50] [INFO ] Added : 7 causal constraints over 4 iterations in 194 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1606, 1677, 591, 1876, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1606, 1677, 591, 1876, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 276/276 transitions.
Graph (complete) has 472 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 110 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 110 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 109 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 109 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 108 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 108 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 107 transition count 266
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 107 transition count 266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 106 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 106 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 105 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 105 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 104 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 104 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 103 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 103 transition count 256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 102 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 102 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 101 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 101 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 100 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 100 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 99 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 99 transition count 248
Applied a total of 25 rules in 29 ms. Remains 99 /112 variables (removed 13) and now considering 248/276 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 99/112 places, 248/276 transitions.
[2025-06-01 01:25:00] [INFO ] Flow matrix only has 157 transitions (discarded 91 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {30=1, 80=1, 130=1, 154=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 81=1, 131=1, 153=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 5) seen :[0, 0, 3, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1606, 1677, 591, 1876, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:25:00] [INFO ] Flow matrix only has 157 transitions (discarded 91 similar events)
// Phase 1: matrix 157 rows 99 cols
[2025-06-01 01:25:00] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1606, 1677, 591, 1876, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1633 ms. (611 steps per ms)
BEST_FIRST walk for 5000005 steps (10 resets) in 2881 ms. (1734 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1606, 1677, 591, 1876, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:25:05] [INFO ] Flow matrix only has 157 transitions (discarded 91 similar events)
[2025-06-01 01:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:25:05] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:25:05] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-06-01 01:25:05] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 01:25:05] [INFO ] [Real]Added 24 Read/Feed constraints in 12 ms returned sat
[2025-06-01 01:25:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:25:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:25:05] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-01 01:25:05] [INFO ] [Nat]Added 24 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:25:05] [INFO ] Computed and/alt/rep : 67/310/63 causal constraints (skipped 92 transitions) in 13 ms.
[2025-06-01 01:25:05] [INFO ] Added : 15 causal constraints over 4 iterations in 92 ms. Result :sat
Minimization took 40 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:25:05] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:25:05] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-06-01 01:25:05] [INFO ] [Real]Added 24 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:25:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:25:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:25:06] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2025-06-01 01:25:06] [INFO ] [Nat]Added 24 Read/Feed constraints in 9 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:25:06] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:25:06] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 10 ms to minimize.
[2025-06-01 01:25:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2025-06-01 01:25:06] [INFO ] Computed and/alt/rep : 67/310/63 causal constraints (skipped 92 transitions) in 10 ms.
[2025-06-01 01:25:06] [INFO ] Added : 6 causal constraints over 2 iterations in 51 ms. Result :sat
Minimization took 37 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:25:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:25:06] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-06-01 01:25:06] [INFO ] [Real]Added 24 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:25:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:25:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:25:06] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-06-01 01:25:06] [INFO ] [Nat]Added 24 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:25:06] [INFO ] Computed and/alt/rep : 67/310/63 causal constraints (skipped 92 transitions) in 11 ms.
[2025-06-01 01:25:06] [INFO ] Added : 15 causal constraints over 4 iterations in 76 ms. Result :sat
Minimization took 43 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:25:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:25:06] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-06-01 01:25:06] [INFO ] [Real]Added 24 Read/Feed constraints in 6 ms returned sat
[2025-06-01 01:25:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:25:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:25:06] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-06-01 01:25:06] [INFO ] [Nat]Added 24 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:25:06] [INFO ] Computed and/alt/rep : 67/310/63 causal constraints (skipped 92 transitions) in 13 ms.
[2025-06-01 01:25:07] [INFO ] Added : 19 causal constraints over 5 iterations in 90 ms. Result :sat
Minimization took 44 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:25:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:25:07] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-06-01 01:25:07] [INFO ] [Real]Added 24 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:25:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:25:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:25:07] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-01 01:25:07] [INFO ] [Nat]Added 24 Read/Feed constraints in 10 ms returned sat
[2025-06-01 01:25:07] [INFO ] Computed and/alt/rep : 67/310/63 causal constraints (skipped 92 transitions) in 11 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:25:07] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 9 ms to minimize.
[2025-06-01 01:25:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2025-06-01 01:25:07] [INFO ] Added : 10 causal constraints over 4 iterations in 188 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1606, 1677, 591, 1876, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1606, 1677, 591, 1876, 2280] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 248/248 transitions.
Applied a total of 0 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 99/99 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 248/248 transitions.
Applied a total of 0 rules in 8 ms. Remains 99 /99 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2025-06-01 01:25:21] [INFO ] Flow matrix only has 157 transitions (discarded 91 similar events)
[2025-06-01 01:25:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:25:21] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-01 01:25:21] [INFO ] Flow matrix only has 157 transitions (discarded 91 similar events)
[2025-06-01 01:25:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:25:21] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 01:25:21] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:25:21] [INFO ] Redundant transitions in 1 ms returned []
Running 246 sub problems to find dead transitions.
[2025-06-01 01:25:21] [INFO ] Flow matrix only has 157 transitions (discarded 91 similar events)
[2025-06-01 01:25:21] [INFO ] Invariant cache hit.
[2025-06-01 01:25:21] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 157/256 variables, 99/102 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/126 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (OVERLAPS) 0/256 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 126 constraints, problems are : Problem set: 0 solved, 246 unsolved in 11361 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 157/256 variables, 99/102 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/126 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 246/372 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:25:39] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:25:39] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:25:39] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:25:39] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:25:39] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:25:39] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:25:40] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:25:40] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 8/380 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 380 constraints, problems are : Problem set: 0 solved, 246 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 41443ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 41444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41945 ms. Remains : 99/99 places, 248/248 transitions.
[2025-06-01 01:26:03] [INFO ] Flow matrix only has 157 transitions (discarded 91 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {30=1, 80=1, 130=1, 154=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 81=1, 131=1, 153=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 5) seen :[2147483647, 4, 0, 4, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, 1677, 591, 1876, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-01 01:26:03] [INFO ] Flow matrix only has 157 transitions (discarded 91 similar events)
[2025-06-01 01:26:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, 1677, 591, 1876, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1843 ms. (542 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-14 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 3000003 steps (6 resets) in 1763 ms. (1700 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1677, 591, 1876] Max Struct:[+inf, +inf, +inf]
[2025-06-01 01:26:07] [INFO ] Flow matrix only has 157 transitions (discarded 91 similar events)
[2025-06-01 01:26:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:26:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:26:07] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-06-01 01:26:07] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-01 01:26:07] [INFO ] [Real]Added 24 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:26:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:26:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:26:07] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-01 01:26:07] [INFO ] [Nat]Added 24 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 9 ms to minimize.
[2025-06-01 01:26:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2025-06-01 01:26:07] [INFO ] Computed and/alt/rep : 67/310/63 causal constraints (skipped 92 transitions) in 12 ms.
[2025-06-01 01:26:07] [INFO ] Added : 6 causal constraints over 2 iterations in 55 ms. Result :sat
Minimization took 37 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:26:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:26:07] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-06-01 01:26:07] [INFO ] [Real]Added 24 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:26:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:26:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:26:07] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-06-01 01:26:07] [INFO ] [Nat]Added 24 Read/Feed constraints in 6 ms returned sat
[2025-06-01 01:26:07] [INFO ] Computed and/alt/rep : 67/310/63 causal constraints (skipped 92 transitions) in 11 ms.
[2025-06-01 01:26:07] [INFO ] Added : 15 causal constraints over 4 iterations in 77 ms. Result :sat
Minimization took 42 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:26:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:26:08] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-06-01 01:26:08] [INFO ] [Real]Added 24 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:26:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:26:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:26:08] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-01 01:26:08] [INFO ] [Nat]Added 24 Read/Feed constraints in 6 ms returned sat
[2025-06-01 01:26:08] [INFO ] Computed and/alt/rep : 67/310/63 causal constraints (skipped 92 transitions) in 13 ms.
[2025-06-01 01:26:08] [INFO ] Added : 19 causal constraints over 5 iterations in 93 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1677, 591, 1876] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1677, 591, 1876] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 248/248 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 97 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 97 transition count 244
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 97 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 96 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 96 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 95 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 95 transition count 236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 94 transition count 234
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 94 transition count 234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 93 transition count 232
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 93 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 92 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 92 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 91 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 91 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 90 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 90 transition count 226
Applied a total of 20 rules in 15 ms. Remains 90 /99 variables (removed 9) and now considering 226/248 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 90/99 places, 226/248 transitions.
[2025-06-01 01:26:12] [INFO ] Flow matrix only has 142 transitions (discarded 84 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {27=1, 68=1, 101=1, 135=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 66=1, 99=1, 137=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :[3, 0, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[1677, 591, 1876] Max Struct:[+inf, +inf, +inf]
[2025-06-01 01:26:12] [INFO ] Flow matrix only has 142 transitions (discarded 84 similar events)
// Phase 1: matrix 142 rows 90 cols
[2025-06-01 01:26:12] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1677, 591, 1876] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 1529 ms. (653 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 1668 ms. (1797 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1677, 591, 1876] Max Struct:[+inf, +inf, +inf]
[2025-06-01 01:26:15] [INFO ] Flow matrix only has 142 transitions (discarded 84 similar events)
[2025-06-01 01:26:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:26:16] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:26:16] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-06-01 01:26:16] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 01:26:16] [INFO ] [Real]Added 21 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:26:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:26:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:26:16] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-06-01 01:26:16] [INFO ] [Nat]Added 21 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:26:16] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 8 ms to minimize.
[2025-06-01 01:26:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2025-06-01 01:26:16] [INFO ] Computed and/alt/rep : 64/253/59 causal constraints (skipped 81 transitions) in 11 ms.
[2025-06-01 01:26:16] [INFO ] Added : 21 causal constraints over 6 iterations in 100 ms. Result :sat
Minimization took 36 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:26:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:26:16] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-06-01 01:26:16] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2025-06-01 01:26:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:26:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:26:16] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-06-01 01:26:16] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2025-06-01 01:26:16] [INFO ] Computed and/alt/rep : 64/253/59 causal constraints (skipped 81 transitions) in 12 ms.
[2025-06-01 01:26:16] [INFO ] Added : 15 causal constraints over 5 iterations in 81 ms. Result :sat
Minimization took 35 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:26:16] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:26:16] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-01 01:26:16] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2025-06-01 01:26:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:26:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:26:16] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-06-01 01:26:16] [INFO ] [Nat]Added 21 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:26:17] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 8 ms to minimize.
[2025-06-01 01:26:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2025-06-01 01:26:17] [INFO ] Computed and/alt/rep : 64/253/59 causal constraints (skipped 81 transitions) in 10 ms.
[2025-06-01 01:26:17] [INFO ] Added : 17 causal constraints over 5 iterations in 80 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1677, 591, 1876] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1677, 591, 1876] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 90/90 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2025-06-01 01:26:27] [INFO ] Flow matrix only has 142 transitions (discarded 84 similar events)
[2025-06-01 01:26:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:26:27] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-01 01:26:27] [INFO ] Flow matrix only has 142 transitions (discarded 84 similar events)
[2025-06-01 01:26:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:26:27] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 01:26:28] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:26:28] [INFO ] Redundant transitions in 1 ms returned []
Running 224 sub problems to find dead transitions.
[2025-06-01 01:26:28] [INFO ] Flow matrix only has 142 transitions (discarded 84 similar events)
[2025-06-01 01:26:28] [INFO ] Invariant cache hit.
[2025-06-01 01:26:28] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 142/232 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 224 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 21/114 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 0/232 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 114 constraints, problems are : Problem set: 0 solved, 224 unsolved in 5745 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 142/232 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 21/114 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 224/338 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:26:39] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:26:39] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:26:39] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:26:39] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:26:39] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:26:39] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:26:40] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:26:40] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 8/346 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 346 constraints, problems are : Problem set: 0 solved, 224 unsolved in 25748 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 31567ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 31567ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31982 ms. Remains : 90/90 places, 226/226 transitions.
[2025-06-01 01:26:59] [INFO ] Flow matrix only has 142 transitions (discarded 84 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {27=1, 68=1, 101=1, 135=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 66=1, 99=1, 137=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 3) seen :[0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1677, 591, 1876] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 40000 steps (8 resets) in 672 ms. (59 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
[2025-06-01 01:27:00] [INFO ] Flatten gal took : 82 ms
[2025-06-01 01:27:00] [INFO ] Flatten gal took : 39 ms
[2025-06-01 01:27:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10907839598256105162.gal : 31 ms
[2025-06-01 01:27:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2282108043870302545.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10907839598256105162.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2282108043870302545.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2282108043870302545.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :27 after 364
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :364 after 1509
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1509 after 3458
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :3458 after 8835
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :8835 after 25696
Interrupted probabilistic random walk after 494447 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :1 out of 3
Probabilistic random walk after 494447 steps, saw 307776 distinct states, run finished after 3006 ms. (steps per millisecond=164 ) properties seen :1
[2025-06-01 01:27:03] [INFO ] Flow matrix only has 142 transitions (discarded 84 similar events)
[2025-06-01 01:27:03] [INFO ] Invariant cache hit.
[2025-06-01 01:27:03] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/91 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/100 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 113/213 variables, 65/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 6/219 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/231 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/232 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/232 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 114 constraints, problems are : Problem set: 0 solved, 2 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/91 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9/100 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 113/213 variables, 65/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/219 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/231 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:27:03] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/231 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/231 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/232 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/232 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/232 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 117 constraints, problems are : Problem set: 0 solved, 2 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 90/90 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 683ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :25696 after 84093
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :84093 after 300029
Parikh walk visited 0 properties in 30000 ms.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 226/226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 87 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 86 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 86 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 85 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 85 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 84 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 83 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 80 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 202
Applied a total of 20 rules in 20 ms. Remains 80 /90 variables (removed 10) and now considering 202/226 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 80/90 places, 202/226 transitions.
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :300029 after 1.12635e+06
Interrupted probabilistic random walk after 524123 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 2
Probabilistic random walk after 524123 steps, saw 326254 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
[2025-06-01 01:27:36] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2025-06-01 01:27:36] [INFO ] Computed 3 invariants in 1 ms
[2025-06-01 01:27:36] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/80 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 100/187 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/193 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 10/203 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/204 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 101 constraints, problems are : Problem set: 0 solved, 2 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/80 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/87 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 100/187 variables, 57/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 17/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/193 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 10/203 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:27:37] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/203 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/203 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/204 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/204 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/204 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 104 constraints, problems are : Problem set: 0 solved, 2 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 554ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Detected timeout of ITS tools.
[2025-06-01 01:27:50] [INFO ] Flatten gal took : 89 ms
[2025-06-01 01:27:50] [INFO ] Applying decomposition
[2025-06-01 01:27:50] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8939969017046280508.txt' '-o' '/tmp/graph8939969017046280508.bin' '-w' '/tmp/graph8939969017046280508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8939969017046280508.bin' '-l' '-1' '-v' '-w' '/tmp/graph8939969017046280508.weights' '-q' '0' '-e' '0.001'
[2025-06-01 01:27:50] [INFO ] Decomposing Gal with order
[2025-06-01 01:27:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 01:27:50] [INFO ] Removed a total of 386 redundant transitions.
[2025-06-01 01:27:50] [INFO ] Flatten gal took : 114 ms
[2025-06-01 01:27:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 28 ms.
[2025-06-01 01:27:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8839822464052541133.gal : 10 ms
[2025-06-01 01:27:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12910817404036353123.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8839822464052541133.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12910817404036353123.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12910817404036353123.prop.
Parikh walk visited 0 properties in 30000 ms.
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 80/80 places, 202/202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-01 01:28:07] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2025-06-01 01:28:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:28:07] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-01 01:28:07] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2025-06-01 01:28:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:28:07] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 01:28:07] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:28:07] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2025-06-01 01:28:07] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2025-06-01 01:28:07] [INFO ] Invariant cache hit.
[2025-06-01 01:28:07] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 101 constraints, problems are : Problem set: 0 solved, 200 unsolved in 5921 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 200/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:28:18] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:28:18] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:28:18] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:28:18] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:28:18] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:28:18] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:28:18] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 7/308 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 308 constraints, problems are : Problem set: 0 solved, 200 unsolved in 17342 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 23363ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 23364ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23784 ms. Remains : 80/80 places, 202/202 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 80 transition count 118
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 74 transition count 118
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 90 place count 74 transition count 102
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 122 place count 58 transition count 102
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 152 place count 43 transition count 87
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 159 place count 36 transition count 73
Iterating global reduction 2 with 7 rules applied. Total rules applied 166 place count 36 transition count 73
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 173 place count 29 transition count 59
Iterating global reduction 2 with 7 rules applied. Total rules applied 180 place count 29 transition count 59
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 187 place count 22 transition count 45
Iterating global reduction 2 with 7 rules applied. Total rules applied 194 place count 22 transition count 45
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 201 place count 22 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 201 place count 22 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 203 place count 21 transition count 37
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 3 with 2 rules applied. Total rules applied 205 place count 20 transition count 37
Applied a total of 205 rules in 28 ms. Remains 20 /80 variables (removed 60) and now considering 37/202 (removed 165) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 37 rows 20 cols
[2025-06-01 01:28:31] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 01:28:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 01:28:31] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2025-06-01 01:28:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 01:28:31] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-01 01:28:31] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 01:28:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 01:28:31] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-01 01:28:31] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-01 01:28:31] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-01 01:28:31] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-01 01:28:31] [INFO ] Flatten gal took : 15 ms
[2025-06-01 01:28:31] [INFO ] Flatten gal took : 3 ms
[2025-06-01 01:28:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12421294664552922612.gal : 1 ms
[2025-06-01 01:28:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8728712264034331186.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12421294664552922612.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8728712264034331186.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8728712264034331186.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 88
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :88 after 312
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :312 after 1180
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1180 after 4512
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4512 after 17448
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :17448 after 68144
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :68144 after 268348
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :268348 after 1.06298e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.06298e+06 after 4.22716e+06
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2025-06-01 01:28:46] [INFO ] Flatten gal took : 3 ms
[2025-06-01 01:28:46] [INFO ] Applying decomposition
[2025-06-01 01:28:46] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17060021046570248709.txt' '-o' '/tmp/graph17060021046570248709.bin' '-w' '/tmp/graph17060021046570248709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17060021046570248709.bin' '-l' '-1' '-v' '-w' '/tmp/graph17060021046570248709.weights' '-q' '0' '-e' '0.001'
[2025-06-01 01:28:46] [INFO ] Decomposing Gal with order
[2025-06-01 01:28:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 01:28:46] [INFO ] Removed a total of 42 redundant transitions.
[2025-06-01 01:28:46] [INFO ] Flatten gal took : 12 ms
[2025-06-01 01:28:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2025-06-01 01:28:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8579760114847182764.gal : 9 ms
[2025-06-01 01:28:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5890283905898632927.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8579760114847182764.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5890283905898632927.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5890283905898632927.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30319 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1677, 591, 1876] Max Struct:[+inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-b002-UpperBounds-07
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]
[2025-06-01 01:29:01] [INFO ] Flow matrix only has 142 transitions (discarded 84 similar events)
// Phase 1: matrix 142 rows 90 cols
[2025-06-01 01:29:01] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2025-06-01 01:29:01] [INFO ] Flow matrix only has 142 transitions (discarded 84 similar events)
[2025-06-01 01:29:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:29:01] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:29:01] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-06-01 01:29:01] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 01:29:01] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2025-06-01 01:29:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:29:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:29:01] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-06-01 01:29:01] [INFO ] [Nat]Added 21 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:01] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 9 ms to minimize.
[2025-06-01 01:29:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2025-06-01 01:29:01] [INFO ] Computed and/alt/rep : 64/253/59 causal constraints (skipped 81 transitions) in 10 ms.
[2025-06-01 01:29:02] [INFO ] Added : 21 causal constraints over 6 iterations in 109 ms. Result :sat
Minimization took 37 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 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 226/226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 87 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 86 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 86 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 85 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 85 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 84 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 83 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 80 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 202
Applied a total of 20 rules in 30 ms. Remains 80 /90 variables (removed 10) and now considering 202/226 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 80/90 places, 202/226 transitions.
[2025-06-01 01:29:02] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {27=1, 58=1, 104=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {29=1, 60=1, 90=1, 119=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2025-06-01 01:29:02] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2025-06-01 01:29:02] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1416 ms. (705 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 536 ms. (1862 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1612] Max Struct:[+inf]
[2025-06-01 01:29:04] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2025-06-01 01:29:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:29:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:29:04] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-01 01:29:04] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 01:29:04] [INFO ] [Real]Added 18 Read/Feed constraints in 9 ms returned sat
[2025-06-01 01:29:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:29:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:29:04] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-06-01 01:29:04] [INFO ] [Nat]Added 18 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:04] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 6 ms to minimize.
[2025-06-01 01:29:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2025-06-01 01:29:04] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 69 transitions) in 9 ms.
[2025-06-01 01:29:04] [INFO ] Added : 8 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1612] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1612] Max Struct:[+inf]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 80/80 places, 202/202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-01 01:29:04] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2025-06-01 01:29:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:29:04] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-01 01:29:04] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2025-06-01 01:29:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:29:04] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 01:29:05] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:29:05] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2025-06-01 01:29:05] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2025-06-01 01:29:05] [INFO ] Invariant cache hit.
[2025-06-01 01:29:05] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 101 constraints, problems are : Problem set: 0 solved, 200 unsolved in 5974 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 200/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:15] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:15] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:15] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:15] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:15] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:15] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:15] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 7/308 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 308 constraints, problems are : Problem set: 0 solved, 200 unsolved in 17372 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 23410ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 23412ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23852 ms. Remains : 80/80 places, 202/202 transitions.
[2025-06-01 01:29:28] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {27=1, 58=1, 104=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 60=1, 90=1, 119=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1612] Max Struct:[+inf]
[2025-06-01 01:29:28] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2025-06-01 01:29:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1612] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 1414 ms. (706 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 536 ms. (1862 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1612] Max Struct:[+inf]
[2025-06-01 01:29:30] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2025-06-01 01:29:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:29:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:29:30] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2025-06-01 01:29:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 01:29:30] [INFO ] [Real]Added 18 Read/Feed constraints in 8 ms returned sat
[2025-06-01 01:29:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:29:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:29:30] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-01 01:29:30] [INFO ] [Nat]Added 18 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:30] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 7 ms to minimize.
[2025-06-01 01:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2025-06-01 01:29:30] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 69 transitions) in 9 ms.
[2025-06-01 01:29:30] [INFO ] Added : 8 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1612] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1612] Max Struct:[+inf]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 80/80 places, 202/202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-01 01:29:30] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2025-06-01 01:29:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:29:30] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-01 01:29:30] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2025-06-01 01:29:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:29:31] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 01:29:31] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:29:31] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2025-06-01 01:29:31] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2025-06-01 01:29:31] [INFO ] Invariant cache hit.
[2025-06-01 01:29:31] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 101 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6072 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 200/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:41] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:41] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:41] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:41] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:41] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:41] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:29:41] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 7/308 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 308 constraints, problems are : Problem set: 0 solved, 200 unsolved in 17214 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 23350ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 23350ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23759 ms. Remains : 80/80 places, 202/202 transitions.
[2025-06-01 01:29:54] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {27=1, 58=1, 104=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {29=1, 60=1, 90=1, 119=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[1612] Max Struct:[+inf]
[2025-06-01 01:29:54] [INFO ] Flatten gal took : 39 ms
RANDOM walk for 40000 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
[2025-06-01 01:29:54] [INFO ] Flatten gal took : 16 ms
[2025-06-01 01:29:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17215242166972197970.gal : 14 ms
[2025-06-01 01:29:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1484922536841131503.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17215242166972197970.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1484922536841131503.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality1484922536841131503.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :27 after 351
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :351 after 786
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :786 after 1406
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1406 after 5358
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5358 after 46503
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :46503 after 128160
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :128160 after 290841
Interrupted probabilistic random walk after 1474723 steps, run timeout after 3001 ms. (steps per millisecond=491 ) properties seen :0 out of 1
Probabilistic random walk after 1474723 steps, saw 917927 distinct states, run finished after 3001 ms. (steps per millisecond=491 ) properties seen :0
[2025-06-01 01:29:57] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2025-06-01 01:29:57] [INFO ] Invariant cache hit.
[2025-06-01 01:29:57] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 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) 73/86 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/93 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 96/189 variables, 55/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 17/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/195 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/204 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 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) 73/86 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/93 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 96/189 variables, 55/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 17/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/195 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/195 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/204 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/204 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/204 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 301ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 220582 steps, including 962 resets, run visited all 1 properties in 426 ms. (steps per millisecond=517 )
Parikh walk visited 1 properties in 431 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:[1612] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b002-UpperBounds-07 in 56966 ms.
Starting property specific reduction for FunctionPointer-PT-b002-UpperBounds-08
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]
[2025-06-01 01:29:58] [INFO ] Flow matrix only has 142 transitions (discarded 84 similar events)
// Phase 1: matrix 142 rows 90 cols
[2025-06-01 01:29:58] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 01:29:58] [INFO ] Flow matrix only has 142 transitions (discarded 84 similar events)
[2025-06-01 01:29:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:29:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:29:58] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-06-01 01:29:58] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 01:29:58] [INFO ] [Real]Added 21 Read/Feed constraints in 5 ms returned sat
[2025-06-01 01:29:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:29:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:29:58] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2025-06-01 01:29:58] [INFO ] [Nat]Added 21 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:29:58] [INFO ] Computed and/alt/rep : 64/253/59 causal constraints (skipped 81 transitions) in 12 ms.
[2025-06-01 01:29:58] [INFO ] Added : 15 causal constraints over 5 iterations in 82 ms. Result :sat
Minimization took 34 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:[1] Max Struct:[+inf]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 226/226 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 87 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 86 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 86 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 85 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 85 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 84 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 84 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 83 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 210
Applied a total of 14 rules in 13 ms. Remains 83 /90 variables (removed 7) and now considering 210/226 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 83/90 places, 210/226 transitions.
[2025-06-01 01:29:58] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {29=1, 64=1, 96=1, 126=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 64=1, 112=1, 128=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-01 01:29:59] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2025-06-01 01:29:59] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 1493 ms. (669 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 544 ms. (1834 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-01 01:30:01] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2025-06-01 01:30:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:30:01] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:30:01] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2025-06-01 01:30:01] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 01:30:01] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2025-06-01 01:30:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:30:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:30:01] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-06-01 01:30:01] [INFO ] [Nat]Added 18 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:30:01] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 7 ms to minimize.
[2025-06-01 01:30:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2025-06-01 01:30:01] [INFO ] Computed and/alt/rep : 61/202/55 causal constraints (skipped 73 transitions) in 9 ms.
[2025-06-01 01:30:01] [INFO ] Added : 12 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 32 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 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 83/83 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2025-06-01 01:30:01] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2025-06-01 01:30:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:30:01] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-01 01:30:01] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2025-06-01 01:30:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:30:01] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 01:30:01] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:30:01] [INFO ] Redundant transitions in 1 ms returned []
Running 208 sub problems to find dead transitions.
[2025-06-01 01:30:01] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2025-06-01 01:30:01] [INFO ] Invariant cache hit.
[2025-06-01 01:30:01] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 130/213 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 104 constraints, problems are : Problem set: 0 solved, 208 unsolved in 8724 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 130/213 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 208/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:30:15] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:30:15] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:30:15] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:30:15] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:30:15] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:30:16] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:30:16] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 7/319 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:30:20] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/213 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 320 constraints, problems are : Problem set: 0 solved, 208 unsolved in 23488 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 32293ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 32293ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32692 ms. Remains : 83/83 places, 210/210 transitions.
[2025-06-01 01:30:34] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {29=1, 64=1, 96=1, 126=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 64=1, 112=1, 128=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-01 01:30:34] [INFO ] Flatten gal took : 15 ms
[2025-06-01 01:30:34] [INFO ] Flatten gal took : 34 ms
[2025-06-01 01:30:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15600728845839775097.gal : 2 ms
[2025-06-01 01:30:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality756142152158685572.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15600728845839775097.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality756142152158685572.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33685 steps (7 resets) in 33 ms. (990 steps per ms) remains 0/1 properties
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-b002-UpperBounds-08 in 35797 ms.
Starting property specific reduction for FunctionPointer-PT-b002-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]
[2025-06-01 01:30:34] [INFO ] Flow matrix only has 142 transitions (discarded 84 similar events)
// Phase 1: matrix 142 rows 90 cols
[2025-06-01 01:30:34] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[22] Max Struct:[+inf]
[2025-06-01 01:30:34] [INFO ] Flow matrix only has 142 transitions (discarded 84 similar events)
[2025-06-01 01:30:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:30:34] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 01:30:34] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-06-01 01:30:34] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 01:30:34] [INFO ] [Real]Added 21 Read/Feed constraints in 7 ms returned sat
[2025-06-01 01:30:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:30:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 01:30:34] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-06-01 01:30:34] [INFO ] [Nat]Added 21 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:30:34] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 7 ms to minimize.
[2025-06-01 01:30:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2025-06-01 01:30:34] [INFO ] Computed and/alt/rep : 64/253/59 causal constraints (skipped 81 transitions) in 10 ms.
[2025-06-01 01:30:34] [INFO ] Added : 17 causal constraints over 5 iterations in 81 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[22] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[22] Max Struct:[+inf]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 226/226 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 88 transition count 220
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 88 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 87 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 86 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 86 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 85 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 85 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 84 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 84 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 83 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 80 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 79 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 79 transition count 198
Applied a total of 22 rules in 14 ms. Remains 79 /90 variables (removed 11) and now considering 198/226 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 79/90 places, 198/226 transitions.
[2025-06-01 01:30:34] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {31=1, 60=1, 106=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 59=1, 105=1, 120=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2025-06-01 01:30:34] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
// Phase 1: matrix 122 rows 79 cols
[2025-06-01 01:30:34] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1400 ms. (713 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 01:30:36] [INFO ] Flatten gal took : 14 ms
[2025-06-01 01:30:36] [INFO ] Flatten gal took : 13 ms
[2025-06-01 01:30:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11699755366443643432.gal : 2 ms
[2025-06-01 01:30:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8246601099638954847.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11699755366443643432.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8246601099638954847.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
ITS runner timed out or was interrupted.
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-b002-UpperBounds-13 in 2061 ms.
[2025-06-01 01:30:36] [INFO ] Flatten gal took : 13 ms
[2025-06-01 01:30:36] [INFO ] Applying decomposition
[2025-06-01 01:30:36] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6391705852063922727.txt' '-o' '/tmp/graph6391705852063922727.bin' '-w' '/tmp/graph6391705852063922727.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6391705852063922727.bin' '-l' '-1' '-v' '-w' '/tmp/graph6391705852063922727.weights' '-q' '0' '-e' '0.001'
[2025-06-01 01:30:36] [INFO ] Decomposing Gal with order
[2025-06-01 01:30:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 01:30:36] [INFO ] Removed a total of 386 redundant transitions.
[2025-06-01 01:30:36] [INFO ] Flatten gal took : 44 ms
[2025-06-01 01:30:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 11 ms.
[2025-06-01 01:30:36] [INFO ] Time to serialize gal into /tmp/UpperBounds8765013388849527604.gal : 8 ms
[2025-06-01 01:30:36] [INFO ] Time to serialize properties into /tmp/UpperBounds331683791641617020.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8765013388849527604.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds331683791641617020.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...282
Loading property file /tmp/UpperBounds331683791641617020.prop.
Detected timeout of ITS tools.
[2025-06-01 01:56:19] [INFO ] Flatten gal took : 14 ms
[2025-06-01 01:56:19] [INFO ] Time to serialize gal into /tmp/UpperBounds16295936595724876317.gal : 3 ms
[2025-06-01 01:56:19] [INFO ] Time to serialize properties into /tmp/UpperBounds2895385118915944115.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16295936595724876317.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2895385118915944115.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds2895385118915944115.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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-b002"
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-5832"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b002, 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 r100-smll-174867007300061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b002.tgz
mv FunctionPointer-PT-b002 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.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 ;